Sparse NOMA: A Closed-Form Characterization

Understanding fundamental limits of the various technologies suggested for future 5G and beyond cellular systems is crucial for developing efficient state-of-the-art designs. A leading technology of major interest is non-orthogonal multiple-access (NOMA). In this paper, we derive an explicit rigorous closed-form analytical expression for the optimum spectral efficiency in the large-system limit of regular sparse NOMA, where only a fixed and finite number of orthogonal resources are allocated to any designated user, and vice versa. The basic Verdú-Shamai formula for (dense) randomly-spread code-division multiple-access (RS-CDMA) turns out to coincide with the limit of the derived expression, when the number of orthogonal resources per user grows large. Furthermore, regular sparse NOMA is rigorously shown to be spectrally more efficient than RS-CDMA across the entire system load range. It may therefore serve as an efficient means for reducing the throughput gap to orthogonal transmission in the underloaded regime, and to the ultimate Cover-Wyner bound in overloaded systems. The results analytically reinforce preliminary conclusions in [1], which mostly relied on heuristics and numerical observations. The spectral efficiency is also derived in closed form for the sub-optimal linear minimum-mean-square-error (LMMSE) receiver, which again extends the corresponding Verdti-Shamai LMMSE formula to regular sparse NOMA.

[1]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[2]  Zhijin Qin,et al.  User Association and Resource Allocation in Unified Non-Orthogonal Multiple Access Enabled Heterogeneous Ultra Dense Networks , 2018, ArXiv.

[3]  Reza Hoshyar,et al.  LDS-OFDM an Efficient Multiple Access Technique , 2010, 2010 IEEE 71st Vehicular Technology Conference.

[4]  Miao Pan,et al.  Secure Communications in NOMA System: Subcarrier Assignment and Power Allocation , 2018, IEEE Journal on Selected Areas in Communications.

[5]  Antonia Maria Tulino,et al.  Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.

[6]  Marc Lelarge,et al.  Resolvent of large random graphs , 2007, Random Struct. Algorithms.

[7]  Dongning Guo,et al.  A single-letter characterization of optimal noisy compressed sensing , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  H. Vincent Poor,et al.  Capacity Comparison Between MIMO-NOMA and MIMO-OMA With Multiple Users in a Cluster , 2017, IEEE Journal on Selected Areas in Communications.

[9]  R. Couillet,et al.  Random Matrix Methods for Wireless Communications: Estimation , 2011 .

[10]  Lajos Hanzo,et al.  Multiple-Antenna-Assisted Non-Orthogonal Multiple Access , 2018, IEEE Wireless Communications.

[11]  Shlomo Shamai,et al.  The Interplay Between Information and Estimation Measures , 2013, Found. Trends Signal Process..

[12]  Iwao Sato,et al.  The semicircle law for semiregular bipartite graphs , 2003, J. Comb. Theory, Ser. A.

[13]  Zhiguo Ding,et al.  Joint Beamforming and Power-Splitting Control in Downlink Cooperative SWIPT NOMA Systems , 2017, IEEE Transactions on Signal Processing.

[14]  Kannan Ramchandran,et al.  R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT , 2018, IEEE Transactions on Information Theory.

[15]  Chih-Chun Wang,et al.  Multiuser Detection of Sparsely Spread CDMA , 2008, IEEE Journal on Selected Areas in Communications.

[16]  Shlomo Shamai,et al.  Information Theory of Underspread WSSUS Channels , 2011 .

[17]  Ioana Dumitriu,et al.  The Marčenko‐Pastur law for sparse random bipartite biregular graphs , 2013, Random Struct. Algorithms.

[18]  Hosein Nikopour,et al.  Sparse code multiple access , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[19]  Shlomo Shamai,et al.  Low-density code-domain NOMA: Better be regular , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[20]  Kannan Ramchandran,et al.  Asynchronous and noncoherent neighbor discovery for the IoT using sparse-graph codes , 2017, 2017 IEEE International Conference on Communications (ICC).

[21]  B. McKay.  The expected eigenvalue distribution of a large regular graph , 1981 .

[22]  George K. Karagiannidis,et al.  A Survey on Non-Orthogonal Multiple Access for 5G Networks: Research Challenges and Future Trends , 2017, IEEE Journal on Selected Areas in Communications.

[23]  Refik Caglar Kizilirmak.  Non-Orthogonal Multiple Access (NOMA) for 5G Networks , 2016 .

[24]  Kannan Ramchandran,et al.  SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[25]  Koujin Takeda,et al.  Cavity approach to the spectral density of sparse symmetric random matrices. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Shlomo Shamai,et al.  Spectral Efficiency of CDMA with Random Spreading , 1999, IEEE Trans. Inf. Theory.

[27]  Kannan Ramchandran,et al.  A sparse-graph-coded filter bank approach to minimum-rate spectrum-blind sampling , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[28]  Alireza Bayesteh,et al.  SCMA Codebook Design , 2014, 2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall).

[29]  Huan X. Nguyen,et al.  Non-orthogonal multiple access schemes for next-generation 5G networks: a survey , 2017 .

[30]  Anton Monk,et al.  OTFS - Orthogonal Time Frequency Space , 2016, ArXiv.

[31]  Yuanwei Liu,et al.  Uplink NOMA in Large-Scale Systems: Coverage and Physical Layer Security , 2017, ArXiv.

[32]  Kannan Ramchandran,et al.  A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes , 2014, 2014 IEEE International Symposium on Information Theory.

[33]  Giorgio Parisi,et al.  SK Model: The Replica Solution without Replicas , 1986 .

[34]  Andrea Montanari,et al.  Factor models on locally tree-like graphs , 2011, ArXiv.

[35]  Roland Speicher,et al.  On Slow-Fading MIMO Systems With Nonseparable Correlation , 2008, IEEE Transactions on Information Theory.

[36]  Shlomo Shamai,et al.  The impact of frequency-flat fading on the spectral efficiency of CDMA , 2001, IEEE Trans. Inf. Theory.

[37]  Kannan Ramchandran,et al.  Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity , 2013, 2013 IEEE International Symposium on Information Theory.

[38]  H. Vincent Poor,et al.  Non-Orthogonal Multiple Access in Multi-Cell Networks: Theory, Performance, and Practical Challenges , 2016, IEEE Communications Magazine.

[39]  Alireza Bayesteh,et al.  Low Complexity Techniques for SCMA Detection , 2015, 2015 IEEE Globecom Workshops (GC Wkshps).

[40]  H. Vincent Poor,et al.  Cooperative Non-Orthogonal Multiple Access in 5G Systems , 2015, IEEE Communications Letters.

[41]  David Saad,et al.  Sparsely spread CDMA—a statistical mechanics-based analysis , 2007, ArXiv.

[42]  Shuangfeng Han,et al.  Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends , 2015, IEEE Communications Magazine.

[43]  Zhiguo Ding,et al.  Non-Orthogonal Multiple Access (NOMA) for 5G Systems , 2017 .

[44]  Zhijin Qin,et al.  Sparse Representation for Wireless Communications , 2018, ArXiv.

[45]  Toshiyuki Tanaka,et al.  Analysis of Sparsely-Spread CDMA via Statistical Mechanics , 2006, 2006 IEEE International Symposium on Information Theory.

[46]  Maria-Gabriella Di Benedetto,et al.  Spectral Efficiency of Random Time-Hopping CDMA , 2013, IEEE Transactions on Information Theory.

[47]  Bojan Mohar,et al.  Walk generating functions and spectral measures of infinite graphs , 1988 .