Search arXivSearch

arXiv · 1809.07224

Non-Orthogonal Multiple Access: Common Myths and Critical Questions

Abstract

Non-orthogonal multiple access (NOMA) has received tremendous attention for the design of radio access techniques for fifth generation (5G) wireless networks and beyond. The basic concept behind NOMA is to serve more than one user in the same resource block, e.g., a time slot, subcarrier, spreading code, or space. With this, NOMA promotes massive connectivity, lowers latency, improves user fairness and spectral efficiency, and increases reliability compared to orthogonal multiple access (OMA) techniques. While NOMA has gained significant attention from the communications community, it has also been subject to several widespread misunderstandings, such as $``\textit{NOMA is based on allocating higher power to users with worse channel conditions. As such, cell-edge users receive more power in NOMA and due to this biased power allocation toward cell-edge users inter-cell interference is more severe in NOMA compared to OMA. NOMA also compromises security for spectral efficiency.}''$ The above statements are actually false, and this paper aims at identifying such common myths about NOMA and clarifying why they are not true. We also pose critical questions that are important for the effective adoption of NOMA in 5G and beyond and identify promising research directions for NOMA, which will require intense investigation in the future.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mojtaba Vaezi, Robert Schober, Zhiguo Ding, H. Vincent Poor. 2019-06-24. Non-Orthogonal Multiple Access: Common Myths and Critical Questions. https://arxiv.org/abs/1809.07224

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT