A list-type reduced-constraint generalization of the Viterbi algorithm
- 1 November 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (6) , 866-876
- https://doi.org/10.1109/tit.1987.1057377
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A residual intersymbol interference error bound for truncated-state Viterbi detectorsIEEE Transactions on Information Theory, 1980
- Computational moments for sequential decoding of convolutional codesIEEE Transactions on Information Theory, 1979
- A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratiosIEEE Transactions on Information Theory, 1977
- Architecture and Construction of a Hardware Sequential Encoder for SpeechIEEE Transactions on Communications, 1977
- Generalized stack algorithms for decoding convolutional codesIEEE Transactions on Information Theory, 1975
- Tree encoding of speechIEEE Transactions on Information Theory, 1975
- Advances in Equalization for Intersymbol InterferencePublished by Elsevier ,1975
- Convolutional codes II. Maximum-likelihood decodingInformation and Control, 1974
- The viterbi algorithmProceedings of the IEEE, 1973
- On the use of Channel Introduced Redundancy for Error CorrectionIEEE Transactions on Communications, 1971