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

Mathieu Cunche 1 Vincent Roca 1
1 PLANETE - Protocols and applications for the Internet
Inria Grenoble - Rhône-Alpes, CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.inria.fr/inria-00271430
Contributor : Mathieu Cunche <>
Submitted on : Wednesday, April 9, 2008 - 9:59:24 AM
Last modification on : Wednesday, April 11, 2018 - 1:51:36 AM
Long-term archiving on : Thursday, May 20, 2010 - 11:09:08 PM

File

ldpc_gauss_and_left_degree.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00271430, version 1

Collections

Citation

Mathieu Cunche, Vincent Roca. Optimizing the Error Recovery Capabilities of LDPC-Staircase Codes Featuring a Gaussian Elimination Decoding Scheme: Preliminary Results. 2008. ⟨inria-00271430⟩

Share

Metrics

Record views

250

Files downloads

126