doi:

DOI: 10.3724/SP.J.1146.2009.00388

Journal of Electronics & Information Technology (电子与信息学报) 2010/32:4 PP.825-829

Concatenation Decoding Algorithm for QC-LDPC Codes Based on the Reduced List Syndromes


Abstract:
Reduced List Syndrome Decoding (RLSD) algorithm and QC-LDPC codes are investigated in this paper, based on which, a new BP-RLSD concatenation algorithm for QC-LDPC codes is proposed. When the Belief Propagation (BP) algorithm fails, the soft LLR reliable information is sent to the RLSD algorithm. Based on the regular structure of permutation sub matrices, this paper proposes a method to reduce the search space of error patterns according to the weight of syndrome. This paper also proposes a fast look-up table method to search out a part of error positions. Those methods, combined with the information of Least Reliable Independent Positions (LRIPs), can achieve an efficient search for the Maximum Likelihood (ML) code, and substantially reduce the computation time. The simulation results show that the proposed methods are effective. The improved algorithm combined with the BP algorithm, can achieves a good tradeoff between computational complexity and decoding performance.

Key words:QC-LDPC codes,Reduced List Syndrome Decoding(RLSD),Least Reliable Independent Positions (LRIPs),Maximum likelihood Decoding (MLD)

ReleaseDate:2014-07-21 15:17:45



[1] Wang Z and Cui Z. A memory efficient partially parallel decoder architecture for quasi-cyclic LDPC codes [J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2007, 15(4): 483-488.

[2] Darabiha A and Carusone A C, et al. Block-interlaced LDPC decoders with reduced interconnect complexity [J]. IEEE Transactions on Circuits and Systems II: Express Briefs, 2008, 55(1): 74-78.

[3] Hao Z and Tong Z, et al. Quasi-cyclic LDPC codes for the magnetic recording channel: Code design and VLSI implementation [J]. IEEE Transactions on Magnetics, 2007, 43(3): 1118-1123.

[4] ETSI EN 302 307. Second generation framing structure, channel coding and modulation system for broadcasting, interactive services, news gathering and other broadband satellite applications [S], 2004, 1.

[5] Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J]. IEEE Transactions on Information Theory, 2004, 50(8): 1788-1793.

[6] Kiran K G and Gwan S C, et al. A parallel VLSI architecture for layered decoding for array LDPC codes [C]. 20th International Conference on VLSI Design, Bangalore, India, 2007: 738-743.

[7] Daesun O and Parhi K K. Efficient highly-parallel decoder architecture for quasi-cyclic low-density parity-check codes [C]. IEEE International Symposium on Circuits and Systems, New Orleans, USA, 2007: 1855-1858.

[8] Kachinschang F R, Frey B J, and Loeliger H A. Factor graphs and the sum-product algorithm [J]. IEEE Transactions on Information Theory, 2001, 47(2): 498-519.

[9] Fossorier M and Valembois A. Reliability-based decoding of Reed-Solomon codes using their binary image [J]. IEEE Communication Letters, 2004, 8(7): 452-454.

[10] Fossorier M P C. Iterative reliability-based decoding of low-density parity check codes [J]. IEEE Journal on Selected Areas in Communications, 2001, 19(5): 908-917.

[11] Fossorier M and Lin S. Soft decision decoding of linear block codes based on ordered statistics [J]. IEEE Transactions on Information Theory, 1995, 41(5): 1379-1396.

[12] Snyders J. Reduced lists of error patterns for maximum likelihood soft decoding [J]. IEEE Transactions on Information Theory, 1991, 37(7): 1194-1200.

[13] Snyders J and Be'ery Y. Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes [J]. IEEE Transactions on Information Theory, 1989, 35(5): 963-975.

[14] Lin Shu and Costello Daniel. Error Control Coding [M]. Englewood Cliffs, N J: Prentice-Hall, 2004: 395-422.

PDF