SearcharxivSearch

arXiv subjects

Xuchu Dai

Publications and source records attributed to Xuchu Dai.

16 recordsLinked to original sources

A General Analytical Framework for the Resolution of Near-Field Beamforming

The resolution is an important performance metric of near-field communication networks. In particular, the resolution of near field beamforming measures how effectively users can be distinguished in the distance-angle domain, which is one of the most significant features of near-field communications. In a comparison, conventional far-field beamforming can distinguish users in the angle domain only, which means that near-field communication yields the full utilization of user spatial resources to improve spectrum efficiency. In the literature of near-field communications, there have been a few studies on whether the resolution of near-field beamforming is perfect. However, each of the existing results suffers its own limitations, e.g., each is accurate for special cases only, and cannot precisely and comprehensively characterize the resolution. In this letter, a general analytical framework is developed to evaluate the resolution of near-field beamforming. Based on this derived expression, the impacts of parameters on the resolution are investigated, which can shed light on the design of the near-field communications, including the designs of beamforming and multiple access tequniques.

cs.IT

Asymptotic Performance of the GSVD-Based MIMO-NOMA Communications with Rician Fading

In recent years, the multiple-input multiple-output (MIMO) non-orthogonal multiple-access (NOMA) systems have attracted a significant interest in the relevant research communities. As a potential precoding scheme, the generalized singular value decomposition (GSVD) can be adopted in MIMO-NOMA systems and has been proved to have high spectral efficiency. In this paper, the performance of the GSVD-based MIMO-NOMA communications with Rician fading is studied. In particular, the distribution characteristics of generalized singular values (GSVs) of channel matrices are analyzed. Two novel mathematical tools, the linearization trick and the deterministic equivalent method, which are based on operator-valued free probability theory, are exploited to derive the Cauchy transform of GSVs. An iterative process is proposed to obtain the numerical values of the Cauchy transform of GSVs, which can be exploited to derive the average data rates of the communication system. In addition, the special case when the channel is modeled as Rayleigh fading, i.e., the line-of-sight propagation is trivial, is analyzed. In this case, the closed-form expressions of average rates are derived from the proposed iterative process. Simulation results are provided to validate the derived analytical results.

cs.IT

Stochastic Geometry Based Modeling and Analysis on Network NOMA in Downlink CoMP Systems

This paper investigates the performance of network non-orthogonal multiple access (N-NOMA) in a downlink coordinated multi-point (CoMP) system. In the considered N-NOMA scheme, multiple base stations (BSs) cooperatively serve a CoMP user, meanwhile, each BS serves additional NOMA users by occupying the same resource block allocated to the CoMP user. The locations of the BSs and users are modeled by stochastic geometric models and the interference from the whole network is considered. Through rigorous derivations, the outage probabilities achieved by the CoMP and NOMA users are obtained, respectively. Numerical results are provided to verify the accuracy of the analytical results and also demonstrate the superior performance of N-NOMA compared to orthogonal multiple access (OMA) based CoMP scheme.

cs.IT

On the Application of Quasi-Degradation to Network NOMA in Downlink CoMP Systems

The application of network non-orthogonal multiple access (N-NOMA) technique to coordinated multi-point (CoMP) systems has attracted significant attention due to its superior capability to improve connectivity and maintain reliable transmission for CoMP users simultaneously. Based on the concept of quasi-degraded channel for N-NOMA, this paper studies the precoding design for downlink N-NOMA scenarios with two base stations (BSs) equipped with multiple antennas. In specific, under quasi-degraded channels, simple linear precoding based N-NOMA can achieve the same minimal total transmission power as theoretically optimal but complicated dirty paper coding (DPC) scheme, when the users' target rates and minimal transmission power of each BS are given. In this paper, the channel quasi-degradation (QD) condition is first rigorously derived for the scenario with single CoMP user and two NOMA users. The closed-form optimal precoders for N-NOMA under quasi-degraded channels are also provided. Then, based on QD condition, a novel hybrid N-NOMA (H-N-NOMA) scheme is proposed, which is a mixture of N-NOMA and conventional zero-forcing beamforming (ZFBF) scheme. Further, for the scenarios with more users, a low-complexity QD based user pairing (QDUP) algorithm is proposed. Numerical results are presented to reveal the impact factors of QD channels, and also demonstrate the superior performance of the proposed H-N-NOMA/QDUP scheme. It is shown that the proposed H-N-NOMA/QDUP scheme can effectively exploit the benefit of multi user diversity.

cs.IT

On the Outage Performance of Network NOMA (N-NOMA) Modeled by Poisson Line Cox Point Process

To improve the system throughput, this paper proposes a network non-orthogonal multiple access (N-NOMA) technique for the uplink coordinated multi-point transmission (CoMP). In the considered scenario, multiple base stations collaborate with each other to serve a single user, referred to as the CoMP user, which is the same as for conventional CoMP. However, unlike conventional CoMP, each base station in N-NOMA opportunistically serves an extra user, referred to as the NOMA user, while serving the CoMP user at the same bandwidth. The CoMP user is typically located far from the base stations, whereas users close to the base stations are scheduled as NOMA users. Hence, the channel conditions of the two kind of users are very distinctive, which facilitates the implementation of NOMA. Compared to the conventional orthogonal multiple access based CoMP scheme, where multiple base stations serve a single CoMP user only, the proposed N-NOMA scheme can support larger connectivity by serving the extra NOMA users, and improve the spectral efficiency by avoiding the CoMP user solely occupying the spectrum. A stochastic geometry approach is applied to model the considered N-NOMA scenario as a Poisson cluster process, based on which closed-form analytical expressions for outage probabilities and ergodic rates are obtained. Numerical results are presented to show the accuracy of the analytical results and also demonstrate the superior performance of the proposed N-NOMA scheme.

cs.IT

A User-Centric Cooperative Scheme for UAV Assisted Wireless Networks in Malfunction Areas

A promising application of unmanned aerial vehicles (UAVs) to the future communication networks is to address emergency communications. This paper considers such a scenario where a UAV is employed to a malfunction area (modeled as a circular disc) in which all ground base stations (BSs) break down. The ground BSs outside the malfunction area are modelled as a homogeneous Poisson point process (HPPP). Particularly, a user-centric cooperative scheme is proposed to serve the UEs in the malfunction area. According to the user equipment's (UE's) connections to the UAV and the nearest ground BS, the malfunction area is divided into three regions, namely the UAV region, the cooperation region and the nearest ground BS region, in which the UEs are served by the UAV only, both the UAV and the nearest ground BS, and the nearest ground BS, respectively. The region size of each type can be adjusted by a cooperation parameter $δ$. Through rigorous derivations, an expression for the coverage probability achieved by the UE in the malfunction area is obtained. In order to provide a fair comparison, the normalized spectral efficiency (NSE) which is defined by taking both system throughput and the number of serving BSs into consideration, is used as a criterion for the performance evaluation. Numerical results are presented to verify the accuracy of the analytical results and also to demonstrate the superior performance of the proposed scheme.

cs.NI

On the Performance of Network NOMA in Uplink CoMP Systems: A Stochastic Geometry Approach

To improve the system throughput, this paper proposes a network non-orthogonal multiple access (N-NOMA) technique for the uplink coordinated multi-point transmission (CoMP). In the considered scenario, multiple base stations collaborate with each other to serve a single user, referred to as the CoMP user, which is the same as for conventional CoMP. However, unlike conventional CoMP, each base station in N-NOMA opportunistically serves an extra user, referred to as the NOMA user, while serving the CoMP user at the same bandwidth. The CoMP user is typically located at the cell-edge, whereas users close to the base stations are scheduled as NOMA users. Hence, the channel conditions of the two kind of users are very distinctive, which facilitates the implementation of NOMA. Compared to the conventional orthogonal multiple access based CoMP scheme, where multiple base stations serve a single CoMP user only, the proposed N-NOMA scheme can support larger connectivity by serving the extra NOMA users, and improve the spectral efficiency by avoiding the CoMP user solely occupying the spectrum. A stochastic geometry approach is applied to model the considered N-NOMA scenario as a Poisson cluster process, based on which closed-form analytical expressions for outage probabilities and ergodic rates are obtained. Numerical results are presented to show the accuracy of the analytical results and also demonstrate the superior performance of the proposed N-NOMA scheme.

cs.IT

Asymptotic Performance Analysis of GSVD-NOMA Systems with a Large-Scale Antenna Array

This paper considers a multiple-input multiple-output (MIMO) downlink communication scenario with one base station and two users, where each user is equipped with m antennas and the base station is equipped with n antennas. To efficiently exploit the spectrum resources, we propose a transmission protocol which combines generalized singular value decomposition (GSVD) and non-orthogonal multiple access (NOMA). The average data rates achieved by the two users are adopted as performance metrics for evaluation of the proposed GSVD-NOMA scheme. In particular, we first characterize the limiting distribution of the squared generalized singular values of the two users' channel matrices for the asymptotic case where the numbers of transmit and receive antennas approach infinity. Then, we calculate the normalized average individual rates of the users in the considered asymptotic regime. Furthermore, we extend the proposed GSVD-NOMA scheme to the MIMO downlink communication scenario with more than two users by using a hybrid multiple access (MA) approach, where the base station first divides the users into different groups, then the proposed GSVD-NOMA scheme is implemented within each group, and different groups are allocated with orthogonal bandwidth resources. Finally, numerical results are provided to validate the effectiveness of the proposed GSVD-NOMA protocol, and the accuracy of the developed analytical results.

cs.IT

A Novel Network NOMA Scheme for Downlink Coordinated Three-Point Systems

In this paper, we propose a network non-orthogonal multiple access (N-NOMA) technique for the downlink coordinated multipoint (CoMP) communication scenario of a cellular network, with randomly deployed users. In the considered N-NOMA scheme, superposition coding (SC) is employed to serve cell-edge users as well as users close to base stations (BSs) simultaneously, and distributed analog beamforming by the BSs to meet the cell-edge user's quality of service (QoS) requirements. The combination of SC and distributed analog beamforming significantly complicates the expressions for the signal-to-interference-plus-noise ratio (SINR) at the reveiver, which makes the performance analysis particularly challenging. However, by using rational approximations, insightful analytical results are obtained in order to characterize the outage performance of the considered N-NOMA scheme. Computer simulation results are provided to show the superior performance of the proposed scheme as well as to demonstrate the accuracy of the analytical results.

cs.IT

Physical Layer Security Jamming: Theoretical Limits and Practical Designs in Wireless Networks

Physical layer security has been recently recognized as a promising new design paradigm to provide security in wireless networks. In addition to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance secured wireless links. In this approach, jamming plays a key role by generating noise signals to confuse the potential eavesdroppers, and significantly improves quality and reliability of secure communications between legitimate terminals. This article presents theoretical limits and practical designs of jamming approaches for physical layer security. In particular, the theoretical limits explore the achievable secrecy rates of user cooperation based jamming whilst the centralized, and game theoretic based precoding techniques are reviewed for practical implementations. In addition, the emerging wireless energy harvesting techniques are exploited to harvest the required energy to transmit jamming signals. Future directions of these approaches, and the associated research challenges are also briefly outlined.

cs.IT

A Mathematical Proof of the Superiority of NOMA Compared to Conventional OMA

While existing works about non-orthogonal multiple access (NOMA) have indicated that NOMA can yield a significant performance gain over orthogonal multiple access (OMA) with fixed resource allocation, it is not clear whether such a performance gain will diminish when optimal resource (Time/Frequency/Power) allocation is carried out. In this paper, the performance comparison between NOMA and conventional OMA systems is investigated, from an optimization point of view. Firstly, by using the idea of power splitting, a closed-form expression for the optimum sum rate of NOMA systems is derived. Then, with rigorous mathematical proofs, we reveal the fact that NOMA can always outperform conventional OMA systems, even if both are equipped with the optimal resource allocation policies. Finally, computer simulations are conducted to validate the accuracy of the analytical results.

cs.IT

On the Outage Performance of Non-Orthogonal Multiple Access with One-Bit Feedback

In this paper, the outage performance of downlink non-orthogonal multiple access (NOMA) is investigated for the case where each user feeds back only one bit of its channel state information (CSI) to the base station. Conventionally, opportunistic one-bit feedback has been used in fading broadcast channels to select only one user for transmission. In contrast, the considered NOMA scheme adopts superposition coding to serve all users simultaneously in order to improve user fairness. A closed-form expression for the common outage probability (COP) is derived, along with the optimal diversity gains under two types of power constraints. Particularly, it is demonstrated that the diversity gain under a long-term power constraint is twice as large as that under a short-term power constraint. Furthermore, we study dynamic power allocation optimization for minimizing the COP, based on one-bit CSI feedback. This problem is challenging since the objective function is non-convex; however, under the short-term power constraint, we demonstrate that the original problem can be transformed into a set of convex problems. Under the long-term power constraint, an asymptotically optimal solution is obtained for high signal-to-noise ratio.

cs.IT

NOMA: An Information Theoretic Perspective

In this letter, the performance of non-orthogonal multiple access (NOMA) is investigated from an information theoretic perspective. The relationships among the capacity region of broadcast channels and two rate regions achieved by NOMA and time-division multiple access (TDMA) are illustrated first. Then, the performance of NOMA is evaluated by considering TDMA as the benchmark, where both the sum rate and the individual user rates are used as the criteria. In a wireless downlink scenario with user pairing, the developed analytical results show that NOMA can outperform TDMA not only for the sum rate but also for each user's individual rate, particularly when the difference between the users' channels is large.

cs.IT

The Private Key Capacity of a Cooperative Pairwise-Independent Network

This paper studies the private key generation of a cooperative pairwise-independent network (PIN) with M+2 terminals (Alice, Bob and M relays), M >= 2. In this PIN, the correlated sources observed by every pair of terminals are independent of those sources observed by any other pair of terminal. All the terminals can communicate with each other over a public channel which is also observed by Eve noiselessly. The objective is to generate a private key between Alice and Bob under the help of the M relays; such a private key needs to be protected not only from Eve but also from individual relays simultaneously. The private key capacity of this PIN model is established, whose lower bound is obtained by proposing a novel random binning (RB) based key generation algorithm, and the upper bound is obtained based on the construction of M enhanced source models. The two bounds are shown to be exactly the same. Then, we consider a cooperative wireless network and use the estimates of fading channels to generate private keys. It has been shown that the proposed RB-based algorithm can achieve a multiplexing gain M-1, an improvement in comparison with the existing XOR- based algorithm whose achievable multiplexing gain is about [M]/2.

cs.IT

Distributed Ranging and Localization for Wireless Networks via Compressed Sensing

Location-based services in a wireless network require nodes to know their locations accurately. Conventional solutions rely on contention-based medium access, where only one node can successfully transmit at any time in any neighborhood. In this paper, a novel, complete, distributed ranging and localization solution is proposed, which let all nodes in the network broadcast their location estimates and measure distances to all neighbors simultaneously. An on-off signaling is designed to overcome the physical half-duplex constraint. In each iteration, all nodes transmit simultaneously, each broadcasting codewords describing the current location estimate. From the superposed signals from all neighbors, each node decodes their neighbors' locations and also estimates their distances using the signal strengths. The node then broadcasts its improved location estimates in the subsequent iteration. Simulations demonstrate accurate localization throughout a large network over a few thousand symbol intervals, suggesting much higher efficiency than conventional schemes based on ALOHA or CSMA.

cs.NI

Application of Analog Network Coding to MIMO Two-Way Relay Channel in Cellular Systems

An efficient analog network coding transmission protocol is proposed in this letter for a MIMO two way cellular network. Block signal alignment is first proposed to null the inter-user interference for multi-antenna users, which makes the dimensions of aligned space larger compared with the existing signal alignment. Two algorithms are developed to jointly design the precoding matrices at the relay and BS for outage optimization. Especially, the last algorithm is designed to maximize the effective channel gain to the effective noise gain ratio. The performance of this transmission protocol is also verified by simulations.

cs.IT