Optimizing the Error Recovery Capabilities of LDPC-Staircase Codes Featuring a Gaussian Elimination Decoding Scheme: Preliminary Results
Mathieu Cunche, Vincent Roca
Abstract
Mathieu Cunche, Vincent Roca
Abstract
The erasure recovery capabilities of LDPC-Triangle and LDPC-Staircase codes can be greatly improved by means of a Gaussian elimination decoding scheme . Thanks to this decoding, the LDPC-Triangle codes are now very close to an ideal code. The LDPC-Staircase codes are also improved but they are not as close to an ideal code as the LDPC-Triangle codes are. Furthermore, for some code rates, the performances of the LDPC-Staircase codes diverge from their asymptotic behavior. This document studies the influence of the N1 parameter of the LDPC-Staircase codes, i.e., the target number of '1s' per column, which in turn controls the left degree of source symbols, on the erasure recovery capabilities of the codes when a Gaussian elimination decoding scheme is used.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The erasure recovery capabilities of LDPC-Triangle and LDPC-Staircase codes can be greatly improved by means of a Gaussian elimination decoding scheme . Thanks to this decoding, the LDPC-Triangle codes are now very close to an ideal code. The LDPC-Staircase codes are also improved but they are not as close to an ideal code as the LDPC-Triangle codes are. Furthermore, for some code rates, the performances of the LDPC-Staircase codes diverge from their asymptotic behavior. This document studies the influence of the N1 parameter of the LDPC-Staircase codes, i.e., the target number of '1s' per column, which in turn controls the left degree of source symbols, on the erasure recovery capabilities of the codes when a Gaussian elimination decoding scheme is used.
Key concepts: Low-density parity-check code, Decoding methods, Concatenated error correction code, Ideal (ethics), Erasure, Algorithm, Mathematics, Serial concatenated convolutional codes