← 研踪 PaperTrailarXiv:2611.09383 · v1
Universal Decoding for Gaussian MIMO-ISI: Spherical Ensembles and Symmetric Neighborhoods
首次提交 2026-11-06 20:23
版本更新 2026-11-06 20:23
雷达观测 2026-11-09 11:19
摘要
We construct a universal decoder for cyclic Gaussian multiple-input multiple-output channels with intersymbol interference and unknown channel taps and spatial noise covariance. Codewords are drawn independently and uniformly from a sphere of fixed total energy. Under stated bounds on frequency variation, the decoder attains the ensemble-average error exponent of informed maximum-likelihood decoding for fixed channels and channels with growing memory. We approximate the frequency response by a constant matrix within each frequency block. For this auxiliary channel, every matched log-likelihood is affine in a common sufficient statistic. At fixed received output, we compute the statistic density of an independent competitor. The decoder selects the candidate with the smallest statistic density, equivalently minimizing a weighted sum of residual log-determinants. The density and its support volume give an upper bound on the universal competitor probability. Affinity ensures that at least half of a suitable symmetric neighborhood of the transmitted statistic has matched likelihood no smaller than that of the transmitted word. Integrating a density lower bound over this half gives the matched competitor bound. These bounds establish equality of error exponents, which a Gaussian channel comparison transfers to the original channel. The same decoder attains the matched exponent for independent frequency blocks with prescribed energies satisfying the stated conditions. For energies proportional to block length, an additional gain condition ensures that this exponent is at least that of the total-energy spherical ensemble.
作者备注：24 pages, 1 figure
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-06 20:23 · 最新观测版本
Universal Decoding for Gaussian MIMO-ISI: Spherical Ensembles and Symmetric Neighborhoods
We construct a universal decoder for cyclic Gaussian multiple-input multiple-output channels with intersymbol interference and unknown channel taps and spatial noise covariance. Codewords are drawn independently and uniformly from a sphere of fixed total energy. Under stated bounds on frequency variation, the decoder attains the ensemble-average error exponent of informed maximum-likelihood decoding for fixed channels and channels with growing memory. We approximate the frequency response by a constant matrix within each frequency block. For this auxiliary channel, every matched log-likelihood is affine in a common sufficient statistic. At fixed received output, we compute the statistic density of an independent competitor. The decoder selects the candidate with the smallest statistic density, equivalently minimizing a weighted sum of residual log-determinants. The density and its support volume give an upper bound on the universal competitor probability. Affinity ensures that at least half of a suitable symmetric neighborhood of the transmitted statistic has matched likelihood no smaller than that of the transmitted word. Integrating a density lower bound over this half gives the matched competitor bound. These bounds establish equality of error exponents, which a Gaussian channel comparison transfers to the original channel. The same decoder attains the matched exponent for independent frequency blocks with prescribed energies satisfying the stated conditions. For energies proportional to block length, an additional gain condition ensures that this exponent is at least that of the total-energy spherical ensemble.
查看此版本解读 →查看此版本原文 ↗