2008HAL (Le Centre pour la Communication Scientifique Directe)Open access

Optimizing the Error Recovery Capabilities of LDPC-Staircase Codes Featuring a Gaussian Elimination Decoding Scheme: Preliminary Results

Mathieu Cunche, Vincent Roca

Open full text 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Low-density parity-check code, Decoding methods, Concatenated error correction code, Ideal (ethics), Erasure, Algorithm, Mathematics, Serial concatenated convolutional codes

Related papers

Back to paper searchBrowse research topicsOriginal source
Optimizing the Error Recovery Capabilities of LDPC-Staircase Codes Featuring a Gaussian Elimination Decoding Scheme: Preliminary Results — Research Paper | ScholarLens