Search arXivSearch

arXiv · 2312.15167

Analysis of One-Bit Quantized Linear Precoding Schemes in Multi-Cell Massive MIMO Downlink

Abstract

This work studies a multi-cell one-bit massive multiple-input multiple-output (MIMO) system that employs one-bit analog-to-digital converters (ADCs) and digital-to-analog converters (DACs) at each base station (BS). We utilize Bussgang decomposition to derive downlink signal-to-quantization-plus-interference-plus-noise ratio (SQINR) and ergodic achievable rate expressions under one-bit quantized maximum ratio transmission (MRT) and zero-forcing (ZF) precoding schemes considering scenarios with and without pilot contamination (PC) in the derived channel estimates. The results are also simplified for the mixed architecture that employs full resolution (FR) ADCs and one-bit DACs, and the conventional architecture that employs FR ADCs and DACs. The SQINR is shown to decrease by a factor of $2/π$ and $4/π^2$ in the one-bit setting compared to that achieved in the mixed setting and conventional setting respectively under MRT precoding without PC. Interestingly, the decrease in SQINR is less when we consider PC, which is shown to adversely impact the conventional system more than the one-bit system. Similar insights are obtained under ZF precoding with the decrease in the SQINR with the use of one-bit ADCs and DACs being more pronounced. We utilize the derived expressions to yield performance insights related to power efficiency, the numbers of antennas needed by the three architectures to achieve the same sum-rate, and energy efficiency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qurrat-Ul-Ain Nadeem, Anas Chaaban. 2023-12-23. Analysis of One-Bit Quantized Linear Precoding Schemes in Multi-Cell Massive MIMO Downlink. https://arxiv.org/abs/2312.15167

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