最大似然阈值下的多项式时间MIMO检测
Polynomial-Time MIMO Detection at the Maximum-Likelihood Threshold
浏览论文内容
中文总结 AI 辅助
本文证明在方形高斯二进制MIMO模型中，舍入线性MMSE加最陡单比特下降可在多项式时间内达到与最大似然检测相同的一阶SNR阈值，实现精确块恢复。
中文摘要 AI 辅助
我们证明了在方形高斯二进制MIMO模型中，精确块恢复可以在与穷举最大似然检测相同的一阶SNR阈值下以多项式时间实现。具体而言，对于 $y=\sqrt{\rho/N}Hx^\star+w, \\; x^\star\in\{\pm1\}^N,$ 以及独立的 $H\in\mathbb R^{N\times N}$ 和 $w$（均为标准高斯分布），舍入线性MMSE后接最陡单比特下降，可以在每个传输字和每个 $\rho\ge2\log N$ 上均匀地以趋于零的失败概率恢复 $x^\star$，使用 $O(N^3)$ 次单位成本精确实数算术运算。该模型是高斯随机线性估计的特例，对于该估计，AMP状态演化和replica/MMSE公式严格刻画了固定参数归一化性能。这些结果预测了相同的 $2\log N$ 尺度，但本身并不在此处考虑的维度相关机制中产生全坐标保证。据我们所知，没有先前工作在ML边界上为此设置提供多项式时间精确块恢复；最接近的先前方形系统定理（针对盒松弛）具有一阶阈值 $4\log N$。证明将舍入LMMSE估计置于与真实值的亚线性汉明距离处，然后均匀地建立，对于局部搜索可能访问的每个错误集，某个错误比特提供量化的成本降低，而目标障碍限制搜索路径。相反，如果 $0<\rho\le2\log N-\log\log N-s_N$ 且 $s_N\to\infty$ 和 $s_N=o(\log N)$，则单比特邻居以趋于一的概率胜过传输字，因此即使ML检测也失败。因此，在所陈述的算术模型中，统计和多项式时间精确恢复阈值在一阶上重合。
英文摘要
We prove that exact block recovery in the square Gaussian binary MIMO model can be achieved in polynomial time at the same first-order SNR threshold as exhaustive maximum-likelihood detection. Specifically, for $y=\sqrt{ρ/N}Hx^\star+w, \; x^\star\in\{\pm1\}^N,$ and independent standard Gaussian $H\in\mathbb R^{N\times N}$ and $w$, rounded linear MMSE followed by steepest single-bit descent recovers $x^\star$ with failure probability tending to zero, uniformly over every transmitted word and every $ρ\ge2\log N$, using $O(N^3)$ unit-cost exact-real arithmetic operations. The model is a special case of Gaussian random linear estimation, for which AMP state evolution and replica/MMSE formulas rigorously characterize fixed-parameter normalized performance. Those results predict the same $2\log N$ scale, but do not by themselves yield an all-coordinate guarantee in the dimension-dependent regime considered here. To the best of our knowledge, no prior work gives polynomial-time exact block recovery at the ML boundary for this setting; the closest prior square-system theorem, for the box relaxation, has first-order threshold $4\log N$. The proof places the rounded LMMSE estimate at sublinear Hamming distance from the truth, and then establishes, uniformly over every error set the local search can visit, that some wrong bit offers a quantified cost decrease while an objective barrier confines the search path. Conversely, if $0<ρ\le2\log N-\log\log N-s_N$ with $s_N\to\infty$ and $s_N=o(\log N)$, then a one-bit neighbor beats the transmitted word with probability tending to one, so even ML detection fails. Therefore, the statistical and polynomial-time exact-recovery thresholds coincide to first order in the stated arithmetic model.
发表机构
- Microsoft Research（微软研究院）
- University of Wisconsin（威斯康星大学）
机构由 AI 辅助整理，请以论文原文为准。
