Finding a list of best paths in a trellis

Finding a list of best paths in a trellis

To find the best path in a trellis, the Viterbi algorithm can be used. We present an algorithm to find not only the best, but a sorted list of the /spl lscr/ best paths. Our algorithm is based on the Viterbi algorithm and iteratively applies a back-tracing procedure to find the /spl lscr/ best paths...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Schmidt, G., Sidorenko, V.R., Zyablov, V.V., Bossert, M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Concatenated codes
Decoding
Information theory
Iterative algorithms
Tail
Viterbi algorithm
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To find the best path in a trellis, the Viterbi algorithm can be used. We present an algorithm to find not only the best, but a sorted list of the /spl lscr/ best paths. Our algorithm is based on the Viterbi algorithm and iteratively applies a back-tracing procedure to find the /spl lscr/ best paths.
DOI:10.1109/ISIT.2004.1365592