Minimized method Viterbi decoding: 600 Mbit/s per chip
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1712-1716
- https://doi.org/10.1109/glocom.1990.116778
Abstract
The Viterbi algorithm is a common application of dynamic programming in communications. Since it has a nonlinear feedback loop, this loop is the bottleneck in high-data-rate implementations. It is shown that asymptotically the loop no longer has to be processed recursively, i.e. there is no feedback (resulting in negligible performance loss). This can be exploited to derive a purely feedforward method for Viterbi decoding, called the minimized method. It is demonstrated that the minimized method can be implemented very efficiently by a systolic architecture. This is shown on a chip design which achieves 600-Mb/s decoding speed per chip, for a K=3 convolutional code. By designing one cascadable module (chip), any speed up can be achieved simply by linearly adding modules to the implementation.<>Keywords
This publication has 14 references indexed in Scilit:
- Look-ahead in dynamic programming and quantizer loopsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Algorithms and architectures for concurrent Viterbi decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Cascaded feedforward architectures for parallel Viterbi decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the interaction between DSP-algorithms and VLSI-architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A 100 Mbit/s Viterbi decoder chip: novel architecture and its realizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Pipeline interleaving and parallelism in recursive digital filters. I. Pipelining using scattered look-ahead and decompositionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- The viterbi algorithmProceedings of the IEEE, 1973
- On the Viterbi decoding algorithmIEEE Transactions on Information Theory, 1969
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967
- Applied Dynamic ProgrammingPublished by Walter de Gruyter GmbH ,1962