一种高性能低复杂度的非规则LDPC码的构造方法

郭锐; 刘济林

doi:10.3724/SP.J.1146.2006.01416

一种高性能低复杂度的非规则LDPC码的构造方法

doi: 10.3724/SP.J.1146.2006.01416

郭锐,
刘济林

基金项目:

国家自然科学基金重大项目(60534070)资助课题

计量
- 文章访问数: 3539
- HTML全文浏览量: 113
- PDF下载量: 803
- 被引次数: 0
出版历程
- 收稿日期: 2006-09-18
- 修回日期: 2007-07-20
- 刊出日期: 2008-04-19

A Class of Irregular LDPC Codes with High Performance and Low Encoding Complexity

Guo Rui,
Liu Ji-lin

摘要

摘要: 该文提出了一种基于置换矩阵(permutation matrix)的非规则低密度奇偶校验(LDPC)码构造方法。首先，提出了基于改进eIRA(IeIRA)算法的全局矩阵M；接着，通过对全局矩阵H进行矩阵置换，生成LDPC码的校验矩阵H；研究了校验矩H中短圈(short cycle)长度与置换矩阵循环移位系数的关系，通过选择循环移位系数，以达到改善误比特率性能的目的。仿真结果表明，该文提出的构造方法在保证线性编码复杂度的前提下，增大了码字的最小距离，减少了小停止集合(stopping set)的数量，降低了误比特率的差错平台(error floor)(达到10-9)。
- 低密度奇偶校验（LDPC）码; 置信传播（BP）算法; 差错平台; 置换矩阵; 停止集合
Abstract: A class of structured irregular Low-Density Parity-Check (LDPC) codes with high performance and low complexity is proposed in this paper. First, a global matrix M with a triangular plus dual-diagonal form based on Improved eIRA (IeIRA) method is designed. Then, each 1 in the global matrix M is replaced with a permutation matrix; each 0 is replaced with a null matrix to generate the parity check matrix H. Finally, the relationship between the length of short cyclic in the parity matrix H and the cyclic shift coefficient is given. Based on the relationship, error floor of BER is lowed by selecting proper cyclic shift coefficient of each permutation matrix. Simulation shows that the proposed method can reduce the number of small stopping set, increase the minimum distance of LDPC codes, and achieve very low error floor with linear encoding complexity.

HTML全文

参考文献(1)

Gallager R G. Low-density parity-check codes[J].IEEETrans. on Information Theory.1962, 8(1):21-28[2]Mackay D J C. Good error-correcting codes based on verysparse matrices [J].IEEE Trans. on Information Theory.1999, 45(3):399-431[3]Heum C C. Technical issues for enhanced and beyond 3Gsystems[C]. The International Forum Future MobileTelecommunications China-EU Post Conference onBeyond 3G, Beijing, China, 2002: 892-901.[4]Hocevar D E. LDPC code construction with flexiblehardware implementation[C]. in Proc. IEEE Int. Conf.Communications (ICC), Dallas, TX, USA , May 2003:708-2711.[5]Fossorier M P C. Quasi-cyclic low-density parity-check codesfrom circulant permutation matrices[J].IEEE Trans onInformation Theory.2004, 50(8):1788-1793[6]Yang M, Li Yi, and Ryan W E. Design of efficientlyencodable moderate-length high-rate irregular LDPC codes[J].IEEE Trans. on Commun.2004, 52(4):564-571[7]Divsalar D, Dolinar S, and Pollara F. Iterative turbo decoderanalysis based on density evolution [J].IEEE J. Select. Areain Commun.2001,19(5):891-907[8]Kang Jingyu, Fan Pingyi, and Cao Zhigang. Flexibleconstruction of irregular partitioned permutation LDPCcodes with low error floors [J].IEEE Communications Letters.2005, 9(6):534-536[9]Fan. J. Array codes as low-density parity-check codes [C]. inProc. 2nd Int. Symp. on Turbo Codes Related Topics,Brest, France, Sep. 2000: 543-546.[10]Tian T, Jones C, and Villasenor J, et al.. Construction ofirregular ldpc codes with low error floors [C]. in Proc. IEEEInt. Conf. Communications (ICC), Dallas, TX, USA , May2003: 3125-3129.[11]Richardson T, Shokrollahi A, and Urbanke R. Design ofcapacity approaching irregular low-density parity-check codes[J].IEEE Trans. on Informatiom Theory.2001, 47(2):638-656[12]McGowan J A and Williamson R C. Loop removal from ldpccodes [C]. in Proc. IEEE Info. on Theory Workshop (ITW),Paris, France, Mar. 2003: 230-233.[13]Hu Xiao Yu and Fossorier M P C. On the computation of theminimum distance of low-density parity_check codes[C].2004 IEEE International Conference on Communications,Paris, France, June 2004, Vol.2: 767-771.

施引文献

资源附件(0)

访问统计