Dianzi Ke-ji Daxue xuebao

Modified Decoding Algorithm of LDPC Codes

Xucan Chen

Published Jan 1, 2010• 3 citations

Abstract

The simple algorithms based on belief propagation algorithm of LDPC codes are studied.A modified algorithm which integrates Row Message Passing schedule with Offset Min-Sum algorithm for decoding LDPC codes is proposed.The proposed algorithm facilitates hardware implementation because it improves the convergence property while its computation complexity is the same as Offset Min-Sum algorithm,and it reduces the storage for the optimized memory method.The simulation results demonstrate that the proposed algorithm reduces the average iterations and quantization implementation memory.

Related papers

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

Research on LDPC Codes Decoding Algorithm for High Data Rate Transmission

Lei Guang-xiong

This paper analyzes the complexity and capability of different decoding algorithms for LDPC code based on in-depth study of the theory of decoding algorithms.An improved min-sum decoding algorithm is proposed.The simulation results demonstrate that the proposed algorithm reduces the computation complexity,decreases the average iterations and improves the convergence property.Therefore,this modified decoding algorithm is highly valuable for hardware implementation.

Radio EngineeringJan 1, 20110 citations

Research on Modified LBP Decoding Algorithm of LDPC Codes

Liu Mingsha

To solve the problem of high complexity and difficult implementation in hardware of LBP( Layered Belief-Propagation) algorithm. A modified decoding algorithm is proposed based on LBP algorithm,a function f( x) is introduced in the first step in order to reduce its complexity. Specific parameters correction factor and offset factor are introduced in the second step in order to improve its decoding performance. The simulation results demonstrate that the modified decoding algorithm reduces the complexity and improves the decoding performance compared to LBP algorithm which facilitates the hardware.

Journal of Jilin UniversityJan 1, 20150 citations

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

Zhong Zhou, Yunzhou Li, Xiang Chen +2 more

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.

International Conference on Communications and Networking in China (ChinaCom)Aug 1, 20089 citations

Single-Step Adaptive Offset Min-Sum Algorithm for Decoding LDPC Codes

Xiaoju Lin, Gansuren Baasantseren, Hae-Kee Lee +1 more

Low-density parity-check (LDPC) codes with belief-propagation (BP) algorithm achieve a remarkable performance close to the Shannon limit at reasonable decoding complexity. Conventionally, each iteration in decoding process contains two steps, the horizontal step and the vertical step. In this paper, an efficient implementation of the adaptive offset min-sum (AOMS) algorithm for decoding LDPC codes using the single-step method is proposed. Furthermore, the performances of the AOMS algorithm compared with belief-propagation (BP) algorithm are investigated. The algorithms using the single-step method reduce the implementation complexity, speed up the decoding process and have better efficiency in terms of memory requirements.

The Transactions of The Korean Institute of Electrical EngineersJan 1, 20100 citations

Fast convergence algorithm for decoding of low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1

WSEAS TRANSACTIONS on COMMUNICATIONS archiveJul 1, 20091 citation