...
首页> 外文期刊>Information Theory, IEEE Transactions on >Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
【24h】

Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes

机译:低密度奇偶校验码的最佳解码的清晰边界

获取原文
获取原文并翻译 | 示例
           

摘要

Consider communication over a binary-input memoryless output-symmetric channel with low-density parity-check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the average input-output conditional entropy per bit in the infinite block length limit. Montanari proved a lower bound for this entropy, in the case of LDPC ensembles with convex check degree polynomial, which matches the replica formula. Here we extend this lower bound to any irregular LDPC ensemble. The new feature of our work is an analysis of the second derivative of the conditional input-output entropy with respect to noise. A close relation arises between this second derivative and correlation or mutual information of codebits. This allows us to extend the realm of the ldquointerpolation method,rdquo in particular, we show how channel symmetry allows to control the fluctuations of the ldquooverlap parametersrdquo.
机译:考虑通过具有低密度奇偶校验(LDPC)码和最大后验(MAP)解码的二进制输入无记忆输出对称信道进行通信。自旋玻璃理论的复制方法可以为无限块长度限制中每位的平均输入-输出条件熵的解析公式进行推测。在具有凸检验度多项式的LDPC集合的情况下,Montanari证明了该熵的下界,该LDPC集合与副本公式匹配。在这里,我们将此下限扩展到任何不规则的LDPC集合。我们工作的新功能是分析条件输入输出熵相对于噪声的二阶导数。在该二阶导数与码位的相关性或互信息之间产生密切的关系。这使我们能够扩展“内插”方法的领域,特别是,我们展示了通道对称性如何控制“重叠参数”的波动。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号