Journal of Tsinghua University(Science and Technology)

Error floor properties of low-density parity-check codes using iterative decoding algorithms

Jianhua Lü

Published Jan 1, 2009• 0 citations

Abstract

Error floor properties of low-density parity-check(LDPC)codes using different decoding algorithms were statistically analyzed utilizing test data from a hardware evaluation platform.The analysis shows that the number of residual error bits in an error codeword after decoding failure using the sum-product(SP)algorithm or the modified min-sum(MMS)algorithm is usually quite small;therefore,LDPC codes can serve as the inner code in a concatenated coding system to achieve an ultra low bit error rate.The analysis also shows that SP algorithm is more suitable for a concatenated coding system than MMS algorithm since less residual error bits occur when using the SP algorithm.Concatenated codes based on the analysis achieve bit error rates lower than 10-10 with a low decoding threshold.

Related papers

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels

Chun-Hao Hsu, Achilleas Anastasopoulos

The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode of the tree code assuming the transmission of the all-zero codeword. The result is a recursive upper bound on the bit error probability after each iteration. For SP decoding, we derive a recursively determined lower bound on the bit error probability after each iteration. This recursive lower bound recovers the density evolution equation of LDPC codes on the binary erasure channel (BEC) with inequalities satisfied with equalities. A significant implication of this result is that the performance of LDPC codes under SP decoding on the BEC is an upper bound of the performance on all MBIOS channels with the same uncoded bit error probability. All results hold for the more general multi-edge type LDPC codes.

arXiv:cs/0607020Jul 6, 20061 citation

Improved decoding algorithm for irregular low-density parity-check codes and its implementation with DSP

Jianhua Lü

An improved decoding algorithm,which aims to reduce the decoding complexity of irregular low-density parity-check(LDPC) codes,is presented for implementation with digital signal processors(DSPs) with reduced computation complexity and low error floor.The algorithm uses the modified min-sum(MMS) algorithm for check node processing with the extrinsic information updated sequentially, so that it exhibits a low decoding threshold with a limited number of iterations,while reducing the node processing complexity and error floor.Tests with a fixed-point DSP show that the algorithm achieves a low error floor and low decoding threshold with low implementation complexity.

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

Design and Implementation of Low Bit Error Rate of LDPC Decoder

Ashlesha P. Kshirsagar, Sandeep Kakde, Manish Devendra Chawhan +1 more

Many classes of high-performance Low-density parity check codes are based on parity check matrices composed of permutation sub matrices. The emulation-simulation framework further allows the algorithm and implementation to be iteratively redefined to improve the error floor performance of message passing decoder. Log-Like hood-Ratio (LLR) based Belief-Propagation (BP) algorithm is presented for Low Density Parity Check codes. Numerically accurate representation of check node update computation used in LLR-BP decoding is described. The implementation of Sum-Product algorithm (SPA) within Low Density Parity Check Code (LDPC) decoder is described in this paper and the correction term is used to improve the decoding performance of min-sum algorithm (MSA). Quantization and log-tanh function approximation in sum-product decoder strongly affect which absorbing set dominates in error floor region. For LDPC decoder, bit error rate (BER) decreases with increase in the signal to noise ratio.

International Conference on Communication Systems and Network TechnologiesApr 1, 20151 citation

Enhancing Error Correction through Concatenated Low-Density Parity-Check and Array Coding Schemes

Sofia Jensen, Ali Raza, Amirahmadi Kiani +1 more

—Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-errorratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to lower the error floors of LDPC code. The outer code in the proposed concatenation is the LDPC, and the inner code is a high rate array code. This approach applies an interactive hybrid process between the BCJR decoding for the array code and the SPA for the LDPC code together with bit-pinning and bit-flipping techniques. Margulis code of size (2640, 1320) has been used for the simulation and it has been shown that the proposed concatenation and decoding scheme can considerably improve the error floor performance with minimal rate loss

Jun 24, 20200 citations

Enhancing Error Correction through Concatenated Low-Density Parity-Check and Array Coding Schemes

Sofia Jensen, Ali Raza, Amirahmadi Kiani +1 more

Oct 5, 20200 citations

Düşük yoğunluklu eşlik denetim kodları için kod çözme algoritmalarının karşılaştırılması.

Kolaylı, Mert

Low-density parity-check (LDPC) codes are a subclass of linear block codes. These codes have parity-check matrices in which the ratio of the non-zero elements to all elements is low. This property is exploited in defining low complexity decoding algorithms. Low-density parity-check codes have good distance properties and error correction capability near Shannon limits. In this thesis, the sum-product and the bit-flip decoding algorithms for low-density parity-check codes are implemented on Intel Pentium M 1,86 GHz processor using the software called MATLAB. Simulations for the two decoding algorithms are made over additive white gaussian noise (AWGN) channel changing the code parameters like the information rate, the blocklength of the code and the column weight of the parity-check matrix. Performance comparison of the two decoding algorithms are made according to these simulation results. As expected, the sum-product algorithm, which is based on soft-decision decoding, outperforms the bit-flip algorithm, which depends on hard-decision decoding. Our simulations show that the performance of LDPC codes improves with increasing blocklength and number of iterations for both decoding algorithms. Since the sum-product algorithm has lower error-floor characteristics, increasing the number of iterations is more effective for the sum-product decoder compared to the bit-flip decoder. By having better BER performance for lower information rates, the bit-flip algorithm performs according to the expectations; however, the performance of the sum-product decoder deteriorates for information rates below 0.5 instead of improving. By irregular construction of LDPC codes, a performance improvement is observed especially for low SNR values.

Jan 1, 20060 citations