Survivor sequence memory management in Viterbi decoders

This work extends previous trace-back approaches. A new one-pointer trace-back algorithm for survivor sequence memory management that is particularly well-suited to a VLSI implementation is described. Memory size, latency and implementational complexity of the survivor sequence management are analyzed for both uniprocessor and multiprocessor realizations of Viterbi decoders.<<ETX>>

[1]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .

[2]  R. Orndorff,et al.  Viterbi decoder VLSI integrated circuit for bit error correction , 1981 .

[3]  C. Rader.  Memory Management in a Viterbi Decoder , 1981, IEEE Trans. Commun..

[4]  R. E. Peile,et al.  Stanford Telecom VLSI design of a convolutional decoder , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[5]  Robert J. McEliece,et al.  Truncation effects in Viterbi decoding , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[6]  F. Pollara,et al.  Memory management in traceback Viterbi decoders , 1989 .

[7]  Robert Cypher,et al.  Generalized trace-back techniques for survivor memory management in the Viterbi algorithm , 1993, J. VLSI Signal Process..