Turbo-like codes based on RSC code decomposition

In this paper, we show that recursive systematic convolutional codes with primitive denominator polynomial can be decomposed. As a consequence, an RSC code can be view as a kind of parallel concatenation of one memory RSC code. This decomposition gives an original relation between RSC codes and turb...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Hong Sun, Le Ruyet, D., Han Vu Thien
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Convolutional codes Decoding Delay Differential equations Galois fields Parity check codes Polynomials Sun Turbo codes
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper, we show that recursive systematic convolutional codes with primitive denominator polynomial can be decomposed. As a consequence, an RSC code can be view as a kind of parallel concatenation of one memory RSC code. This decomposition gives an original relation between RSC codes and turbo codes.
DOI:	10.1109/ISIT.2001.936160