Contributions to the application of the Viterbi algorithm
- 1 September 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 31 (5) , 626-634
- https://doi.org/10.1109/tit.1985.1057087
Abstract
The Viterbi algorithm is an efficient technique to estimate the state sequence of a discrete-time finite-state Markov process in the presence of memoryless noise. This work sets up a relationship to a general class of linear and nonlinear fast algorithms such as FFT, FWT, and optimal sorting. The performance of a Viterbi detector is a function of the minimum distance between signals in the observation space of the estimated Markov process. It is shown that this distance may efficiently be calculated with dynamic programming using a slightly modified Viterbi algorithm of an increased basis.Keywords
This publication has 7 references indexed in Scilit:
- An event-driven maximum-likelihood peak position detector for run-length-limited codes in magnetic recordingIEEE Transactions on Magnetics, 1981
- On invariant sets of a certain class of fast translation-invariant transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Orthogonal Transforms for Digital Signal ProcessingPublished by Springer Nature ,1975
- 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
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- Sequence-state Methods for Run-length-limited CodingIBM Journal of Research and Development, 1970