A bidirectional multiple stack algorithm

Bidirectional sequential decoding (BSD) substantially reduces the computational variability of conventional sequential decoding without compromising the error performance. However, BSD does not completely eliminate the erasure problem. We propose an erasure-free decoding algorithm which combines the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on communications 1999-01, Vol.47 (1), p.6-9
Hauptverfasser:	Kaiping Li, Kallel, S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Bidirectional Communications Society Computation Computer errors Computer simulation Councils Decoding Error probability Errors Random variables Resumes Stack algorithm Viterbi algorithm
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!