Video Engineering

Mixed Iteration Algorithm of LDPC Codes

Lin Cheng

Published Jan 1, 2012• 0 citations

Abstract

A mixed iterative decoding algorithm is proposed based on RRWBF algorithm and UMP BP-Based algorithm of LDPC code.This algorithm makes full use of the hard decision algorithm complexity low and soft judgment algorithm performance good advantage,the BER performance is realized,no drop in the premise,decode complexity is decreased obviously effect and the propagation delay is decreased.Simulation results show that,after carefully designed different iterations,mixed iteration algorithm than UMP BP-Based algorithm,decode complexity decrease the 30%.

Related papers

Modified UMP BP-Based decoding algorithm of LDPC codes with low complexity

Hua Qu

In order to make up for the performance defects of UMP BP-Based decoding algorithm relative to LLR BP decoding algorithm,this paper proposed a modified decoding algorithm.Parameters of the proposed algorithm which combined the advantage of Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm were calculated according to minimum mean square error rule.The simulation results show that the LDPC decoding performance of modified UMP BP-Based decoding algorithm is more effective than that of UMP BP-Based decoding algorithm,Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm under the same condition of bit error rate.

Jisuanji yingyong yanjiuJan 1, 20090 citations

Revised Hard-decision Decoding of LDPC Codes

Hongwei Li

Bit-flipping decoding algorithm and its improved version weighted bit-flipping decoding algorithm are usually used to realize the hard-decision decoding of LDPC codes.But the performance of BF decoding algorithm is not good enough,and WBF decoding algorithm is complicated.A revised hard-decision decoding of LDPC codes to have a good tradeoff between complexity and decoding performance is introduced in this paper.The algorithm can make multiple bits flip in the first two iteration.The simulation results demonstrate the revised algorithm supplies a slightly inferior BER performance,but a significant reduction of the complexity.

Video EngineeringJan 1, 20130 citations

Research on LDPC decoding based on modified UMP BP-Based algorithm

Tian Zhang

In order to make up for the performance defects of UMP BP-Based decoding algorithm relative to LLR BP decoding algorithm, a modified UMP BP-Based decoding algorithm is proposed. Parameters of the proposed algorithm are confirmed according to minimum mean square error rule and it has the generality for decoding of all LDPC codes. The simulation results show that the LDPC decoding performance of modified UMP BP-Based decoding algorithm is more effective than that of UMP BP-Based decoding algorithm, Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm under the same condition of bit error rate.

Microcomputer & its ApplicationsJan 1, 20100 citations

Study on Decoding Algorithm for LDPC Codes under AWGN Channel

Yong Wang

Under the condition of the Additive White Gaussian Noise(AWGN) channel,both the hard and soft decision decoding algorithms suitable for LDPC codes are simulated and comparatively analyzed based on analyzing the decoding algorithm for LDPC codes.The variable message correlation for Log-Likelihood-Ratio Belief-Propagation(LLR-BP) algorithm in soft decision algorithm is decreased by introducing a multiplicative correction factor.The simulation results show that the decoding error-correction performance of the modified LLR-BP algorithm is greatly improved with little increase of computing complexity.

Bandaoti guangdianJan 1, 20130 citations

Research of LDPC Decoding Based on Modified LLR BP Algorithm

Hua Qu

The Tanner graph of long LDPC codes usually has no loops and LLR BP algorithm is the best soft-decision decoding algorithm.But the Tanner graph of short LDPC codes usually has loops,so information within variable nodes doesn't satisfy the condition of independent identical distribution and the decoding performance of LLR BP algorithm will decrease.In this paper,a modified LLR BP algorithm is proposed,which can reduce the relativity of information within variable nodes by adjusting the iterative process of variable nodes information.Simulation results show that the LDPC decoding performance of the modified LLR BP algorithm is more effective than that of LLR BP algorithm,Normalized BP algorithm and offset BP algorithm.

Journal of Southwest UniversityJan 1, 20093 citations

Study on blind decoding algorithm for LDPC codes based on Soft-Input Soft-Output

Wang Li-xin

To deal with the complexity of traditional BP decoding algorithm,a kind of blind decoding algorithm for LDPC codes based on soft-input,soft-output is put forward in this paper.The algorithm uses soft squared Euclidean distance as the metric,realizes decoding by iterating the antilog-sum of the Euclidean distance as the process taken in BP algorithm.The proposed algorithm does not require knowledge of the signal-to-noise ratio of the received signal,and is less complex to implement than other soft decision algorithms.At the same time,a simplified algorithm is also put forward to reduce the computational complexity.What's more,the proposed SBSD decoding algorithm can not only decode Binary LDPC codes,but also can be used for Qary-LDPC codes.Simulations results show that the proposed algorithm can achieve good performance not only on the AWGN channels but also on Rayleigh channel,and the performance is very close to that of the sum-product algorithm,but the computational complexity is reduced sharply.

Journal of Circuits and SystemsJan 1, 20120 citations