Iterative decoding of product codes over binary erasure channel

Iterative decoding of product codes over binary erasure channel

Iterative decoding of product codes over the binary erasure channel is investigated. It is shown that belief propagation decoding combined with cyclic permutations yields near-capacity performance with low complexity for high-code-rate product codes constructed from two cyclic component codes.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics letters 2010-04, Vol.46 (7), p.503-505
Hauptverfasser: Changuel, S., Le Bidan, R., Pyndiah, R.
Format: Artikel
Sprache:eng
Schlagworte:
Electronics
Engineering Sciences
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Iterative decoding of product codes over the binary erasure channel is investigated. It is shown that belief propagation decoding combined with cyclic permutations yields near-capacity performance with low complexity for high-code-rate product codes constructed from two cyclic component codes.
ISSN:0013-5194
1350-911X
DOI:10.1049/el.2010.0411