期刊文献+

一种改进的PS-LDPC码构造法

An Improved algorithm for constructing PS-LDPC codes
下载PDF
导出
摘要 为提高校验矩阵的构造效率,对子矩阵的移位系数的选择提出了合理的理论准则,并提供了一种直观且合理的寻找矩阵中闭合环路的方法以简化构造过程.以AWGN信道仿真考察了采用这种改进方法构造的PS-LDPC码的译码性能.仿真结果证明采用此改进算法构造的PS-LDPC码具有更优的BER性能. Partition-and-Shift codes have been paid much attention in the area of error correction in telecommunication system, because of its ideal girth and rain-distance property. An Improved algorithm for constructing PS-LDPC codes is presented to improve constructing efficiency, by employing a precise criterion for choosing the shift parameters in shift matrix and a perspicuous and reasonable method to search for closed paths simply. Finally, the improved PS - LDPC codes are simulated over AWGN channel and a better BER performance is obtained.
出处 《哈尔滨工业大学学报》 EI CAS CSCD 北大核心 2011年第3期29-32,共4页 Journal of Harbin Institute of Technology
关键词 PS—LDPC码 移位矩阵 周长 最小距离 闭合环路 Partition-and-Shift codes shift matrix girth rain-distance closed path
  • 相关文献

参考文献10

  • 1GALLAGER R. Low-density parity-check codes [ J]. IEEE Transactions on Information Theory, 1962, 8 (1): 21 -28.
  • 2MACKAY D J C. Good error-correcting codes based on very sparse matrices [ J ]. IEEE Transactions on Infor- mation Theory, 1999, 45(2) : 399 -431.
  • 3MACKAY D J C, NEAL R M. Near shannon limit per- formance of low density parity check codes [ J ]. Elec- tronics Letters, 1997, 33(6) : 457 -458.
  • 4HU X Y, ELEFTHERIOU E, ARNOLD D M. Progressive edge-growth Tanner graphs [ C ]//IEEE Global Telecom- munications Conference, 2001. GLOBECOM O1: IEEE. Piscataway:IEEE, 2001, 2 (25 -29) :995 - 1001.
  • 5HU X Y, ELEFFHERIOU E, ARNOLD D M. Regular and irregular progressive edge-growth tanner graphs [ J ]. IEEE Transactions on Information Theory, 2005, 51(1) : 386 -398.
  • 6ZHANG Tong, PARHI K K. An FPGA implementation of (3,6) regular low density-parity check-code decoder [ J]. EURASIP Journal on Applied Signal Processing, 2003,6:530 - 542.
  • 7LIAO E, ENGLING Y, NIKOLIC B. Low-density pari- ty-check code constructions for hardware implementation [ C ]//IEEE International Conference on Communica- tions. Piscata way : IEEE, 2004, 5 : 2573 - 2577.
  • 8LI Z W, VIJAYA KUMAR B V K. A class of good qua- si-cyclic low-density parity check codes based on pro- gressive edge growth graph [ J ]. IEEE Commun Lett, 2004, 2 : 1990 - 1994.
  • 9LU J, MOURA J M F. Partition-and-Shift LDPC Codes [J]. IEEE Transactons on Magnetics, 2005,41 (10) : 2977 - 2979.
  • 10LU J, MOURA J M F. Structured LDPC codes for high- density recording: Large girth and low error floor [ J ]. IEEE Transactions on Magneticsj 2006, 42 (2) : 208 - 213.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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