无抖动的LDA格在高斯信道下的容量
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel
摘要:
本文研究了低密度构造-A(LDA)格,它是由非二进制低密度奇偶校验码通过构造A得到的。更准确地说,证明了LDA格的Voronoi星座达到格编码和解码下的AWGN信道的容量。这是在示出更一般的构造A晶格星座的相同结果之后获得的。理论分析的方式进行,允许描述如何作为一个函数的晶格维数的基础上的结构A的素数行为。此外,在传输方案中不需要抖动,简化了问题的一些先前解决方案。值得注意的是,容量是可实现的LDA格码,其奇偶校验矩阵具有恒定的行和列汉明权重。随机二部图的一些扩展性质构成了处理稀疏矩阵的一个非常重要的工具,并允许在我们的系综中找到LDA格的最小欧氏距离的下界。
英文摘要:
This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary Low-Density Parity-Check codes. More precisely, a proof is provided that Voronoi constellations of LDA lattices achieve the capacity of the AWGN channel under lattice encoding and decoding. This is obtained after showing the same result for more general Construction-A lattice constellations. The theoretical analysis is carried out in a way that allows to describe how the prime number underlying Construction A behaves as a function of the lattice dimension. Moreover, no dithering is required in the transmission scheme, simplifying some previous solutions of the problem. Remarkably, capacity is achievable with LDA lattice codes whose parity-check matrices have constant row and column Hamming weights. Some expansion properties of random bipartite graphs constitute an extremely important tool for dealing with sparse matrices and allow to find a lower bound of the minimum Euclidean distance of LDA lattices in our ensemble.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。