Search arXivSearch

arXiv · 2609.15048

Zero-SNR Analyticity of the Scalar MMSE Is Equivalent to Gaussianity

Abstract

Let $Y_s=\sqrt{s}X+Z$, where $Z$ is standard Gaussian and independent of the real random variable $X$. We prove that, under the square-exponential moment condition $\mathbb{E}e^{βX^2}<\infty$ for some $β>0$, the scalar minimum mean-square error $\operatorname{mmse}_X(s)$ is analytic at zero signal-to-noise ratio if and only if $X$ is Gaussian, with constant random variables included as degenerate Gaussians. The proof converts estimation in the Gaussian channel into a backward heat flow acting on the moment-generating function $M(z)=\mathbb{E}e^{zX}$. Under the stated tail condition, every non-Gaussian input forces $M$ to have a nonzero complex zero. We show that each zero cluster produces a finite singularity in its localized Borel transform at the action $ξ=z_0^2/2$. After removing the action scale, the Borel coefficients have a nonzero $n^{-1/2}$ prefactor for a simple zero. A zero of multiplicity $m\geq 2$ splits according to the roots of a Hermite polynomial and instead contributes a prefactor $n^{-m/2}e^{r_m\sqrt{2n}}$. A finite-disc localization and relative-cycle continuation argument then show that at least one such singularity survives in the full Borel transform. Thus, for every non-Gaussian input in the stated class, the formal zero-SNR expansion is Gevrey-1 but divergent. Rational-MMSE rigidity and the analogous analyticity criterion for mutual information follow as corollaries.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yixing Zhang. 2026-09-14. Zero-SNR Analyticity of the Scalar MMSE Is Equivalent to Gaussianity. https://arxiv.org/abs/2609.15048

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