Investigation on Evolving Single-Carrier NOMA into Multi-Carrier NOMA in 5G

© 2013 IEEE. Non-orthogonal multiple access (NOMA) is one promising technology, which provides high system capacity, low latency, and massive connectivity, to address several challenges in the fifth-generation wireless systems. In this paper, we first reveal that the NOMA techniques have evolved from single-carrier NOMA (SC-NOMA) into multi-carrier NOMA (MC-NOMA). Then, we comprehensively investigated on the basic principles, enabling schemes and evaluations of the two most promising MC-NOMA techniques, namely sparse code multiple access (SCMA) and pattern division multiple access (PDMA). Meanwhile, we consider that the research challenges of SCMA and PDMA might be addressed with the stimulation of the advanced and matured progress in SC-NOMA. Finally, yet importantly, we investigate the emerging applications, and point out the future research trends of the MC-NOMA techniques, which could be straightforwardly inspired by the various deployments of SC-NOMA

Enhancing Signal Space Diversity for SCMA Over Rayleigh Fading Channels

Sparse code multiple access (SCMA) is a promising technique for the enabling of massive connectivity in future machine-type communication networks, but it suffers from a limited diversity order which is a bottleneck for significant improvement of error performance. This paper aims for enhancing the signal space diversity of sparse code multiple access (SCMA) by introducing quadrature component delay to the transmitted codeword of a downlink SCMA system in Rayleigh fading channels. Such a system is called SSD-SCMA throughout this work. By looking into the average mutual information (AMI) and the pairwise error probability (PEP) of the proposed SSD-SCMA, we develop novel codebooks by maximizing the derived AMI lower bound and a modified minimum product distance (MMPD), respectively. The intrinsic asymptotic relationship between the AMI lower bound and proposed MMPD based codebook designs is revealed. Numerical results show significant error performance improvement in the both uncoded and coded SSD-SCMA systems

Design of Power-Imbalanced SCMA Codebook

Sparse code multiple access (SCMA) is a promising multiuser communication technique for the enabling of future massive machine-type networks. Unlike existing codebook design schemes assuming uniform power allocation, we present a novel class of SCMA codebooks which display power imbalance among different users for downlink transmission. Based on the Star-QAM mother constellation structure and with the aid of genetic algorithm, we optimize the minimum Euclidean distance (MED) and the minimum product distance (MPD) of the proposed codebooks. Numerical simulation results show that our proposed codebooks lead to significantly improved error rate performances over Gaussian channels and Rayleigh fading channels

Resource allocation in non-orthogonal multiple access technologies for 5G networks and beyond.

Doctoral Degree. University of KwaZulu-Natal, Durban.The increasing demand of mobile and device connectivity poses challenging requirements for 5G wireless communications, such as high energy- and spectral-efficiency and low latency. This necessitates a shift from orthogonal multiple access (OMA) to Non-Orthogonal Multiple Access (NOMA) techniques, namely, power-domain NOMA (PD-NOMA) and code-domain NOMA (CD-NOMA). The basic idea behind NOMA schemes is to co-multiplex different users on the same resource elements (time slot, OFDMA sub-carrier, or spreading code) via power domain (PD) or code domain (CD) at the transmitter while permitting controllable interference, and their successful multi-user detection (MUD) at the receiver albeit, increased computational complexity. In this work, an analysis on the performance of the existing NOMA schemes is carried out. Furthermore, we investigate the feasibility of a proposed uplink hybrid-NOMA scheme namely power domain sparse code multiple access (PD-SCMA) that integrates PD-NOMA and CD-NOMA based sparse code multiple access (SCMA) on heterogeneous networks (HetNets). Such hybrid schemes come with resource allocation (RA) challenges namely; codebook allocation, user pairing and power allocation. Therefore, hybrid RA schemes namely: Successive Codebook Ordering Assignment (SCOA) for codebook assignment (CA), opportunistic macro cell user equipment (MUE)- small cell user equipment (SUE) pairing (OMSP) for user pairing (UP), and a QoS-aware power allocation (QAPA) for power allocation (PA) are developed for an energy efficient (EE) system. The performance of the RA schemes is analyzed alongside an analytical RA optimization algorithm. Through numerical results, the proposed schemes show significant improvements in the EE of the small cells in comparison with the prevalent schemes. Additionally, there is significant sum rate performance improvement over the conventional SCMA and PD-NOMA. Secondly, we investigate the multiplexing capacity of the hybrid PD-SCMA scheme in HetNets. Particularly, we investigate and derive closed-form solutions for codebook capacity, MUE multiplexing and power capacity bounds. The system’s performance results into low outage when the system’s point of operation is within the multiplexing bounds. To alleviate the RA challenges of such a system at the transmitter, dual parameter ranking (DPR) and alternate search method (ASM) based RA schemes are proposed. The results show significant capacity gain with DPR-RA in comparison with conventional RA schemes. Lastly, we investigate the feasibility of integrating the hybrid PD-SCMA with multiple-input multipleoutput (MIMO) technique namely, M-PD-SCMA. The attention to M-PD-SCMA resides in the need of lower number of antennas while preserving the system capacity thanks to the overload in PDSCMA. To enhance spectral efficiency and error performance we propose spatial multiplexing at the transmitter and a low complex joint MUD scheme based on successive interference cancellation (SIC) and expectation propagation algorithm (EPA) at the receiver are proposed. Numerical results exhibit performance benchmark with PD-SCMA schemes and the proposed receiver achieves guaranteed bit error rate (BER) performance with a bounded increase in the number of transmit and receive antennas. Thus, the feasibility of an M-PD-SCMA system is validated

Doubly-Irregular Repeat-Accumulate Codes over Integer Rings for Multi-user Communications

Structured codes based on lattices were shown to provide enlarged capacity for multi-user communication networks. In this paper, we study capacity-approaching irregular repeat accumulate (IRA) codes over integer rings $\mathbb{Z}_{2^{m}}$ for $2^m$-PAM signaling, $m=1,2,\cdots$. Such codes feature the property that the integer sum of $K$ codewords belongs to the extended codebook (or lattice) w.r.t. the base code. With it, \emph{% structured binning} can be utilized and the gains promised in lattice based network information theory can be materialized in practice. In designing IRA ring codes, we first analyze the effect of zero-divisors of integer ring on the iterative belief-propagation (BP) decoding, and show the invalidity of symmetric Gaussian approximation. Then we propose a doubly IRA (D-IRA) ring code structure, consisting of \emph{irregular multiplier distribution} and \emph{irregular node-degree distribution}, that can restore the symmetry and optimize the BP decoding threshold. For point-to-point AWGN channel with $$-PAM inputs, D-IRA ring codes perform as low as 0.29 dB to the capacity limits, outperforming existing bit-interleaved coded-modulation (BICM) and IRA modulation codes over GF($2^m$). We then proceed to design D-IRA ring codes for two important multi-user communication setups, namely compute-forward (CF) and dirty paper coding (DPC), with $2^m$-PAM signaling. With it, a physical-layer network coding scheme yields a gap to the CF limit by 0.24 dB, and a simple linear DPC scheme exhibits a gap to the capacity by 0.91 dB.Comment: 30 pages, 13 figures, submitted to IEEE Trans. Signal Processin

A Tutorial on Decoding Techniques of Sparse Code Multiple Access

Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable future massive machine-type communication networks. As an evolved variant of code division multiple access (CDMA), multiple users in SCMA are separated by assigning distinctive sparse codebooks (CBs). Efficient multiuser detection is carried out at the receiver by employing the message passing algorithm (MPA) that exploits the sparsity of CBs to achieve error performance approaching to that of the maximum likelihood receiver. In spite of numerous research efforts in recent years, a comprehensive one-stop tutorial of SCMA covering the background, the basic principles, and new advances, is still missing, to the best of our knowledge. To fill this gap and to stimulate more forthcoming research, we provide a holistic introduction to the principles of SCMA encoding, CB design, and MPA based decoding in a self-contained manner. As an ambitious paper aiming to push the limits of SCMA, we present a survey of advanced decoding techniques with brief algorithmic descriptions as well as several promising directions