一种基于缩减伴随式集的QC-LDPC码级联译码算法

董自健; 酆广增

doi:10.3724/SP.J.1146.2009.00388

一种基于缩减伴随式集的QC-LDPC码级联译码算法

doi: 10.3724/SP.J.1146.2009.00388

董自健^{①②;酆广增,},
酆广增

计量
- 文章访问数: 3341
- HTML全文浏览量: 110
- PDF下载量: 833
- 被引次数: 0
出版历程
- 收稿日期: 2009-03-23
- 修回日期: 2009-07-27
- 刊出日期: 2010-04-19

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

Dong Zi-jian^{①②;酆广增
,},
Feng Guang-zeng

摘要

摘要: 该文在研究缩减伴随式集译码(RLSD)算法和规则QC-LDPC码字结构的基础上，提出了一种新的针对中短QC-LDPC码的BP-RLSD级联译码算法。BP算法译码失败时的软输出对数信息，作为RLSD算法的输入。根据QC-LDPC码所具有的循环置换结构，给出一种根据伴随式的重量来确定候选错误模式搜索空间的算法，同时给出一种查表方法快速搜索出部分错误位置。结合接收序列的低可信度集合(LRIPs)，可以实现最大似然(ML)码字的快速搜索。这些方法可以大幅减少计算时间。仿真显示该文提出的算法是有效的。与BP算法的级联译码，可以在计算复杂度和性能之间进行较好的折衷。
- QC-LDPC码; 缩减伴随式集译码(RLSD); 低可信度集合(LRIPs); 最大似然译码(MLD)
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.

HTML全文

参考文献(1)

Wang Z and Cui Z. A memory efficient partially paralleldecoder architecture for quasi-cyclic LDPC codes [J].IEEETransactions on Very Large Scale Integration (VLSI) Systems.2007, 15(4):483-488[2]Darabiha A and Carusone A C, et al.. Block-interlaced LDPCdecoders with reduced interconnect complexity [J].IEEETransactions 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 themagnetic recording channel: Code design and VLSIimplementation [J].IEEE Transactions on Magnetics.2007,43(3):1118-1123[4][4] ETSI EN 302 307. Second generation framing structure,channel coding and modulation system for broadcasting,interactive services, news gathering and other broadbandsatellite applications [S], 2004, 1.[5]Fossorier M P C. Quasi-cyclic low-density parity-check codesfrom circulant permutation matrices [J].IEEE Transactionson Information Theory.2004, 50(8):1788-1793[6]Kiran K G and Gwan S C, et al.. A parallel VLSI architecturefor layered decoding for array LDPC codes [C]. 20thInternational Conference on VLSI Design, Bangalore, India,2007: 738-743.[7]Daesun O and Parhi K K. Efficient highly-parallel decoderarchitecture 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 graphsand the sum-product algorithm [J].IEEE Transactions onInformation Theory.2001, 47(2):498-519[9]Fossorier M and Valembois A. Reliability-based decoding ofReed-Solomon codes using their binary image [J]. IEEECommunication Letters, 2004, 8(7): 452-454.[10]Fossorier M P C. Iterative reliability-based decoding oflow-density parity check codes [J].IEEE Journal on SelectedAreas in Communications.2001, 19(5):908-917[11]Fossorier M and Lin S. Soft decision decoding of linear blockcodes based on ordered statistics [J].IEEE Transactions onInformation Theory.1995, 41(5):1379-1396[12]Snyders J. Reduced lists of error patterns for maximumlikelihood soft decoding [J].IEEE Transactions onInformation Theory.1991, 37(7):1194-1200[13]Snyders J and Be'ery Y. Maximum likelihood soft decoding ofbinary 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.

施引文献

资源附件(0)

访问统计