Two-stage iterative decoding algorithms for a class of cyclic codes

This paper presents a class of iteratively decodable cyclic codes. Codes in this class have large minimum distance; however, their Tanner graphs contain many short cycles of length 4. With the conventional iterative decoding based on belief propagation, these short cycles significantly degrade the e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2010 IEEE Information Theory Workshop on Information Theory S. 1 - 5
Hauptverfasser: Li Zhang, Qin Huang, Shu Lin
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.01.2010
Schlagworte:
Belief propagation
Block codes
Degradation
Encoding
Feedback
Geometry
Iterative algorithms
Iterative decoding
Shift registers
Sum product algorithm
ISBN:9781424463725, 1424463726
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a class of iteratively decodable cyclic codes. Codes in this class have large minimum distance; however, their Tanner graphs contain many short cycles of length 4. With the conventional iterative decoding based on belief propagation, these short cycles significantly degrade the error performance of the codes. To avoid the degrading effect of these short cycles in performance, two-stage iterative decoding algorithms are devised. Cyclic codes have encoding advantage over other linear block codes. Encoding of a cyclic code in systematic form can be implemented with a single feedback shift-register.
ISBN:9781424463725
1424463726
DOI:10.1109/ITWKSPS.2010.5503173