Loading [MathJax]/extensions/TeX/mhchem.js
Two decoding algorithms for low-density parity-check codes | IEEE Conference Publication | IEEE Xplore

Two decoding algorithms for low-density parity-check codes

Publisher: IEEE

Abstract:

In this paper, a low complexity algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an exte...View more

Abstract:

In this paper, a low complexity algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performance at smaller complexity.
Date of Conference: 16-20 May 2005
Date Added to IEEE Xplore: 15 August 2005
Print ISBN:0-7803-8938-7

ISSN Information:

Publisher: IEEE
Conference Location: Seoul, Korea (South)

References

References is not available for this document.