Application of efficient Chase algorithm in decoding of generalized low-density parity-check codes
Authors:
- 7 November 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 6 (9) , 385-387
Abstract
We consider the iterative decoding of generalized low-density (GLD) parity-check codes where, rather than employ an optimal subcode decoder, a Chase (1972) algorithm decoder more commonly associated with "turbo product codes" is used. GLD codes are low-density graph codes in which the constraint nodes are other than single parity-checks. For extended Hamming-based GLD codes, we use bit error rates derived by simulation to demonstrate this new strategy to be successful at higher code rates. For long block lengths, good performance close to capacity is possible with decoding costs reduced further since the Chase decoder employed is an efficient implementation.Keywords
This publication has 10 references indexed in Scilit:
- A low complexity FEC scheme based on the intersection of interleaved block codes2003
- Generalized low density (Tanner) codes2003
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Fast Chase algorithm with an application in turbo decodingIEEE Transactions on Communications, 2001
- On generalized low-density parity-check codes based on Hamming component codesIEEE Communications Letters, 1999
- Near-optimum decoding of product codes: block turbo codesIEEE Transactions on Communications, 1998
- Expander codesIEEE Transactions on Information Theory, 1996
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972
- Low-Density Parity-Check Codes1963