基于素域构造的准循环低密度校验码
doi: 10.3724/SP.J.1146.2009.00208
Construction of Quasi-Cyclic LDPC Codes From Prime Fields
-
摘要: 该文提出一种基于素域构造准循环低密度校验码的方法。该方法是Lan等所提出基于有限域构造准循环低密度校验码的方法在素域上的推广，给出了一类更广泛的基于素域构造的准循环低密度校验码。通过仿真结果证实：所构造的这一类准循环低密度校验码在高斯白噪声信道上采用迭代译码时具有优良的纠错性能。Abstract: This paper presents a method to construct quasi-cyclic LDPC codes from prime fields. This method is a generalization of a method proposed by Lan et al to construct quasi-cyclic LDPC codes based on finite fields, and gives a much larger class of quasi-cyclic LDPC codes based on prime fields. Simulations show that quasi-cyclic LDPC codes constructed by the proposed method perform well over AWGN channels with iterative decoding.
-
Gallager R G. Low density parity check codes[J]. IEEEInformation Theory, 1962, IT-8( 1): 21-28.[2]MacKay D J C and Neal R M. Near Shannon limitperformance of low density parity check codes[J].IEEElectron. Letters.1996, 32(18):1645-1646[3]Dai Y, Yan Z, and Chen N. Optimal overlapped messagepassing decoding of quasi-cyclic LDPC codes[J]. IEEE VeryLarge Scale Integration Systems, 2007, 16(5): 565-578.[4]LiZ, Chen L, Zeng L, Lin S, and Fong W. Efficient encodingof quasi-cyclic low-density parity-check codes[J]. IEEECommunication, 2006, 54(1): 71-81.[5]Wang Z and Cui Z. A memory efficient partially paralleldecoder architecture for QC-LDPC codes[J].IEEE VeryLarge Scale Integration Systems.2007, 15(4):483-488[6]Lan L, Zeng L Q Y, Tai Y, Chen L, Lin S, and Abdel-GhaffarK. Construction of quasi-cyclic LDPC codes for AWGN andbinary erasure channels: A finite field approach[J].IEEEInformation Theory.2007, 53(7):2429-2458 -
计量
- 文章访问数: 3755
- HTML全文浏览量: 171
- PDF下载量: 565
- 被引次数: 0
下载:
