Good error-correcting codes based on very sparse matrices
Good error-correcting codes based on very sparse matrices
复制标题
DOI：
10.1109/isit.1997.613028
复制
发表时间：
1997-06
期刊：
影响因子：
--
通讯作者：
D. Mackay
中科院分区：
文献类型：
--
作者：
D. Mackay
我们报告了Gallager（1963）低密度奇偶校验码在高斯信道上的理论和实验性质。可以证明，给定一个最佳的解码器，这些码渐近接近香农限。与一个实际的“信念传播”解码器，性能大大优于标准的卷积码和级联码，可以实现;事实上，性能几乎接近香农极限的Turbo码。
We report theoretical and empirical properties of Gallager's (1963) low density parity check codes on Gaussian channels. It can be proved that, given an optimal decoder, these codes asymptotically approach the Shannon limit. With a practical 'belief propagation' decoder, performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of turbo codes.