Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2106.04203

On the Outage Capacity of the Massive MIMO Diversity Channel

Marco Martalo·Riccardo Raheli
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the massive Multiple Input Multiple Output (MIMO) diversity channel affected by independent and identically distributed Rayleigh fading, with linear processing at both transmitter and receiver sides, and analyze the outage capacity for large number of antennas. We first discuss the classical Single Input Multiple Output (SIMO) diversity channel that uses Maximal Ratio Combining (MRC) or Selection Combining (SC). For MRC, a numerical computation and a Gaussian Approximation (GA) are considered, whereas for SC an exact evaluation is possible. The analysis is then straightforwardly extended to the Multiple Input Single Output (MISO) system that uses Maximal Ratio Transmission (MRT) or transmit antenna selection. The general Multiple Input Multiple Output (MIMO) system that pursues full diversity is finally considered, with both optimal linear processing and simple antenna selection at both transmitter and receiver. If the number of antennas is sufficiently large on at least one side, the outage capacity of each considered diversity channel approaches that of a suitable reference Additive White Gaussian Noise (AWGN) channel with properly defined Signal-to-Noise Ratio (SNR), which provides a performance benchmark. This conclusion is valid for large but realistic number of antennas compatible with the assumption of independent fading.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Martalo, Riccardo Raheli. 2021-06-08. On the Outage Capacity of the Massive MIMO Diversity Channel. https://doi.org/10.1016/j.phycom.2022.101683

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↗