Microcomputer & its Applications

Research of modified IRA decoding algorithm based on offset approximation

Tian Zhang

Published Jan 1, 2009• 0 citations

Abstract

BP decoding algorithm is usually used to realize decoding of IRA codes,but the hardware circuit of BP decoding algorithm is complicated. A modified IRA decoding algorithm is proposed in order to have a good tradeoff between complexity and decoding performance. The proposed algorithm is approximate to BP decoding algorithm by the method of offset approximation ,which can simplify the complexity of BP decoding algorithm. The simulation results show that,compared with BP decoding algorithm,the modified IRA decoding algorithm can decrease algorithm complexity and keep good decoding performance. Compared with minimum-sum decoding algorithm,the complexity of modified IRA decoding algorithm is almost unchanged,but the decoding performance improves significantly.

Related papers

Improved algorithm of minimum-sum decoding algorithm for irregular repeat accumulate codes

XU Zong-ze

A simplified decoding algorithm for Irregular Repeat Accumulate(IRA) code is studied.BP decoding algorithm is difficult for hardware implementation of IRA code because of its high complexity.To reduce the decoding complexity,minimum-sum algorithm is applied to the IRA decoder.However,the decoding performance is degraded.To have a good tradeoff between decoding performance and complexities,improved algorithms,i.e.normalized algorithm and offset algorithm,are proposed.Simulation results showed that the improved algorithms have better performance than that of minimum-sum algorithm with little complexity increased.

Electronics Optics & ControlJan 1, 20070 citations

A Modified BP Decoding Algorithm of LDPC Codes

Zhan Yi

LLR BP decoding algorithm and its improved version Minimum-Sum decoding algorithm are usually used to realize the decoding of LDPC codes.But the calculation of LLR BP decoding algorithm is too complicated,and the performance of Minimum-Sum decoding algorithm is not good enough because of the approximation.A modified BP decoding algorithm is proposed by using some parameters in order to have a good tradeoff between complexity and decoding performance.The simulation results demonstrate that the modified algorithm keeps good decoding performance,and supplies a significant reduction of the complexity compared to LLR BP decoding algorithm and minimum-sum decoding algorithm.

Science Technology and EngineeringJan 1, 20130 citations

Research on LDPC Decoding Based on Modified Min-sum Algorithm

Mei Jin-jie

In order to make up for the performance defects of Min-sum decoding algorithm relative to LLR BP decoding algorithm and reduce implementation complexity of LLR-BP algorithm,a modified Min-sum decoding algorithm is proposed.When the check nodes process the message,parameters of the proposed algorithm are confirmed according to minimum mean square error rule,and the normalized BP-based decoding algorithm and the offset BP-based decoding algorithm are integrated effectively.At the same time,we introduce the correction factor and the offset factor into this algorithm reasonably.The simulation results show that decoding performance of modified Min-sum decoding algorithm is more effective than that of Min-sum decoding algorithm,normalized BP-based decoding algorithm and offset BP-based decoding algorithm under the same condition of bit error rate,and it approaches to the performance of LLR-BP decoding algorithm.

Radio and communications technologyJan 1, 20121 citation

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

Reduced Complexity Decoding Algorithms for Repeat Accumulate Codes

XU Zong-ze

Repeat-accumulate (RA) codes have a natural linear-time encoding algorithm. Under BP decoding algorithm, RA codes can be decoded reliably in linear time at rates arbitrarily closed to channel capacity.However,BP algorithm has high complexities.Minimum sum decoding algorithm is a sub-optimum algorithm and is easy for hardware implementation,but the decoding performance is degraded. Normalized algorithm and offset algorithm are proposed as a good tradeoff between decoding performance and complexities. Simulation results show that with little complexity increased, normalized algorithm and offset algorithm have better performance than that of minimum sum algorithm.

Journal of Sichuan UniversityJan 1, 20044 citations

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