Cascaded feedforward architectures for parallel Viterbi decoding
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 978-981 vol.2
- https://doi.org/10.1109/iscas.1990.112266
Abstract
The Viterbi algorithm (VA) is a common application of dynamic programming. Since it contains a nonlinear ACS (add-compare-select) feedback loop, this loop is the bottleneck in high-data-rate implementations. It is shown that, asymptotically, the ACS feedback no longer has to be processed recursively, i.e. there is no feedback, resulting in negligible performance loss. This can be exploited to derive purely feedforward architectures for Viterbi decoding, so that a modular cascadable implementation results. By designing one cascadable module, any speedup can be achieved simply by adding modules to the implementation. It is shown that optimization criteria, e.g. minimum latency or maximum hardware efficiency, are met by very different architectures.<>Keywords
This publication has 11 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
- A 100 Mbit/s Viterbi decoder chip: novel architecture and its realizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- High-rate Viterbi processor: a systolic array solutionIEEE Journal on Selected Areas in Communications, 1990
- Parallel Viterbi algorithm implementation: breaking the ACS-bottleneckIEEE Transactions on Communications, 1989
- Pipeline interleaving and parallelism in recursive digital filters. II. Pipelined incremental block filteringIEEE 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