Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.14548

Out-of-Band Distortion in Massive MIMO: What to expect under realistic conditions?

Laura Monteyne·Gilles Callebaut·Björn Sihlbom·Liesbet Van der Perre
View original source ↗Read source document ↗Export metadata ↓

Abstract

Massive Multiple Input Multiple Output (MIMO) offers superior capacity for future networks. In the quest for energy efficient implementation of these large array-based trans-mission systems, the power consumption of the Power Amplifiers(PAs) is a main bottleneck. This paper investigates whether it is possible to operate the PAs in their efficient nonlinear region, as the Out-of-Band (OOB) distortion may not get the same array gain as the in-band (IB) signals. We present a framework to simulate the effects under realistic conditions, leveraging on an accurate Ray-Tracing Simulator (RTS). The results show that the often assumed i.i.d. Rayleigh fading channel model results in too optimistic predictions, also in Non Line of Sight (NLoS) multi-path scenarios, regarding the spatial distribution of OOB emissions. We further comment on the consequences in view of current regulatory constraints.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laura Monteyne, Gilles Callebaut, Björn Sihlbom, Liesbet Van der Perre. 2021-11-29. Out-of-Band Distortion in Massive MIMO: What to expect under realistic conditions?. https://arxiv.org/abs/2111.14548

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↗