Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.15930

A Comprehensive Performance Analysis for mm-Wave Massive MIMO Hybrid Beamforming under PA Nonlinearities

Murat Babek Salman·Gokhan Muzaffer Guvensen
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we develop a framework to investigate the performances of different hybrid beamforming architectures for massive multiple input multiple output (MIMO) systems impaired by power amplifier (PA) nonlinearities. Indirect learning architecture based on feedback after anti-beamforming is adopted in design of digital pre-distortion (DPD) in order to compensate the nonlinear distortion caused by PA. In addition, we propose a novel analog beamformer design for partially connected architecture based on generalized eigen-beamformer (GEB) approach. In literature, the effects of nonlinear PA's on the out-of-band (OOB) radiation and achieved signal-to-interfence-plus-noise ratio (SINR) are investigated. However, these studies are limitted to fully digital or partially connected hybrid beamforming architectures while deploying Bussgang decompostion on a PA basis without considering the array architecture type in performance analysis. In this study, we derived an analytical bit-error-rate (BER) expression based on spatio-temporal Bussgang decompostion in matrix form, and mismatched decoding capacity via Generalized Mutual Information (GMI) is obtained under PA nonlinearity for different hybrid Massive MIMO architectures. Analytical results show that the nonlinear distortion significantly affects the system performance, and DPD can reduce these effects to some extend. Finally, obtained analytical BER expression is verified via numerical results.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Murat Babek Salman, Gokhan Muzaffer Guvensen. 2021-02-26. A Comprehensive Performance Analysis for mm-Wave Massive MIMO Hybrid Beamforming under PA Nonlinearities. https://arxiv.org/abs/2006.15930

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↗