|
|
|
| Concatenation Decoding Algorithm for QC-LDPC Codes Based on the Reduced List Syndromes |
| Dong Zi-jian①②; Feng Guang-zeng① |
| ①College of Telecommunications & Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China; ②School of Electronic Engineering, Huaihai Institute of Technology, Lianyungang 222005, China |
|
|
|
|
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.
|
|
Received: 23 March 2009
|
|
|
|
Corresponding Authors:
Dong Zi-jian
|
|
|
|
|
|
|
2010, Vol. 32 
