Finding a list of best paths in a trellis

Georg Schmidt, Vladimir R. Sidorenko, Victor V. Zyablov, Martin Bossert

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

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 ℓ best paths. Our algorithm is based on the Viterbi algorithm and iteratively applies a back-tracing procedure to find the ℓ best paths.

Original languageEnglish
Pages (from-to)557
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: 27 Jun 20042 Jul 2004

Fingerprint

Dive into the research topics of 'Finding a list of best paths in a trellis'. Together they form a unique fingerprint.

Cite this