DocumentCode
3280630
Title
Improvement of the forced-convergence decoding for LDPC codes
Author
Aoyama, Rumi ; Kaji, Yuichi
Author_Institution
Grad. Sch. of Inf. Sci., Nara Inst. of Sci. & Technol., Ikoma
fYear
2008
fDate
7-10 Dec. 2008
Firstpage
1
Lastpage
6
Abstract
An improvement of the forced-convergence decoding algorithm is discussed. Iterative decoding schemes such as the sum-product (SP) decoding bring out excellent performance of low-density parity check (LDPC) codes. The forced-convergence (FC) decoding is also an iterative decoding algorithm obtained by modifying the SP decoding. The FC decoding succeeds to reduce the decoding complexity of the SP decoding, but the error correcting performance is severely degraded by the modification. The performance degradation of the FC decoding is expected to be mitigated if the convergence criterion used in the algorithm is appropriately modified. This paper discusses several types of modifications of the convergence criteria. Computer simulation shows that the proposed modifications improve the performance of the FC decoding algorithm.
Keywords
convergence; error correction codes; iterative decoding; parity check codes; product codes; LDPC codes; error correcting performance; forced-convergence decoding algorithm; iterative decoding scheme; low-density parity check codes; sum-product decoding; Computer errors; Computer simulation; Convergence; Degradation; Error correction; Information science; Information theory; Iterative algorithms; Iterative decoding; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location
Auckland
Print_ISBN
978-1-4244-2068-1
Electronic_ISBN
978-1-4244-2069-8
Type
conf
DOI
10.1109/ISITA.2008.4895536
Filename
4895536
Link To Document