Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.03101

Massive MIMO and NOMA Bits-per-Antenna Efficiency under Power Allocation Policies

Thiago Alves Bruza Alves·Taufik Abrão
View original source ↗Read source document ↗Export metadata ↓

Abstract

A comparative resource allocation analysis in terms of received bits-per-antenna spectral efficiency (SE) and energy efficiency (EE) in downlink (DL) single-cell massive multiple-input multiple-output (mMIMO) and non-orthogonal multiple access (NOMA) systems considering a BS equipped with many ($M$) antennas, while $K$ devices {operate} with a single-antenna, and {the loading of devices} $ρ= \frac{K}{M}$ ranging in $0<ρ\leq 2$ is carried out under three different \ac{PA} strategies: the inverse of the channel power allocation (PICPA), a modified water-filling ($Δ$-WF) allocation method, and the equal power allocation (EPA) reference method. Since the two devices per cluster are overlapped in the power domain in the NOMA system, the channel matrix requires transformation to perform the zero-forcing (ZF) precoding adopted in mMIMO. Hence, NOMA operating under many antennas can favor a group of devices with higher array gain, overcoming the mMIMO and operating conveniently in the higher loading range $0.6<ρ<2.0$. In such a scenario, a more realistic and helpful metric consists of {evaluating} the area under SE and EE curves, by measuring the bit-per-antenna and bit-per-antenna-per-watt efficiency, respectively. Our numerical results confirm a superiority of NOMA w.r.t. mMIMO of an order of 3x for the SE-area and 2x for the EE-area metric.

Explore related subjects

cs.ITcs.SYeess.SPeess.SYmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thiago Alves Bruza Alves, Taufik Abrão. 2023-01-08. Massive MIMO and NOMA Bits-per-Antenna Efficiency under Power Allocation Policies. https://doi.org/10.1016/j.phycom.2021.101588

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗