International Conference on Communications and Networking in China (ChinaCom)

Modified min-sum decoding algorithm for LDPC codes based on classified correction

Zhong Zhou, Yunzhou Li, Xiang Chen, Hanying Hu, Jing Wang

Published Aug 1, 2008• 9 citations

Abstract

In this paper, a modified min-sum decoding algorithm based on classified correction is proposed for low density parity check (LDPC) codes. Different from the single correction in the normalized belief propagation (BP)-based and offset BP-based algorithms [4], the proposed algorithm utilizes two corrections for both minimum and sub-minimum magnitudes of input messages in check nodes. These two correction factors can be obtained by analyzing the offset of updated messages in check nodes between the BP and the min-sum algorithms associated with check node degree. Simulation results show that the proposed algorithm can achieve performance very close to that of the BP algorithm. Furthermore, the FPGA implementation of this algorithm can reach a throughput of 200 Mbps at BER=10-6with lower complexity and fewer resources than the BP algorithm.

DOI: 10.1109/chinacom.2008.4685176

Related papers

Check node degree-based modified min-sum decoding algorithm with classification for LDPC codes

Jing Wang

A check node degree-based modified min-sum algorithm which classifies the codes was developed to reduce the complexity and improve the performance of decoding algorithm for low-density parity-check(LDPC) codes.The algorithm corrects both the minimum and sub-minimum absolute values of incoming messages in the check nodes.Two correction factors are obtained by calculating the offset between the belief propagation(BP) algorithm and the min-sum algorithm based on the check node degree.Simulations show that the algorithm achieves better performance than the BP algorithm at high signal noise ratio.The algorithm is also less complex than the BP algorithm and provides a good tradeoff between performance and complexity for any check node degree distribution in the LDPC codes.

Journal of Tsinghua University(Science and Technology)Jan 1, 20090 citations

A modified Min-Sum algorithm for low-density parity-check codes

Wei Han, Jianguo Huang, WU Fang-fei

A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.

Wireless Communications, Networking and Information SecurityJun 1, 20109 citations

A modified Offset Min-Sum decoding algorithm for LDPC codes

Meng Xu, Jianhui Wu, Meng Zhang

In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure, which can minimize the decoding degradation compared with the Belief Propagation decoding algorithm. The simulation results show that, compared with the original Offset Min-Sum decoding algorithm, our modified algorithm can achieve noticeable performance improvement with minor extra hardware complexity. For example, when BER is 10−5, our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset Min-Sum algorithm for regular and irregular LDPC codes respectively.

Jul 1, 201029 citations

A Classified Normalized BP-Based Algorithm with 2-Dimensional Correction for LDPC Codes

Zhou Zhong, Shuming Guo, Xiangyang Xu +1 more

A BP-based algorithm with 2-dimensional classified normalized correction is developed to reduce the complexity and improve the performance of decoding algorithm for the low density parity check (LDPC) codes. The algorithm first utilizes classification according to the absolute values of incoming messages in check nodes. Then it uses 2-dimensional normalization to correct the minimum and sub-minimum values. The 2-dimensional normalized factors can be calculated respectively by using probability and statistic theory in the initialization step. Simulation results illustrate that the proposed algorithm achieves better performance in bit error ratio (BER) and average iteration number than normalized BP-based algorithm in the high signal noise ratio (SNR) region, i.e., it can achieve 0.4 dB SNR gain and reduce 20% number of iterations at BER= 5 10  , whose complexity is also much less than that of belief propagation (BP) algorithm. It is concluded that the proposed algorithm offers better tradeoff between performance and complexity.  Index Terms—channel coding theory, density evolution, Iterative decoding algorithm

Journal of CommunicationsJan 1, 20135 citations

Differential Decoding of Low-Density Parity-Check Codes Based on Min Sum Algorithm

Shizhang Peng, Zemao Zhao, Jianrong Bao

To improve performance and reduce computation complexity of the low-density parity-check (LDPC) codes, a min-sum based differential decoding algorithm is proposed. The main principle is that the messages passing in the bipartite graph of the codes are the probability differences and the updates of the check nodes adopt min sum algorithm. Simulation results show that the proposed algorithm can achieve about 0.4dB performance gain over the UMP BP-Based decoding algorithm at bit error rate (BER) of under an additive white Gaussian noise (AWGN) channel. And it can obtain good performance very close to that of the BP decoding algorithm with much lower complexity.

International Symposium on Information Science and EngineeringDec 1, 20102 citations

A Modified Normalized Min - Sum Decoding Algorithm for Irregular LDPC Codes

Michaelraj Kingston Roberts, Ramesh Jayabalan

In this paper, a modified normalized Min-Sum algorithm (MNMSA) is proposed for decoding irregular Low Density Parity Check Codes (LDPC) with non-uniform degree distribution. The proposed algorithm provides an efficient decoding scheme to enhance the error performance of an irregular LDPC code without increasing the hardware complexity. An efficient 6- bit quantization scheme is utilized in the proposed algorithm with optimally combined normalization and down scaling factors to resolve the magnitude overestimation issue which occurs during iterative message passing process between the nodes. The simulation results demonstrate that the proposed algorithm achieves good decoding performance in terms of Frame Error Rate (FER) and Bit Error Rate (BER) without the requirement of complex arithmetic calculations. Compared to other min- sum based decoding algorithms the decoding process of the proposed MNMSA requires only fewer decoding iterations over wide range of signal- to- noise ratio (SNR) to achieve comparable decoding performance to that of Belief Propagation (BP) algorithm without increasing the hardware complexity.

Jan 1, 20143 citations