Search arXivSearch

arXiv · 2602.14371

Diversity vs Degrees of Freedom in Gaussian Fading Channels

Abstract

The classical definitions extract degrees of freedom (DOF) via $C(\snr)/\log\snr$ and diversity (DIV) via $-\log P_e(\snr)/\log\snr$, using $\log\snr$ as the common gauge for both. These ratios hide a two-step process: first, identify the gauge on which capacity or reliability actually grows; second, normalize the coefficient on that gauge by the appropriate atom. For coherent multiple-input multiple-output (MIMO) both gauges happen to be $\log\snr$ and both atom coefficients happen to be one. This paper shows that the two-step process is necessary outside this calibration case and makes it explicit using a Bhattacharyya-frontier construction. A capacity--packing sandwich theorem shows that fixed-resolution output-law packing and covering recover the capacity gauge, and a binary-endpoint theorem shows that the two-message Bhattacharyya frontier identifies the zero-rate diversity gauge. Endpoint DOF and endpoint DIV are obtained by dividing the raw coefficient on the identified gauge by the corresponding atom coefficient. For fixed deterministic channel matrix~$H$, the capacity gauge is $\log\snr$ with endpoint DOF $T\,\mathrm{rank}(H)$, while the zero-rate diversity gauge is $\snr$ with endpoint DIV $Tσ_1^2(H)$, making fixed-$H$ a cross-gauge channel. For noncoherent scalar fast fading with $N$~receive antennas, the capacity gauge is $\log\log\snr$ with DOF~$1$, while the zero-rate diversity gauge is $\log\snr$ with endpoint DIV~$N$; the exact load-$r$ frontier gauge is $(\log\snr)^{1-r}$. The framework recovers the same-gauge cases, coherent Rayleigh MIMO and noncoherent block fading, with zero-rate DIV~$MN$. Audit tables separate exact results from lower bounds and open problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mahesh Godavarti. 2026-06-23. Diversity vs Degrees of Freedom in Gaussian Fading Channels. https://arxiv.org/abs/2602.14371

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