Journal of Chongqing University of Posts and Telecommunications

An improved BP-based concatenation algorithm of short LDPC codes

Feng Guang-zeng

Published Jan 1, 2010• 0 citations

Abstract

This paper analyses the ordered statistic decoding(OSD) algorithm of short LDPC codes and investigates BP-OSD concatenation algorithm and LLR accumulation algorithm.Considering the tradeoff between the complexity and performance of decoding,the min-sum algorithm was used instead of the BP algorithm,and it was concatenated with LLR accumulation algorithm.Simulation results show that compared with the original BP algorithm,the performance of the improved concatenation algorithm has been greatly raised,and compared with the BP-OSD concatenation algorithm,its decoding complexity has been reduced and the performance is nearly the same.

Related papers

Parallel complementary decoding based on OSD and Chase

Zijian Dong

Ordered Statistic Decoding(OSD) algorithm and Chase algorithm are investigated in this paper,based on which,a new Chase-OSD parallel decoding algorithm for medium and short lengths Low Density Parity-Check(LDPC) codes is proposed.Chasetype decoding algorithm is based on processing certain LRPs of a received sequence,while OSD algorithm is based on processing certain MRIPs of a received sequence.If there are too many errors in MRIPs,the OSD algorithm will fail,while there are too much errors in LRPs,the Chase-type algorithm will fail.A parallel concatenation decoding algorithm is proposed based on that complementary characteristic.The simulation results show that the proposed algorithm is effective.The decoding performance is improved compared with BP-OSD and BP-Chase algorithm.

Computer Engineering and Applications JournalJan 1, 20090 citations

Reliability-Based Iterative Decoding of LDPC Codes Using Likelihood Accumulation

Ming Yan Jiang, Chunming Zhao, Enyang Xu +1 more

In this work, we present an improvement on low complexity serial concatenation of belief propagation (BP) - order statistic decoding (OSD) algorithm for low-density parity-check (LDPC) codes. We introduce a more reliable method to reconstruct ordered information sequence in terms of the accumulated log-likelihood ratio (LLR) transitions of variable nodes. We give a general expression for both the existing BP-OSD algorithm and our proposed new method according to a structure similar to an infinite impulse response (IIR) filter. This improved algorithm achieves noticeable performance gains with only modest increase in computation complexity.

IEEE Communications LettersAug 1, 200738 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

Concatenation decoding algorithm based on BP and WED

PI De-fu

Weighted Erasure Decoding(WED) algorithm is investigated in this paper,based on which,a new BP-WED concatenation algorithm for LDPC codes is proposed.Belief Propagation(BP) algorithm is a kind of soft-in-soft-out algorithm.When BP algorithm fails,the soft LLR reliable information is quantized and sent to the WED algorithm.WED algorithm is a very attractive solution for practical implementations of low-complexity reliability-based algorithms owing to its simplicity,therefore the BP-WED concatenation algorithm is more easy in hardware implementation compared to other concatenation algorithms,such as BP-OSD,BP-BMA,etc.The simulation results show that the proposed concatenation algorithm is effective,and can achieve a good tradeoff between computational complexity and decoding performance.

Computer Engineering and Applications JournalJan 1, 20100 citations

Reliability-based iterative decoding of LDPC codes using segmented accumulation of likelihood ratio

Dong Zi-jian

In this work, we present an improvement on the belief propagation (BP) algorithm concatenated serially with order statistic decoding (OSD) for low-density parity-check (LDPC) codes. We use the segmented accumulation of log-likelihood ratio (LLR) of variance nodes as the ordered information metric to reconstruct received sequence. This method can reduce the sensitivity of accumulated parameter selection to the fluctuation of performance, and further improve decoding performance.

International Conference on Advanced Computer Theory and EngineeringAug 1, 20101 citation

Reliability-based syndrome decoding of LDPC codes

Guangwen Li, Guangzeng Feng

Aiming at bridge gap between maximum likelihood decoding (MLD) and belief propagation (BP) decoding for short or medium LDPC codes, we present one modified ordered statistics decoding (OSD) reprocessing method, which is serially concatenated with standard BP. Meanwhile, two novel points in implementation are addressed. For one thing, the new definition of bit reliability proposed enhances error-correcting performance via centralizing more decoding errors of standard BP within the scope of order-p OSD where p ≤ 2. For another, one way of reducing computational complexity is put forward in selecting optimal error pattern among all candidates. Simulation results demonstrate our approach could achieve good tradeoff between reprocessing performance and computational complexity. Techniques on further improvement are also discussed briefly. Reliability-based syndrome decoding of LDPC codes 1 I.

Jan 1, 20070 citations