首页> 外文期刊>IEEE Transactions on Information Theory >An analysis of the block error probability performance of iterative decoding
【24h】

An analysis of the block error probability performance of iterative decoding

机译:迭代解码的块误码概率性能分析

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

摘要

Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability P/sub b/, but also the block (frame) error probability P/sub B/, goes to zero as N and I go to infinity.
机译:当代码的块长度N和迭代次数I变为无穷大时,针对几类迭代可解码代码分析渐近迭代解码性能。考虑三类代码。这些是Gallager的常规低密度奇偶校验(LDPC)码,Tanner的广义LDPC(GLDPC)码以及Berrou等人提出的Turbo码。证明了在这些类别中存在代码以及针对这些代码的迭代解码算法,对于这些代码,不仅误码概率P / sub b /,而且块(帧)误码概率P / sub B /也变为零。 N和我去无穷大。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号