加性噪声信道下高斯码本的熵倍增常数与鲁棒性
The entropic doubling constant and robustness of Gaussian codebooks for additive-noise channels
AI总结:
本文研究了随机向量和的微分熵比较不等式与熵倍增常数,探讨了大小倍增的推论,并证明了在功率约束下高斯码本在加性噪声信道中接近容量的鲁棒性,改进了低SNR下的已有界。
摘要:
本文针对两个独立随机向量 $X,Y$ 之和的微分熵 $h(X+Y)$,在其中一个被高斯分布替换时,得到了熵比较不等式。对于同分布的随机向量 $X,Y$,这些不等式与熵倍增常数的界密切相关,该常数量化了将一个随机向量的独立副本加到自身时熵的增加量。本文探讨了大小倍增的推论。对于大倍增情况,推导出了添加独立高斯分布时熵增加的下界;对于小倍增情况,则得到了熵功率不等式的定性稳定性结果。在非同分布随机向量 $X,Y$ 的更一般情形下,建立了一个对信道编码具有有趣含义的高斯比较不等式:对于具有功率约束的加性噪声信道,高斯码本可达到容量的 $\frac{\sf snr}{3{\sf snr}+2}$ 因子以内。在低 SNR 机制下,这改进了 Zamir 和 Erez (2004) 的半比特加性界。对于加性噪声多址信道和线性加性噪声 MIMO 信道,也得到了类似的结果。
英文摘要:
Entropy comparison inequalities are obtained for the differential entropy $h(X+Y)$ of the sum of two independent random vectors $X,Y$, when one is replaced by a Gaussian. For identically distributed random vectors $X,Y$, these are closely related to bounds on the entropic doubling constant, which quantifies the entropy increase when adding an independent copy of a random vector to itself. Consequences of both large and small doubling are explored. For the former, lower bounds are deduced on the entropy increase when adding an independent Gaussian, while for the latter, a qualitative stability result for the entropy power inequality is obtained. In the more general case of non-identically distributed random vectors $X,Y$, a Gaussian comparison inequality with interesting implications for channel coding is established: For additive-noise channels with a power constraint, Gaussian codebooks come within a $\frac{\sf snr}{3{\sf snr}+2}$ factor of capacity. In the low-SNR regime this improves the half-a-bit additive bound of Zamir and Erez (2004). Analogous results are obtained for additive-noise multiple access channels, and for linear, additive-noise MIMO channels.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。