An Efficient List Viterbi Algorithm with Application to ML Decoding of Turbo Codes


This paper presents a new list Viterbi algorithm (LVA) for finding the n highest metric paths in a trellis diagram. The new algorithm is sequential; the nth best path is found by modification of one of the known n − 1 best paths. Successive paths are found by a backtracing operation that yields a very efficient algorithm. Previous works have applied LVAs to… (More)


11 Figures and Tables