Search arXivSearch

arXiv · 2609.03356

Finite-SNR Closed Form for the Square Marčenko-Pastur MIMO Capacity

Abstract

For the canonical independent and identically distributed (IID) single-user multiple-input multiple-output (MIMO) channel with full channel state information at the transmitter (CSIT), the asymptotic capacity per receive antenna is a waterfilling integral over the Marčenko-Pastur law, whose shape depends only on the ratio of transmit to receive antennas. Closed forms are known for every ratio other than the square one, and there only above a finite signal-to-noise ratio (SNR). The square ratio behaves differently because the Marčenko-Pastur support reaches the origin. The waterfilling cutoff then stays strictly inside the support at every finite SNR, and the water level has been available only numerically. This letter closes that gap with a classical trigonometric parametrization of the square law, which removes the edge singularity and replaces the moving cutoff by a single angle. Both the SNR and the capacity become explicit functions of that angle, so the capacity curve is traced by sweeping the angle rather than by solving a scalar constraint at each operating point. The same parametrization delivers the low-SNR behavior in closed form, where the slope of capacity in SNR equals the upper edge of the limiting spectrum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohamed Akrout, Robert W. Heath. 2026-09-03. Finite-SNR Closed Form for the Square Marčenko-Pastur MIMO Capacity. https://arxiv.org/abs/2609.03356

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

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