arXiv subjects

Yonghui Li

Publications and source records attributed to Yonghui Li.

At least 235 records · Page 13Linked to original sources

arXiv2017

On the Performance of X-Duplex Relaying

In this paper, we study a X-duplex relay system with one source, one amplify-and-forward (AF) relay and one destination, where the relay is equipped with a shared antenna and two radio frequency (RF) chains used for transmission or reception. X-duplex relay can adaptively configure the connection between its RF chains and antenna to operate in either HD or FD mode, according to the instantaneous channel conditions. We first derive the distribution of the signal to interference plus noise ratio (SINR), based on which we then analyze the outage probability, average symbol error rate (SER), and average sum rate. We also investigate the X-duplex relay with power allocation and derive the lower bound and upper bound of the corresponding outage probability. Both analytical and simulated results show that the X-duplex relay achieves a better performance over pure FD and HD schemes in terms of SER, outage probability and average sum rate, and the performance floor caused by the residual self interference can be eliminated using flexible RF chain configurations.

cs.NI↗

arXiv2016

Sub-channel and Power Allocation for Non-orthogonal Multiple Access Relay Networks with Amplify-and-Forward Protocol

In this paper, we study the resource allocation problem for a single-cell non-orthogonal multiple access (NOMA) relay network where an OFDM amplify-and-forward (AF) relay allocates the spectrum and power resources to the source-destination (SD) pairs. We aim to optimize the resource allocation to maximize the average sum-rate. The optimal approach requires an exhaustive search, leading to an NP-hard problem. To solve this problem, we propose two efficient many-to-many two-sided SD pair-subchannel matching algorithms in which the SD pairs and sub-channels are considered as two sets of players chasing their own interests. The proposed algorithms can provide a sub-optimal solution to this resource allocation problem in affordable time. Both the static matching algorithm and dynamic matching algorithm converge to a pair-wise stable matching after a limited number of iterations. Simulation results show that the capacity of both proposed algorithms in the NOMA scheme significantly outperforms the conventional orthogonal multiple access scheme. The proposed matching algorithms in NOMA scheme also achieve a better user-fairness performance than the conventional orthogonal multiple access.

cs.NI↗

arXiv2016

Duality of Channel Encoding and Decoding - Part I: Rate-1 Binary Convolutional Codes

In this paper, we revisit the forward, backward and bidirectional Bahl-Cocke-Jelinek-Raviv (BCJR) soft-input soft-output (SISO) maximum a posteriori probability (MAP) decoding process of rate-1 binary convolutional codes. From this we establish some interesting explicit relationships between encoding and decoding of rate-1 convolutional codes. We observe that the forward and backward BCJR SISO MAP decoders can be simply represented by their dual SISO channel encoders using shift registers in the complex number field. Similarly, the bidirectional MAP decoding can be implemented by linearly combining the shift register contents of the dual SISO encoders of the respective forward and backward decoders. The dual encoder structures for various recursive and non-recursive rate-1 convolutional codes are derived.

cs.IT↗

arXiv2016

Cost Efficiency for Economical Mobile Data Traffic Management from Users' Perspective

Explosive demand for wireless internet services has posed critical challenges for wireless network due to its limited capacity. To tackle this hurdle, wireless Internet service providers (WISPs) take the smart data pricing to manage data traffic loads. Meanwhile, from the users' perspective, it is also reasonable and desired to employ mobile data traffic management under the pricing policies of WISPs to improve the economic efficiency of data consumption. In this paper we introduce a concept of cost efficiency for user's mobile data management, defined as the ratio of user's mobile data consumption benefits and its expense. We propose an integrated cost-efficiency-based data traffic management scheme including long-term data demand planning, short-term data traffic pre-scheduling and real-time data traffic management. The real-time data traffic management algorithm is proposed to coordinate user's data consumption to tailor to the pre-scheduled data traffic profile. Numerical results demonstrate the effectiveness of cost efficiency framework in indicating and motivating mobile user's data consumption behavior. The proposed management scheme can effectively motivate the user to adjust its data consumption profile to obtain the optimal data consumption cost efficiency.

cs.NI↗

arXiv2016

Random Multiple Access for M2M Communications with QoS Guarantees

We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type communication (MTC) devices transmit over the same radio channel. Based on the latency requirements, MTC devices are divided into groups of different sizes, and the transmission frame is divided into subframes of different lengths. In each subframe, each group is assigned an access probability based on which an MTC device decides to transmit replicas of its packet or remain silent. The base station (BS) employs successive interference cancellation (SIC) to recover all the superposed packets. We derive the closed form expressions for the average probability of device resolution for each group, and we use these expressions to design the access probabilities. The accuracy of the expressions is validated through Monte Carlo simulations. We show that the designed access probabilities can guarantee the QoS requirements with high reliability and high energy efficiency. Finally, we show that RMA can outperform standard coordinated access schemes as well as some of the recently proposed M2M access schemes for cellular networks.

cs.IT↗

arXiv2016

The particle-hole map: formal derivation and numerical implementation

The particle-hole map (PHM) is a tool to visualize electronic excitations, based on representations in a canonical orbital transition space. Introduced as an alternative to the transition density matrix, the PHM has a simple probabilistic interpretation, indicating the origins and destinations of electrons and holes and, hence, the roles of different functional units of molecules during an excitation. We present a formal derivation of the PHM, starting from the particle-hole transition density matrix and projecting onto a set of single-particle orbitals. We implement the PHM using atom-centered localized basis sets and discuss the example of the molecular charge-transfer complex $\rm C_2H_4 - C_2F_4$.

physics.chem-ph↗

arXiv2016

Wireless Energy Harvesting Cooperative Communications with Direct Link and Energy Accumulation

This paper investigates a wireless energy harvesting cooperative network (WEHCN) consisting of a source, a decode-and-forward (DF) relay and a destination. We consider the relay as an energy harvesting (EH) node equipped with EH circuit and a rechargeable battery. Moreover, the direct link between source and destination is assumed to exist. The relay can thus harvest and accumulate energy from radio-frequency signals ejected by the source and assist its information transmission opportunistically. We develop an incremental accumulate-then-forward (IATF) relaying protocol for the considered WEHCN. In the IATF protocol, the source sends its information to destination via the direct link and requests the relay to cooperate only when it is necessary such that the relay has more chances to accumulate the harvested energy. By modeling the charging/discharging behaviors of the relay battery as a finite-state Markov chain, we derive a closed-form expression for the outage probability of the proposed IATF. Numerical results validate our theoretical analysis and show that the IATF scheme can significantly outperform the direct transmission scheme without cooperation.

cs.IT↗

arXiv2016

Exploiting Energy Accumulation Against Co-channel Interference in Wireless Energy Harvesting MIMO Relaying

This paper investigates a three-node multiple-input multiple-output relay system suffering from co-channel interference (CCI) at the multi-antenna relay. Contrary to the conventional relay networks, we consider the scenario that the relay is an energy harvesting (EH) node and has no embedded energy supply. But it is equipped with a rechargeable battery such that it can harvest and accumulate the harvested energy from RF signals sent by the source and co-channel interferers to support its operation. Leveraging the inherent feature of the considered system, we develop a novel accumulate-then-forward (ATF) protocol to eliminate the harmful effect of CCI. In the proposed ATF scheme, at the beginning of each transmission block, the relay can choose either EH operation to harvest energy from source and CCI or information decoding (ID) operation to decode and forward source's information while suffering from CCI. Specifically, ID operation is activated only when the accumulated energy at the relay can support an outage-free transmission in the second hop. Otherwise, EH operation is invoked at the relay to harvest and accumulate energy. By modeling the finite-capacity battery of relay as a finite-state Markov Chain (MC), we derive a closed-form expression for the system throughput of the proposed ATF scheme over mixed Nakagami-m and Rayleigh fading channels. Numerical results validate our theoretical analysis, and show that the proposed ATF scheme with energy accumulation significantly outperforms the existing one without energy accumulation.

cs.IT↗

arXiv2016

Antenna Selection for MIMO-NOMA Networks

This paper considers the joint antenna selection (AS) problem for a classical two-user non-orthogonal multiple access (NOMA) network where both the base station and users are equipped with multiple antennas. Since the exhaustive-search-based optimal AS scheme is computationally prohibitive when the number of antennas is large, two computationally efficient joint AS algorithms, namely max-min-max AS (AIA-AS) and max-max-max AS (A$^3$-AS), are proposed to maximize the system sum-rate. The asymptotic closed-form expressions for the average sum-rates for both AIA-AS and A$^3$-AS are derived in the high signal-to-noise ratio (SNR) regime, respectively. Numerical results demonstrate that both AIA-AS and A$^3$-AS can yield significant performance gains over comparable schemes. Furthermore, AIA-AS can provide better user fairness, while the A$^3$-AS scheme can achieve the near-optimal sum-rate performance.

cs.IT↗

arXiv2016

Millimeter Wave MIMO Channel Estimation using Overlapped Beam Patterns and Rate Adaptation

This paper is concerned with the channel estimation problem in Millimeter wave (mmWave) wireless systems with large antenna arrays. By exploiting the inherent sparse nature of the mmWave channel, we first propose a fast channel estimation (FCE) algorithm based on a novel overlapped beam pattern design, which can increase the amount of information carried by each channel measurement and thus reduce the required channel estimation time compared to the existing non-overlapped designs. We develop a maximum likelihood (ML) estimator to optimally extract the path information from the channel measurements. Then, we propose a novel rate-adaptive channel estimation (RACE) algorithm, which can dynamically adjust the number of channel measurements based on the expected probability of estimation error (PEE). The performance of both proposed algorithms is analyzed. For the FCE algorithm, an approximate closed-form expression for the PEE is derived. For the RACE algorithm, a lower bound for the minimum signal energy-to-noise ratio required for a given number of channel measurements is developed based on the Shannon-Hartley theorem. Simulation results show that the FCE algorithm significantly reduces the number of channel estimation measurements compared to the existing algorithms using non-overlapped beam patterns. By adopting the RACE algorithm, we can achieve up to a 6dB gain in signal energy-to-noise ratio for the same PEE compared to the existing algorithms.

cs.IT↗

arXiv2016

RACE: A Rate Adaptive Channel Estimation Approach for Millimeter Wave MIMO Systems

In this paper, we consider the channel estimation problem in Millimeter wave (mmWave) wireless systems with large antenna arrays. By exploiting the inherent sparse nature of the mmWave channel, we develop a novel rate-adaptive channel estimation (RACE) algorithm, which can adaptively adjust the number of required channel measurements based on an expected probability of estimation error (PEE). To this end, we design a maximum likelihood (ML) estimator to optimally extract the path information and the associated probability of error from the increasing number of channel measurements. Based on the ML estimator, the algorithm is able to measure the channel using a variable number of beam patterns until the receiver believes that the estimated direction is correct. This is in contrast to the existing mmWave channel estimation algorithms, in which the number of measurements is typically fixed. Simulation results show that the proposed algorithm can significantly reduce the number of channel estimation measurements while still retaining a high level of accuracy, compared to existing multi-stage channel estimation algorithms.

cs.IT↗

arXiv2016

Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks

In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We then propose a matching algorithm which converges to a two-side exchange stable matching after a limited number of iterations. A joint solution is thus provided to solve the sub-channel assignment and power allocation problems iteratively. Simulation results show that the proposed algorithm greatly outperforms the orthogonal multiple access scheme and a previous non-orthogonal multiple access scheme.

cs.NI↗

arXiv2016

Non-Uniform Linear Antenna Array Design and Optimization for Millimeter Wave Communications

In this paper, we investigate the optimization of non-uniform linear antenna arrays (NULAs) for millimeter wave (mmWave) line-of-sight (LoS) multiple-input multiple-output (MIMO) channels. Our focus is on the maximization of the system effective multiplexing gain (EMG), by optimizing the individual antenna positions in the transmit/receive NULAs. Here the EMG is defined as the number of signal streams that are practically supported by the channel at a finite SNR. We first derive analytical expressions for the asymptotic channel eigenvalues with arbitrarily deployed NULAs when, asymptotically, the end-to-end distance is sufficiently large compared to the aperture sizes of the transmit/receive NULAs. Based on the derived expressions, we prove that, the asymptotically optimal NULA deployment that maximizes the achievable EMG should follow the groupwise Fekete-point distribution. Specifically, the antennas should be physically grouped into K separate uniform linear antenna arrays (ULAs) with the minimum feasible antenna spacing within each ULA, where K is the target EMG to be achieved; in addition, the centers of these K ULAs follow the Fekete-point distribution. We numerically verify the asymptotic optimality of such an NULA deployment and extend it to a groupwise projected arch type (PAT) NULA deployment, which provides a more practical option for mmWave LoS MIMO systems with realistic non-asymptotic configurations. Numerical examples are provided to demonstrate a significant capacity gain of the optimized NULAs over traditional ULAs.

cs.IT↗

arXiv2016

Wireless-Powered Two-Way Relaying with Power Splitting-based Energy Accumulation

This paper investigates a wireless-powered two-way relay network (WP-TWRN), in which two sources exchange information with the aid of one amplify-and-forward (AF) relay. Contrary to the conventional two-way relay networks, we consider the scenario that the AF relay has no embedded energy supply, and it is equipped with an energy harvesting unit and rechargeable battery. As such, it can accumulate the energy harvested from both sources' signals before helping forwarding their information. In this paper, we develop a power splitting-based energy accumulation (PS-EA) scheme for the considered WP-TWRN. To determine whether the relay has accumulated sufficient energy, we set a predefined energy threshold for the relay. When the accumulated energy reaches the threshold, relay splits the received signal power into two parts, one for energy harvesting and the other for information forwarding. If the stored energy at the relay is below the threshold, all the received signal power will be accumulated at the relay's battery. By modeling the finite-capacity battery of relay as a finite-state Markov Chain (MC), we derive a closed-form expression for the system throughput of the proposed PS-EA scheme over Nakagami-m fading channels. Numerical results validate our theoretical analysis and show that the proposed PS-EA scheme outperforms the conventional time switching-based energy accumulation (TS-EA) scheme and the existing power splitting schemes without energy accumulation.

cs.IT↗

arXiv2016

Accumulate then Forward: An Opportunistic Relaying Protocol for Wireless-Powered Cooperative Communications

This paper investigates a wireless-powered cooperative communication network consisting of a source, a destination and a multi-antenna decode-and-forward relay. We consider the relay as a wireless-powered node that has no external power supply; but it is equipped with an energy harvesting (EH) unit and a rechargeable battery such that it can harvest and accumulate energy from radio-frequency signals broadcast by the source. By fully incorporating the EH feature of the relay, we develop an opportunistic relaying protocol, termed accumulate-then-forward (ATF), for the considered WPCCN. We then adopt the discrete Markov chain to model the dynamic charging and discharging behaviors of the relay battery. Based on this, we derive a closed-form expression for the exact outage probability of the proposed ATF protocol. Numerical results show that the ATF scheme can outperform the direct transmission one, especially when the amount of energy consumed by relay for information forwarding is optimized.

cs.IT↗

arXiv2016

A Low-Complexity Transceiver Design in Sparse Multipath Massive MIMO Channels

In this letter, we develop a low-complexity transceiver design, referred to as semi-random beam pairing (SRBP), for sparse multipath massive MIMO channels. By exploring a sparse representation of the MIMO channel in the virtual angular domain, we generate a set of transmit-receive beam pairs in a semi-random way to support the simultaneous transmission of multiple data streams. These data streams can be easily separated at the receiver via a successive interference cancelation (SIC) technique, and the power allocation among them are optimized based on the classical waterfilling principle. The achieved degree of freedom (DoF) and capacity of the proposed approach are analyzed. Simulation results show that, compared to the conventional singular value decomposition (SVD)-based method, the proposed transceiver design can achieve near-optimal DoF and capacity with a significantly lower computational complexity.

cs.IT↗

arXiv2016

Analytical Model for Outdoor Millimeter Wave Channels using Geometry-Based Stochastic Approach

The severe bandwidth shortage in conventional microwave bands has spurred the exploration of the millimeter wave (MMW) spectrum for the next revolution in wireless communications. However, there is still lack of proper channel modeling for the MMW wireless propagation, especially in the case of outdoor environments. In this paper, we develop a geometry-based stochastic channel model to statistically characterize the effect of all the first-order reflection paths between the transmitter and receiver. These first-order reflections are generated by the single-bounce of signals reflected from the walls of randomly distributed buildings. Based on this geometric model, a closed-form expression for the power delay profile (PDP) contributed by all the first-order reflection paths is obtained and then used to evaluate their impact on the MMW outdoor propagation characteristics. Numerical results are provided to validate the accuracy of the proposed model under various channel parameter settings. The findings in this paper provide a promising step towards more complex and practical MMW propagation channel modeling.

stat.AP↗

arXiv2016

Distributed Power Control in Interference Channels with QoS Constraints and RF Energy Harvesting: A Game-Theoretic Approach

This paper develops a new distributed power control scheme for a power splitting-based interference channel (IFC) with simultaneous wireless information and power transfer (SWIPT). The considered IFC consists of multiple source-destination pairs. Each destination splits its received signal into two parts for information decoding and energy harvesting (EH), respectively. Each pair adjusts its transmit power and power splitting ratio to meet both the signal-to-interference-plus-noise ratio (SINR) and EH constraints at its corresponding destination. To characterize rational behaviors of source-destination pairs, we formulate a non-cooperative game for the considered system, where each pair is modeled as a strategic player who aims to minimize its own transmit power under both SINR and EH constraints at the destination. We derive a sufficient and necessary condition for the existence and uniqueness of the Nash equilibrium (NE) of the formulated game. The best response strategy of each player is derived and then the NE can be achieved iteratively. Numerical results show that the proposed game-theoretic approach can achieve a near-optimal performance under various SINR and EH constraints.

cs.IT↗