期刊文献+

一种改进的LDPC码译码算法研究 被引量:1

Research on an Improved Decoding Algorithm for Low-density Parity-check Codes
下载PDF
导出
摘要 针对传统BP算法运算复杂度较高的问题,将BP算法和WBF算法相结合提出LDPC码改进译码算法。在每次BP迭代译码中加入校验式判断,并利用一定的翻转判据进行加权。然后对满足条件的位进行翻转,再次进行校验式判断,加快获得许用码字的速度。在加性高斯白噪声信道下的仿真结果表明,此改进译码算法能有效降低译码的平均运行时间,并且能够保持和传统BP算法一样的优异译码性能。并针对不同最大迭代次数,不同码长,不同码率情况,对改进译码算法和传统BP算法的性能进行详细比较。 To solve the problem of high average running time,an improved decoding algorithm was proposed which was combined by BP algorithm and WBF algorithm.The parity check was added in each BP iterative decoding,and flipping criterions which were passed from check nodes to information nodes were weighted by the reliable information of received sequence.Then a bit flipping measure was to be taken according to specific rules in order to obtain correct codes,and a parity check was added again.Simulation results on Additive White Gaussian Noise(AWGN) channel show that,the improved algorithm can decrease the average running time effectively for LDPC codes while maintaining the excellent decoding performance as BP algorithm.And compared with classical BP algorithm,the effect of the different maximum numbers of iterations,different lengths of codes and different code rates for the improved decoding algorithm are analyzed.
出处 《科学技术与工程》 2011年第24期5817-5822,共6页 Science Technology and Engineering
关键词 低密度校验码 置信传播译码算法 加权比特翻转译码算法 比特误码率 平均运行时间 low-density parity-check codes belief propagation decoding algorithm weighted bit-flipping decoding algorithm bit error rate average running time
  • 相关文献

参考文献7

  • 1Gallager R G. Low-density parity-check codes. IRE Transactions on Information Theory, 1962; 1:21-28.
  • 2MacKay D J C. Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 1999 ; 3,45 ( 3 ) : 399-431.
  • 3MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes . Electronics Letter's, 1996; 32 (18) : 1645-1646.
  • 4周立媛,张立军,陈常嘉.低密度校验码的混合比特反转译码算法[J].北京交通大学学报,2005,29(2):47-50. 被引量:3
  • 5Kou Y, Lin S, Fossorier M. Low-density parity-check codes based on finite geometries : a rediscovery and new results. IEEE Transactions on Information Theory ,2001 ; 11,47 ( 7 ) :2711-2736.
  • 6翟政安 ,罗伦 ,时信华 .深空通信信道编译码技术研究[J].飞行器测控学报,2005,24(3):1-5. 被引量:17
  • 7Kolesnik V D. Probabilistic decoding of majority codes. Probl. Peredachi Information, 1971 ;7,7:3-12.

二级参考文献14

  • 1Gallager R G. Low-Density Parity-Check Codes[J]. IRE Transactions on Information Theory, 1962, 8:21 - 28.
  • 2Fossorier M. Iterative Reliability Based on Decoding of LDPC Codes[A]. 2001 IEEE International Symposium on Information Theory[C]. 2001. 233.
  • 3David J C MacKay. Good Error-Correcting Codes Based on Very Sparse Matrices[J ]. IEEE Transactions on Information Theory, 1999, 45(2) :399 - 431.
  • 4YU Kou. Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results [ J ]. IEEE Transactions on Inforration Theory 2001, 47(7):2711-2736.
  • 5David J C MacKay. Comparison of Constructions of Irregular Gallager Codes[J ]. IEEE Transactions on Communications, 1999,47(10): 1449- 1454.
  • 6Richardson T J. The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding [ J ]. IEEE Transactions on Information Theory,2001, 47(2) :599- 618.
  • 7Zhang Juntan. A Modified Weighted Bit-Flipping Decoding of Low-Density Parity-Check Codes[J]. IEEE Communications Letters, 2004, 8(3): 165 - 167.
  • 8Dolinar S. A New Code for Galileo[R]. TDA PR 42-93, January-March 1988: 83-96.
  • 9Pollara F, Cheung K M. Performance of Concatenated Codes Using 8-Bit and 10-Bit Reed-Solomon Codes[R]. TDA PR 42-97, January-March 1989: 194-201.
  • 10Harcke L, Wood G. Laboratory and Flight Performance of the Mars Pathfinder (15,1/6) Convolutionally Encoded Telemetry Link[R]. TDA PR 42-129, January-March 1997:1-11.

共引文献17

同被引文献3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部