TL;DR: The theoretical performance comparison between NOMA and conventional OMA systems is investigated, from an optimization point of view, and a closed-form expression for the optimum sum rate of N OMA systems is derived.
Abstract: Existing work regarding the performance comparison between nonorthogonal multiple access (NOMA) and orthogonal multiple access (OMA) can be generally divided into two categories. The work in the first category aims to develop analytical results for the comparison, often with fixed system parameters. The work in the second category aims to propose efficient algorithms for optimizing these parameters, and compares NOMA with OMA by computer simulations. However, when these parameters are optimized, the theoretical superiority of NOMA over OMA is still not clear. Therefore, in this paper, the theoretical performance comparison between NOMA and conventional OMA systems is investigated, from an optimization point of view. First, sum rate maximizing problems considering user fairness in both NOMA and various OMA systems are formulated. Then, by using the method of power splitting, a closed-form expression for the optimum sum rate of NOMA systems is derived. Moreover, the fact that NOMA can always outperform any conventional OMA systems, when both are equipped with the optimum resource allocation policies, is validated with rigorous mathematical proofs. Finally, computer simulations are conducted to validate the correctness of the analytical results.
TL;DR: In this paper, the authors provide an overview of the latest NOMA research and innovations as well as their applications in 5G wireless networks and discuss future challenges and future research challenges.
Abstract: Non-orthogonal multiple access (NOMA) is an essential enabling technology for the fifth-generation (5G) wireless networks to meet the heterogeneous demands on low latency, high reliability, massive connectivity, improved fairness, and high throughput. The key idea behind NOMA is to serve multiple users in the same resource block, such as a time slot, subcarrier, or spreading code. The NOMA principle is a general framework, and several recently proposed 5G multiple access schemes can be viewed as special cases. This survey provides an overview of the latest NOMA research and innovations as well as their applications. Thereby, the papers published in this special issue are put into the context of the existing literature. Future research challenges regarding NOMA in 5G and beyond are also discussed.
TL;DR: In this paper, the authors provide an overview of the latest NOMA research and innovations as well as their applications in 5G wireless networks and discuss future research challenges regarding 5G and beyond.
Abstract: Non-orthogonal multiple access (NOMA) is an essential enabling technology for the fifth generation (5G) wireless networks to meet the heterogeneous demands on low latency, high reliability, massive connectivity, improved fairness, and high throughput. The key idea behind NOMA is to serve multiple users in the same resource block, such as a time slot, subcarrier, or spreading code. The NOMA principle is a general framework, and several recently proposed 5G multiple access schemes can be viewed as special cases. This survey provides an overview of the latest NOMA research and innovations as well as their applications. Thereby, the papers published in this special issue are put into the content of the existing literature. Future research challenges regarding NOMA in 5G and beyond are also discussed.
TL;DR: This work provides a comprehensive overview of the state of the art in power-domain multiplexing-aided NOMA, with a focus on the theoretical N OMA principles, multiple-antenna- aided NomA design, and on the interplay between NOMa and cooperative transmission.
Abstract: Driven by the rapid escalation of the wireless capacity requirements imposed by advanced multimedia applications (e.g., ultrahigh-definition video, virtual reality, etc.), as well as the dramatically increasing demand for user access required for the Internet of Things (IoT), the fifth-generation (5G) networks face challenges in terms of supporting large-scale heterogeneous data traffic. Nonorthogonal multiple access (NOMA), which has been recently proposed for the third-generation partnership projects long-term evolution advanced (3GPP-LTE-A), constitutes a promising technology of addressing the aforementioned challenges in 5G networks by accommodating several users within the same orthogonal resource block. By doing so, significant bandwidth efficiency enhancement can be attained over conventional orthogonal multiple-access (OMA) techniques. This motivated numerous researchers to dedicate substantial research contributions to this field. In this context, we provide a comprehensive overview of the state of the art in power-domain multiplexing-aided NOMA, with a focus on the theoretical NOMA principles, multiple-antenna-aided NOMA design, on the interplay between NOMA and cooperative transmission, on the resource control of NOMA, on the coexistence of NOMA with other emerging potential 5G techniques and on the comparison with other NOMA variants. We highlight the main advantages of power-domain multiplexing NOMA compared to other existing NOMA techniques. We summarize the challenges of existing research contributions of NOMA and provide potential solutions. Finally, we offer some design guidelines for NOMA systems and identify promising research opportunities for the future.
TL;DR: A comprehensive survey of CR technology is conducted and the key enabling technologies that may be closely related to the study of 5G in the near future are presented in terms of full-duplex spectrum sensing, spectrum-database based Spectrum sensing, auction based spectrum allocation, carrier aggregation based spectrum access.
Abstract: With the development of wireless communication technology, the need for bandwidth is increasing continuously, and the growing need makes wireless spectrum resources more and more scarce. Cognitive radio (CR) has been identified as a promising solution for the spectrum scarcity, and its core idea is the dynamic spectrum access. It can dynamically utilize the idle spectrum without affecting the rights of primary users, so that multiple services or users can share a part of the spectrum, thus achieving the goal of avoiding the high cost of spectrum resetting and improving the utilization of spectrum resources. In order to meet the critical requirements of the fifth generation (5G) mobile network, especially the Wider-Coverage , Massive-Capacity , Massive-Connectivity , and Low-Latency four application scenarios, the spectrum range used in 5G will be further expanded into the full spectrum era, possibly from 1 GHz to 100 GHz. In this paper, we conduct a comprehensive survey of CR technology and focus on the current significant research progress in the full spectrum sharing towards the four scenarios. In addition, the key enabling technologies that may be closely related to the study of 5G in the near future are presented in terms of full-duplex spectrum sensing, spectrum-database based spectrum sensing, auction based spectrum allocation, carrier aggregation based spectrum access. Subsequently, other issues that play a positive role for the development research and practical application of CR, such as common control channel, energy harvesting, non-orthogonal multiple access, and CR based aeronautical communication are discussed. The comprehensive overview provided by this survey is expected to help researchers develop CR technology in the field of 5G further.
TL;DR: A cluster-based CIIoT is proposed, wherein the cluster heads perform cooperative spectrum sensing to get available spectrum, and the nodes transmit via nonorthogonal multiple access (NOMA), and the simulations have indicated that the NOMA can better guarantee the transmission performance of each node than the traditional N OMA and orthogonalmultiple access.
Abstract: The development of Industrial Internet of Things (IIoT) has been limited due to the shortage of spectrum resources. Based on cognitive radio, the cognitive IIoT (CIIoT) has been proposed to improve spectrum utilization via sensing and accessing the idle spectrum. To improve sensing and transmission performance of the CIIoT, a cluster-based CIIoT is proposed, in this article, wherein the cluster heads perform cooperative spectrum sensing to get available spectrum, and the nodes transmit via nonorthogonal multiple access (NOMA). The frame structure of the CIIoT is designed, and the spectrum access probability and average total throughput of the CIIoT are deduced. A joint resource optimization for sensing time, node powers, and the number of clusters is formulated to maximize the average total throughput. The optimal solution is obtained via sensing and power optimization. The clustering algorithm and cluster head alternation are proposed to improve transmission performance and ensure energy balance, respectively. The simulations have indicated that the NOMA for the cluster-based CIIoT can better guarantee the transmission performance of each node, especially the node decoded first, than the traditional NOMA and orthogonal multiple access.
248 citations
Cites result from "An Optimization Perspective of the ..."
...The performance comparison between NOMA and orthogonal multiple access (OMA) was given in [17], which has proven that the NOMA achieved better performance....
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Abstract: Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Preview of the Book. 2. Entropy, Relative Entropy, and Mutual Information. 2.1 Entropy. 2.2 Joint Entropy and Conditional Entropy. 2.3 Relative Entropy and Mutual Information. 2.4 Relationship Between Entropy and Mutual Information. 2.5 Chain Rules for Entropy, Relative Entropy, and Mutual Information. 2.6 Jensen's Inequality and Its Consequences. 2.7 Log Sum Inequality and Its Applications. 2.8 Data-Processing Inequality. 2.9 Sufficient Statistics. 2.10 Fano's Inequality. Summary. Problems. Historical Notes. 3. Asymptotic Equipartition Property. 3.1 Asymptotic Equipartition Property Theorem. 3.2 Consequences of the AEP: Data Compression. 3.3 High-Probability Sets and the Typical Set. Summary. Problems. Historical Notes. 4. Entropy Rates of a Stochastic Process. 4.1 Markov Chains. 4.2 Entropy Rate. 4.3 Example: Entropy Rate of a Random Walk on a Weighted Graph. 4.4 Second Law of Thermodynamics. 4.5 Functions of Markov Chains. Summary. Problems. Historical Notes. 5. Data Compression. 5.1 Examples of Codes. 5.2 Kraft Inequality. 5.3 Optimal Codes. 5.4 Bounds on the Optimal Code Length. 5.5 Kraft Inequality for Uniquely Decodable Codes. 5.6 Huffman Codes. 5.7 Some Comments on Huffman Codes. 5.8 Optimality of Huffman Codes. 5.9 Shannon-Fano-Elias Coding. 5.10 Competitive Optimality of the Shannon Code. 5.11 Generation of Discrete Distributions from Fair Coins. Summary. Problems. Historical Notes. 6. Gambling and Data Compression. 6.1 The Horse Race. 6.2 Gambling and Side Information. 6.3 Dependent Horse Races and Entropy Rate. 6.4 The Entropy of English. 6.5 Data Compression and Gambling. 6.6 Gambling Estimate of the Entropy of English. Summary. Problems. Historical Notes. 7. Channel Capacity. 7.1 Examples of Channel Capacity. 7.2 Symmetric Channels. 7.3 Properties of Channel Capacity. 7.4 Preview of the Channel Coding Theorem. 7.5 Definitions. 7.6 Jointly Typical Sequences. 7.7 Channel Coding Theorem. 7.8 Zero-Error Codes. 7.9 Fano's Inequality and the Converse to the Coding Theorem. 7.10 Equality in the Converse to the Channel Coding Theorem. 7.11 Hamming Codes. 7.12 Feedback Capacity. 7.13 Source-Channel Separation Theorem. Summary. Problems. Historical Notes. 8. Differential Entropy. 8.1 Definitions. 8.2 AEP for Continuous Random Variables. 8.3 Relation of Differential Entropy to Discrete Entropy. 8.4 Joint and Conditional Differential Entropy. 8.5 Relative Entropy and Mutual Information. 8.6 Properties of Differential Entropy, Relative Entropy, and Mutual Information. Summary. Problems. Historical Notes. 9. Gaussian Channel. 9.1 Gaussian Channel: Definitions. 9.2 Converse to the Coding Theorem for Gaussian Channels. 9.3 Bandlimited Channels. 9.4 Parallel Gaussian Channels. 9.5 Channels with Colored Gaussian Noise. 9.6 Gaussian Channels with Feedback. Summary. Problems. Historical Notes. 10. Rate Distortion Theory. 10.1 Quantization. 10.2 Definitions. 10.3 Calculation of the Rate Distortion Function. 10.4 Converse to the Rate Distortion Theorem. 10.5 Achievability of the Rate Distortion Function. 10.6 Strongly Typical Sequences and Rate Distortion. 10.7 Characterization of the Rate Distortion Function. 10.8 Computation of Channel Capacity and the Rate Distortion Function. Summary. Problems. Historical Notes. 11. Information Theory and Statistics. 11.1 Method of Types. 11.2 Law of Large Numbers. 11.3 Universal Source Coding. 11.4 Large Deviation Theory. 11.5 Examples of Sanov's Theorem. 11.6 Conditional Limit Theorem. 11.7 Hypothesis Testing. 11.8 Chernoff-Stein Lemma. 11.9 Chernoff Information. 11.10 Fisher Information and the Cram-er-Rao Inequality. Summary. Problems. Historical Notes. 12. Maximum Entropy. 12.1 Maximum Entropy Distributions. 12.2 Examples. 12.3 Anomalous Maximum Entropy Problem. 12.4 Spectrum Estimation. 12.5 Entropy Rates of a Gaussian Process. 12.6 Burg's Maximum Entropy Theorem. Summary. Problems. Historical Notes. 13. Universal Source Coding. 13.1 Universal Codes and Channel Capacity. 13.2 Universal Coding for Binary Sequences. 13.3 Arithmetic Coding. 13.4 Lempel-Ziv Coding. 13.5 Optimality of Lempel-Ziv Algorithms. Compression. Summary. Problems. Historical Notes. 14. Kolmogorov Complexity. 14.1 Models of Computation. 14.2 Kolmogorov Complexity: Definitions and Examples. 14.3 Kolmogorov Complexity and Entropy. 14.4 Kolmogorov Complexity of Integers. 14.5 Algorithmically Random and Incompressible Sequences. 14.6 Universal Probability. 14.7 Kolmogorov complexity. 14.9 Universal Gambling. 14.10 Occam's Razor. 14.11 Kolmogorov Complexity and Universal Probability. 14.12 Kolmogorov Sufficient Statistic. 14.13 Minimum Description Length Principle. Summary. Problems. Historical Notes. 15. Network Information Theory. 15.1 Gaussian Multiple-User Channels. 15.2 Jointly Typical Sequences. 15.3 Multiple-Access Channel. 15.4 Encoding of Correlated Sources. 15.5 Duality Between Slepian-Wolf Encoding and Multiple-Access Channels. 15.6 Broadcast Channel. 15.7 Relay Channel. 15.8 Source Coding with Side Information. 15.9 Rate Distortion with Side Information. 15.10 General Multiterminal Networks. Summary. Problems. Historical Notes. 16. Information Theory and Portfolio Theory. 16.1 The Stock Market: Some Definitions. 16.2 Kuhn-Tucker Characterization of the Log-Optimal Portfolio. 16.3 Asymptotic Optimality of the Log-Optimal Portfolio. 16.4 Side Information and the Growth Rate. 16.5 Investment in Stationary Markets. 16.6 Competitive Optimality of the Log-Optimal Portfolio. 16.7 Universal Portfolios. 16.8 Shannon-McMillan-Breiman Theorem (General AEP). Summary. Problems. Historical Notes. 17. Inequalities in Information Theory. 17.1 Basic Inequalities of Information Theory. 17.2 Differential Entropy. 17.3 Bounds on Entropy and Relative Entropy. 17.4 Inequalities for Types. 17.5 Combinatorial Bounds on Entropy. 17.6 Entropy Rates of Subsets. 17.7 Entropy and Fisher Information. 17.8 Entropy Power Inequality and Brunn-Minkowski Inequality. 17.9 Inequalities for Determinants. 17.10 Inequalities for Ratios of Determinants. Summary. Problems. Historical Notes. Bibliography. List of Symbols. Index.
45,034 citations
"An Optimization Perspective of the ..." refers background in this paper
...ombination of superposition coding (SC) at the base station (BS) and successive interference cancellation (SIC) at users [1], which can achieve the optimum performance for degraded broadcast channels [7], [8]. Specifically, take a two-user single-input single-output (SISO) NOMA system as an example. The BS serves the users at the same time/code/frequency channel, where the signals are superposed with ...
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Abstract: Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book shows in detail how such problems can be solved numerically with great efficiency. The focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. The text contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance, and economics.
TL;DR: In this paper, the authors propose a multiuser communication architecture for point-to-point wireless networks with additive Gaussian noise detection and estimation in the context of MIMO networks.
Abstract: 1. Introduction 2. The wireless channel 3. Point-to-point communication: detection, diversity and channel uncertainty 4. Cellular systems: multiple access and interference management 5. Capacity of wireless channels 6. Multiuser capacity and opportunistic communication 7. MIMO I: spatial multiplexing and channel modeling 8. MIMO II: capacity and multiplexing architectures 9. MIMO III: diversity-multiplexing tradeoff and universal space-time codes 10. MIMO IV: multiuser communication A. Detection and estimation in additive Gaussian noise B. Information theory background.
TL;DR: The concept of software defined multiple access (SoDeMA) is proposed, which enables adaptive configuration of available multiple access schemes to support diverse services and applications in future 5G networks.
Abstract: The increasing demand of mobile Internet and the Internet of Things poses challenging requirements for 5G wireless communications, such as high spectral efficiency and massive connectivity. In this article, a promising technology, non-orthogonal multiple access (NOMA), is discussed, which can address some of these challenges for 5G. Different from conventional orthogonal multiple access technologies, NOMA can accommodate much more users via nonorthogonal resource allocation. We divide existing dominant NOMA schemes into two categories: power-domain multiplexing and code-domain multiplexing, and the corresponding schemes include power-domain NOMA, multiple access with low-density spreading, sparse code multiple access, multi-user shared access, pattern division multiple access, and so on. We discuss their principles, key features, and pros/cons, and then provide a comprehensive comparison of these solutions from the perspective of spectral efficiency, system performance, receiver complexity, and so on. In addition, challenges, opportunities, and future research trends for NOMA design are highlighted to provide some insight on the potential future work for researchers in this field. Finally, to leverage different multiple access schemes including both conventional OMA and new NOMA, we propose the concept of software defined multiple access (SoDeMA), which enables adaptive configuration of available multiple access schemes to support diverse services and applications in future 5G networks.
2,512 citations
"An Optimization Perspective of the ..." refers background or methods in this paper
...2725223 cess technique for the next generation cellular communication networks [5], [6]....
[...]
...These schemes are generally called code-domain multiplexing in [6], since the users in these schemes are multiplexed over the same time-frequency resources, but are assigned different codes....
TL;DR: It is shown that the downlink NOMA with SIC improves both the capacity and cell-edge user throughput performance irrespective of the availability of the frequency-selective channel quality indicator (CQI) on the base station side.
Abstract: This paper presents a non-orthogonal multiple access (NOMA) concept for cellular future radio access (FRA) towards the 2020s information society. Different from the current LTE radio access scheme (until Release 11), NOMA superposes multiple users in the power domain although its basic signal waveform could be based on the orthogonal frequency division multiple access (OFDMA) or the discrete Fourier transform (DFT)-spread OFDM the same as LTE baseline. In our concept, NOMA adopts a successive interference cancellation (SIC) receiver as the baseline receiver scheme for robust multiple access, considering the expected evolution of device processing capabilities in the future. Based on system-level evaluations, we show that the downlink NOMA with SIC improves both the capacity and cell-edge user throughput performance irrespective of the availability of the frequency-selective channel quality indicator (CQI) on the base station side. Furthermore, we discuss possible extensions of NOMA by jointly applying multi-antenna/site technologies with a proposed NOMA/MIMO scheme using SIC and an interference rejection combining (IRC) receiver to achieve further capacity gains, e.g., a three-fold gain in the spectrum efficiency representing a challenging target for FRA.
1,960 citations
"An Optimization Perspective of the ..." refers background in this paper
...The authors in [1] firstly presented the concept of NOMA for cellular future radio access, and pointed out that NOMA can achieve higher spectral efficiency and better user fairness than conventional OMA....
[...]
...The implementation of NOMA is based on the combination of superposition coding (SC) at the base station (BS) and successive interference cancellation (SIC) at users [1], which can achieve the optimum performance for degraded broadcast channels [7], [8]....
[...]
...INTRODUCTION R ECENTLY, non-orthogonal multiple access (NOMA) has received extensive research interests due to its superior spectral efficiency compared to conventional orthogonal multiple access (OMA) [1]–[3]....