arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1103.0171cs.ITmath.IT
收藏

有限维无限星座

Finite Dimensional Infinite Constellations

Amir Ingber, Ram Zamir, Meir Feder

摘要:

Poltyrev提出的无功率约束的高斯信道的设置中,码字是在n维欧几里德空间(无限星座)中的点,并考虑它们的密度和错误概率之间的权衡。该设置中的容量是具有消失的错误概率的最高可实现的归一化对数密度(NLD)。该容量以及该设置的误差指数界限是已知的。在这项工作中,我们认为在固定的块长度(尺寸)制度实现的最佳性能。我们提供了两个新的可积性界,并将球界的有效性推广到有限维无限星座。我们还提供了渐近分析的界限:当NLD是固定的,我们提供了渐近展开的界限是显着更紧密的比以前已知的误差指数的结果。当错误概率是固定的,我们表明,随着n的增长,容量的差距是成反比的(一阶)的平方根n的比例常数是由允许的错误概率的反Q函数,乘以平方根的1/2。与信道编码中的类似结果类似,无限星座的色散是每个信道使用的1/2nat^2。我们所有的可扩展性结果都使用了格,因此也适用于最大错误概率。连接的功率约束高斯信道的误差指数和体积噪声比作为一个因素的优点进行了讨论。此外,我们证明了紧密的结果数值和比较国家的最先进的编码方案。

英文摘要:

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability is considered. The capacity in this setting is the highest achievable normalized log density (NLD) with vanishing error probability. This capacity as well as error exponent bounds for this setting are known. In this work we consider the optimal performance achievable in the fixed blocklength (dimension) regime. We provide two new achievability bounds, and extend the validity of the sphere bound to finite dimensional infinite constellations. We also provide asymptotic analysis of the bounds: When the NLD is fixed, we provide asymptotic expansions for the bounds that are significantly tighter than the previously known error exponent results. When the error probability is fixed, we show that as n grows, the gap to capacity is inversely proportional (up to the first order) to the square-root of n where the proportion constant is given by the inverse Q-function of the allowed error probability, times the square root of 1/2. In an analogy to similar result in channel coding, the dispersion of infinite constellations is 1/2nat^2 per channel use. All our achievability results use lattices and therefore hold for the maximal error probability as well. Connections to the error exponent of the power constrained Gaussian channel and to the volume-to-noise ratio as a figure of merit are discussed. In addition, we demonstrate the tightness of the results numerically and compare to state-of-the-art coding schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑