Good coupling between LDPC-staircase and Reed-Solomon for the design of GLDPC codes for the erasure channel

Mattoussi, Ferdaouss; Sayadi, Bessem; Roca, Vincent

doi:10.1109/wcnc.2013.6554790

Cited by 3 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From a decoding perspective, we propose a new hybrid (IT/RS/ML) decoding approach that achieves the optimal correction capabilities of ML decoding at a lower complexity [14]. Finally, in order to analyze their performance, we detail in [15] an asymptotic analysis method based on the density evolution (DE) and extrinsic information transfer (EXIT) tools and the area theorem. Then, using this theoretical analysis combined with a finite length analysis, we discuss the impacts of the code structure and its internal parameters on performance.…”

Section: Reviewmentioning

confidence: 99%

GLDPC-Staircase AL-FEC codes: a fundamental study and new results

Mattoussi

Roca

Sayadi³

2016

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

This paper provides fundamentals in the design and analysis of Generalized Low-Density Parity Check (GLDPC)-Staircase codes over the erasure channel. These codes are constructed by extending an LDPC-Staircase code (base code) using Reed-Solomon (RS) codes (outer codes) in order to benefit from more powerful decoders. The GLDPC-Staircase coding scheme adds, in addition to the LDPC-Staircase repair symbols, extra-repair symbols that can be produced on demand and in large quantities, which provides small rate capabilities. Therefore, these codes are extremely flexible as they can be tuned to behave either like predefined rate LDPC-Staircase codes at one extreme, or like a single RS code at another extreme, or like small rate codes. Concerning the code design, we show that RS codes with "quasi" Hankel matrix-based construction fulfill the desired structure properties, and that a hybrid (IT/RS/ML) decoding is feasible that achieves maximum likelihood (ML) correction capabilities at a lower complexity. Concerning performance analysis, we detail an asymptotic analysis method based on density evolution (DE), extrinsic information transfer (EXIT), and the area theorem. Based on several asymptotic and finite length results, after selecting the optimal internal parameters, we demonstrate that GLDPC-Staircase codes feature excellent erasure recovery capabilities, close to that of ideal codes, both with large and very small objects. From this point of view, they outperform LDPC-Staircase and Raptor codes and achieve correction capabilities close to those of RaptorQ codes. Therefore, all these results make GLDPC-Staircase codes a universal Application-Layer FEC (AL-FEC) solution for many situations that require erasure protection such as media streaming or file multicast transmission.

show abstract

Section: Reviewmentioning

confidence: 99%

GLDPC-Staircase AL-FEC codes: a fundamental study and new results

Mattoussi

Roca

Sayadi³

2016

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

Impacts of the packet scheduling on the performance of erasure codes: Methodology and application to GLDPC-Staircase codes

Mattoussi

Roca

Sayadi³

2015

2015 European Conference on Networks and Communications (EuCNC)

Self Cite

View full text Add to dashboard Cite

Content broadcasting over wireless networks heavily relies on Application-Level FEC codes to improve transmission robustness in front of channel erasures. Because they operate in the higher layers of the protocol stack, they benefit from a lot of flexibility. In particular, since streaming applications and bulk transfer applications have different constraints, different packet scheduling strategies may be used by the sender, offering different trade-offs between decoding latency and long erasure burst protection. This work tries to find the best packet scheduling scheme(s) at a sender for a given type of AL-FEC codes.The contributions are twofold: first we define a methodology to measure the impacts of packet scheduling on AL-FEC performance, both under ITerative (IT) and Maximum Likelihood (ML) decoding, for a large set of channels; then we apply this methodology to GLDPC-Staircase codes, an extension of LDPC-Staircase codes using Reed Solomon codes as inner codes. In previous works we showed that these codes have erasure recovery performance close to ideals codes when packets are transmitted in a random order. In this work we show that these codes perform extremely well when sending source packets sequentially first (a key requirement to keep latency minimum with streaming applications) and then extra-repair packets followed by LDPC repair packets, both in a random order. 1

show abstract

Hybrid hamming GLDPC codes over the binary erasure channel

Guan

Zhang

2017

2017 11th IEEE International Conference on Anti-Counterfeiting, Security, and Identification (ASID)

View full text Add to dashboard Cite

Good coupling between LDPC-staircase and Reed-Solomon for the design of GLDPC codes for the erasure channel

Cited by 3 publications

References 21 publications

GLDPC-Staircase AL-FEC codes: a fundamental study and new results

GLDPC-Staircase AL-FEC codes: a fundamental study and new results

Impacts of the packet scheduling on the performance of erasure codes: Methodology and application to GLDPC-Staircase codes

Hybrid hamming GLDPC codes over the binary erasure channel

Contact Info

Product

Resources

About