Ye Liu

Ye Liu

Auto-generated profile, based on publicly available information

Ye Liu

Department of Engineering Science, University of Oxford, Oxford, U.K.

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 November 2017 in IEEE Communications Letters
Verified
Journal Article
Open access
YLYe Liu
Ye Liu
MDMahsa Derakhshani
Mahsa Derakhshani
SLSangarapillai Lambotharan
Sangarapillai Lambotharan
We propose a tractable expression for the outage probability in single-cell uplink non-orthogonal multiple access (NOMA) systems serving an arbitrary number of users. The expression is obtained by approximating the inter-user interference using a shifted-gamma distributed random variable. We then formulate and propose an efficient iterative algorithm for the outage-constrained min-max power allocation problem for the NOMA system. To give a rigorous comparison, we solve the outage-constrained min-max power allocation problem for the orthogonal multiple access (OMA) counterpart where both the user power allocation and the radio resource division pattern are optimized. Simulations confirm the accuracy of the derived outage probability expression for the NOMA system. Also, we demonstrate that fairness among users in terms of transmission power can be achieved by NOMA. Moreover, NOMA can bring significant power savings to the users as compared to OMA.

11 January 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
Yaru FuYaru Fu
Yaru Fu
YLYe Liu
Ye Liu
HWHong Wang
Hong Wang
ZSZheng Shi
Zheng Shi
YLYuanwei Liu
Yuanwei Liu
By analytically showing that index coding (IC) is more power efficient than superposition coding (SC) when appropriate caching contents are available for a pair of users, we propose a sub-optimal joint user clustering and power allocation scheme for a single-cell downlink non-orthogonal multiple access network with caching memory at the receivers that alternate between IC and SC. Simulation studies demonstrate that the proposed scheme significantly reduces the transmission power when compared with the benchmark scheme that only allows SC.

18 September 2017 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
YLYe Liu
Ye Liu
Chung Shue ChenChung Shue Chen
Chung Shue Chen
CSChi Wan Sung
Chi Wan Sung
CSChandramani Singh
Chandramani Singh
To obtain good network performance in Long Term Evolution-Advanced (LTE-A) heterogeneous networks (HetNets), enhanced inter-cell interference coordination (eICIC) and further eICIC (FeICIC) have been proposed by LTE standardization bodies to address the entangled inter-cell interference and the user association problems. We propose the distributed algorithms based on the exact potential game framework for both eICIC and FeICIC optimizations. We demonstrate via simulations a 64% gain on energy efficiency (EE) achieved by eICIC and another 17% gain on EE achieved by FeICIC. We also show that FeICIC can bring other significant gains in terms of cell-edge throughput, spectral efficiency, and fairness among user throughputs. Moreover, we propose a downlink scheduler based on a cake-cutting algorithm that can further improve the performance of the optimization algorithms compared with conventional schedulers.

27 January 2014 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YLYe Liu
Ye Liu
CSChi Wan Sung
Chi Wan Sung
In erasure broadcast channels, network coding has been demonstrated to be an efficient way to satisfy each user's demand. However, the erasure broadcast channel model does not fully characterize the information available in a "lost" packet, and therefore any retransmission schemes designed based on the erasure broadcast channel model cannot make use of that information. In this paper, we characterize the quality of erroneous packets by Signal-to-Noise Ratio (SNR) and then design a network coding retransmission scheme with the knowledge of the SNRs of the erroneous packets, so that a user can immediately decode two source packets upon reception of a useful retransmission packet. We demonstrate that our proposed scheme, namely Quality-Aware Instantly Decodable Network Coding (QAIDNC), can increase the transmission efficiency significantly compared to the existing Instantly Decodable Network Coding (IDNC) and Random Linear Network Coding (RLNC).

12 June 2018 in IEEE Transactions on Communications
Verified
Journal Article
Open access
YLYe Liu
Ye Liu
MDMahsa Derakhshani
Mahsa Derakhshani
SPSaeedeh Parsaeefard
Saeedeh Parsaeefard
SLSangarapillai Lambotharan
Sangarapillai Lambotharan
KWKai Kit Wong
Kai Kit Wong
We study a resource allocation problem for the uplink of a virtualized massive multiple-input multiple-output (MIMO) system, where the antennas at the base station are priced and virtualized among the service providers (SPs). The mobile network operator (MNO) who owns the infrastructure decides the price per antenna, and a Stackelberg game is formulated for the net profit maximization of the MNO, while minimum rate requirements of SPs are satisfied. To solve the bi-level optimization problem of the MNO, we first derive the closed-form best responses of the SPs with respect to the pricing strategies of the MNO, such that the problem of the MNO can be reduced to a single-level optimization. Then, via transformations and approximations, we cast the MNO’s problem with integer constraints into a signomial geometric program (SGP), and we propose an iterative algorithm based on the successive convex approximation (SCA) to solve the SGP. Simulation results show that the proposed algorithm has performance close to the global optimum. Moreover, the interactions between the MNO and SPs in different scenarios are explored via simulations.

1 May 2019
Verified
Conference Paper
Closed access
Yaru FuYaru Fu
Yaru Fu
KSKenneth W. Shumt
Kenneth W. Shumt
CSChi Wan Sung
Chi Wan Sung
YLYe Liu
Ye Liu
The user pairing problem for cache-based timeslotted non-orthogonal multiple access (NOMA) system with index coding is investigated. During each time slot, the packets of two users are scheduled at the base station. In accordance with different cache information of the scheduled users, either superposition coding or index coding is applied for base station transmission. For some specific case, the superior performance on the aspect of power consumption of index coding compared to that of superposition coding is analyzed. Besides, the power saving of our design system when compared to that of the NOMA system with pure superposition coding is also demonstrated in a mathematical way. Subsequently, we show that the original user scheduling problem can be transformed in quadratic time into a minimum weight perfect matching problem of an undirected graph, which can be solved with time complexity O(K 3 ), where K is the number of users. Based on this transformation, the feasibility of any given system is analyzed. Furthermore, we formulate the minimum weight perfect matching problem as an integer linear problem and solve it by integer linear programming. Numerical results validate the performance gains of our proposed system from the aspects of total transmit power and outage probability.