Regular {4, 8} LDPC Codes and Their Lowerror Floors
Authors:
- 1 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-7
Abstract
Regular LDPC codes are a special class of low-density codes having an equal number of ones in each row and column of the parity check matrix describing the linear code. The uniform structure of regular LDPC codes allows a practical hardware implementation which can efficiently utilize the inherent parallelism of the message passing algorithm (MPA) commonly used to decode low-density codes. The class of {3,6} LDPC codes has been extensively studied and they have been proven to provide very good error performance, especially at lower SNR. {4,8} codes have not been analyzed nearly as much in the literature, mainly because their 'threshold,' the SNR where the waterfall region of the error performance curve begins, is typically a quarter of a dB or so worse than for comparable-length {3,6} codes. It has been proposed that {4,8} codes have better high SNR behavior, but until recently it was not possible to verify this conjecture. A new technique which can efficiently find error floors of LDPC codes now has the ability to illuminate just how good {4,8} codes are in the high SNR region-a result which is of great interest for many practical applications. This paper will analyze the error floor characteristics of some {4,8} codes and provide a simple algorithm for designing {4,8} codes with low error floors. A newly-designed rate-1/2 (1200,600) {4,8} code with a vastly superior error floor compared to codes of similar parameters is introducedKeywords
This publication has 9 references indexed in Scilit:
- Improved Upper Bounds on Stopping RedundancyIEEE Transactions on Information Theory, 2006
- Analysis and Design of Moderate Length Regular LDPC Codes with Low Error Floors2006
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 12002
- Progressive edge-growth Tanner graphs2002
- Designing LDPC codes using bit-filling2002
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Quick simulation: a review of importance sampling techniques in communications systemsIEEE Journal on Selected Areas in Communications, 1997
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Low-Density Parity-Check Codes1963