Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.00286

Measurement-Based Validation of Z3RO Precoder to Prevent Nonlinear Amplifier Distortion in Massive MIMO Systems

Thomas Feys·Gilles Callebaut·Liesbet Van der Perre·François Rottenberg
View original source ↗Read source document ↗Export metadata ↓

Abstract

In multiple input multiple output (MIMO) systems, precoding allows the base station to spatially focus and multiplex signals towards each user. However, distortion introduced by power amplifier nonlinearities coherently combines in the same spatial directions when using a conventional precoder such as maximum ratio transmission (MRT). This can strongly limit the user performance and moreover create unauthorized out-of-band (OOB) emissions. In order to overcome this problem, the zero third-order distortion (Z3RO) precoder was recently introduced. This precoder constraints the third-order distortion at the user location to be zero. In this work, the performance of the Z3RO precoder is validated based on real-world channel measurement data. The results illustrate the reduction in distortion power at the UE locations: an average distortion reduction of 6.03 dB in the worst-case single-user scenario and 3.54 dB in the 2-user case at a back-off rate of -3 dB.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Feys, Gilles Callebaut, Liesbet Van der Perre, François Rottenberg. 2022-09-16. Measurement-Based Validation of Z3RO Precoder to Prevent Nonlinear Amplifier Distortion in Massive MIMO Systems. https://doi.org/10.1109/vtc2022-spring54318.2022.9861020

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↗