Parallel Viterbi algorithm implementation: breaking the ACS-bottleneck
- 1 August 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 37 (8) , 785-790
- https://doi.org/10.1109/26.31176
Abstract
The central unit of a Viterbi decoder is a data-dependent feedback loop which performs an add-compare-select (ACS) operation. This nonlinear recursion is the only bottleneck for a high-speed parallel implementation. A linear scale solution (architecture) is presented which allows the implementation of the Viterbi algorithm (VA) despite the fact that it contains a data-dependent decision feedback loop. For a fixed processing speed it allows a linear speedup in the throughput rate by a linear increase in hardware complexity. A systolic array implementation is discussed for the add-compare-select unit of the VA. The implementation of the survivor memory is considered. The method for implementing the algorithm is based on its underlying finite state feature. Thus, it is possible to transfer this method to other types of algorithms which contain a data-dependent feedback loop and have a finite state property.Keywords
This publication has 11 references indexed in Scilit:
- Locally connected VLSI architectures for the Viterbi algorithmIEEE Journal on Selected Areas in Communications, 1988
- Concurrent cellular VLSI adaptive filter architecturesIEEE Transactions on Circuits and Systems, 1987
- Design of VLSI CircuitsPublished by Springer Nature ,1987
- Contributions to the application of the Viterbi algorithmIEEE Transactions on Information Theory, 1985
- Memory Management in a Viterbi DecoderIEEE Transactions on Communications, 1981
- Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission SystemsIEEE Transactions on Communications, 1974
- The viterbi algorithmProceedings of the IEEE, 1973
- Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interferenceIEEE Transactions on Information Theory, 1972
- 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