Title :
Finding a list of best paths in a trellis
Author :
Schmidt, Georg ; Sidorenko, Vladimir R. ; Zyablov, Victor V. ; Bossert, Martin
Author_Institution :
Dept. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Germany
fDate :
27 June-2 July 2004
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.
Keywords :
Viterbi decoding; concatenated codes; iterative decoding; trellis codes; Viterbi algorithm; iterative back-tracing procedure; trellis code; Concatenated codes; Decoding; Information theory; Iterative algorithms; Tail; Viterbi algorithm;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365592
