Implementing the Viterbi Algorithm Fundamentals and real-time issues for processor designers

IEEE Signal Processing Magazine

Volumn 12, Issue 5, 1995, Pages 42-52

  Lou, Hui Ling ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHARACTER RECOGNITION; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA STORAGE EQUIPMENT; DECODING; DIGITAL COMMUNICATION SYSTEMS; DYNAMIC PROGRAMMING; MARKOV PROCESSES; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SIGNAL DETECTION; SPEECH RECOGNITION;

HIDDEN MARKOV MODELS; MEMORY REQUIREMENTS; VITERBI ALGORITHM;

SIGNAL PROCESSING;

EID: 0029375555     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/79.410439     Document Type: Article

References (41)

1. A. J. Viterbi. “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Trans, on Information Theory, IT-13, April 1967.
2. G. D. Forney Jr. “Maximum-Likelihood Sequence Detection in the Presence of Intersymbol Interference,” IEEE Trans. on Information Theory, IT-18(3):363-378, May 1972.
3. G. D. Forney Jr. “The Viterbi Algorithm,” IEEE Proceedings, IT-61 (3):268-278, March 1973.
4. A. J. Viterbi and J. K. Omura. Principles of Digital Communication and Coding. McGraw-Hill Book Company, New York, NY, 1979.
5. E. A. Lee and D. G. Messerschmitt. Digital Communication. Kluwer Academic Publishers, Boston, MA. 1988.
6. J. M. Wozencraft and I. M. Jacobs. Principles of Communication Engineering. John Wiley and Sons, New York, NY, 1965.
7. L. R. Rabiner and B-H Juang. “An Introduction to Hidden Markov Models,” IEEEASSP Magazine, 3( 1 ):4-16, January 1986.
8. L. R. Rabiner. “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition.” IEEE Proceedings, 77(2): 257-285, February 1989.
9. L. R. Rabiner and B-H Juang. Fundamentals of Speech Recognition. Prentice Hall, Englewood Cliffs, New Jersey, 1993. Chapter 6.
10. J. Picone. “Continuous Speech Recognition Using Hidden Markov Models,” IEEEASSP Magazine, 7(3):26-41, July 1990.
11. N. Seshadri and C-E. W. Sundberg. “List Viterbi Algorithms with applications.” IEEE Transactions on Communications., Vol. 42, No. 2/3/4, Feb/Mar/Apr 1994.
12. O. E. Agazzi and S. Kuo. “Pseudo two-dimensional hidden Markov models for document recogntion.” AT&T Technical Journal, 72(5), September/October 1993.
13. C. B. Shung, H. D. Lin, R. Cypher, P. H. Siegel, and H. K. Thapar. “ Area-efficient architectures for the Viterbi algorithm I. Theory.” IEEE Trans, on Communications, 41(4):636-44, April 1993.
14. C. B. Shung, H. D. Lin, R. Cypher, P. H. Siegel, and H. K. Thapar. “ Area-efficient architectures for the Viterbi algorithm II. Applications.” IEEE Trans, on Communications, 41(5):802-7, May 1993.
15. C. B. Shung, H. D. Lin, P. H. Siegel, and H. K. Thapar. “Area-Efficient Architecture for the Viterbi Algorithm.” In: 1990 Global Communications Conference, San Diego, December 1990.
16. H.-D. Lin and C. B. Shung. “General in-place scheduling for the Viterbi algorithm.” In: 1991 International Conference on Acoustics, Speech and Signal Processing, Toronto, Canada, May 1991.
17. H.-D. Lin and D. G. Messerschmitt. “Algorithms and architectures for concurrent Viterbi decoding.” In: 1989 International Conference on Communications, Boston, Massachusetts, June 1989.
18. K. K. Parhi. “High-speed VLSI architectures for Huffman and Viterbi decoders.” IEEE Trans, on Circuits and Systems 11: Analog and Digital Signal Processing, 39(6):385-91, June 1992.
19. P. J. Black and T. H.-Y. Meng. “A 140MBIT/S 32-State Radix-4 Viterbi Decoder.” In: 1992 International Solid-State Circuits Conference, San Francisco, February 1992. Paper No. WP 4.5.
20. P. J. Black and T. H.-Y. Meng. “A hardware efficient parallel Viterbi algorithm.” In: 1990 International Conference on Acoustics, Speech and Signal Processing, New York, April 1990.
21. G. Fettweis and H. Meyr. “High-speed parallel Viterbi decoding: algorithm and VLSI-architecture.” IEEE Communications Magazine, 29(5):46-55, May 1991.
22. G. Fettweis andH. Meyr. “High Rate Viterbi Processor: A Systolic Array Solution.” IEEE Journal on Selected Areas in Communications, 8(8): 1520-1534, October 1990.
23. G. Fettweis and H. Meyr. “A 100MBIT/S Viterbi Decoder Chip: Novel Architecture and Its Realization.” In: 1990 International Conference on Communications, Atlanta, April 1990, Paper No. 307.4.
24. G. Fettweis and H. Meyr. “Parallel Viterbi Algorithm Implementation: Breaking the ACS-Bottleneck.” IEEE Transactions on Communications, 37(8):285-90, August 1989.
25. E. Paask, S. Pedersen, and J. Sparso. “An area-efficient pathmemory structure for VLSI Implementation of high speed Viterbi decoders.” Integration, The VSLI Journal, 12( 1 ):79-91, November 1991.
26. R. Cypher and C. B. Shung. “Generalized traceback techniques for survivor memory management in Viterbi algorithm.” In: 1990 Global Communications Conference, December 1990.
27. W. R. Kirkland and D. P. Taylor. “High-speed Viterbi decoder memory design.” Canadian Journal of Electrical and Computer Engineering, 15(3): 107-114, August 1990.
28. H. K. Thapar and J. M. Cioffi. “A block processing methods for designing high-speed Viterbi detectors.” In: International Conference on Communications, Boston, June 1989.
29. R. Schweikert and A. J. Vinck. “Trellis-coded modulation with high-speed low complexity decoding.” In: 1990 Global Communications Conference, San Diego, December 1990.
30. P. G. Gulak and T. Kailath. “Locally connected VLSI architectures for the Viterbi algorithm.” IEEE Journal on Selected Areas in Communications. 6(3). April 1988.
31. C. M. Rader. “Memory Management in a Viterbi Decoder,” IEEE Trans, on Communications, COM-29(9): 1399-1401, September 1981.
32. G. Ungerboeck. “Trellis-Coded Modulation with Redundant Signal Sets Part I,” IEEE Communications Magazine, 25(2), February 1987.
33. G. Ungerboeck. “Trellis-Coded Modulation with Redundant Signal Sets Part II,” IEEE Communications Magazine, 25(2). February 1987.
34. G. D. Forney Jr. “Coset Codes I: Geometry and Classification,” IEEE Trans. on Information Theory, IT-34(5): 1123-1151, September 1988.
35. G. D. Forney Jr. “Coset Codes II: Binary’ Lattices and Related Codes,” IEEE Trans, on Information Theory, IT-34(5): 1152-1187, September 1988.
36. C. B. Shung, P. H. Siegel, G. Ungerboeck, and H. K. Thapar. “VLSI Architectures for Metric Normalization in the Viterbi Algorithm.” In: 1990 International Conference on Communications, Atlanta, Georgia, April 1990.
37. H. Lou. “The Study and Design of a Programmable Processor for Viterbi Derection.” Stanford University, Ph.D. Thesis, Stanford, CA, 1993.
38. A. P. Hekstra. “An Alternative to Metric Rescaling in Viterbi Decoders,” IEEE Trans, on Communications, 37(11): 1220-1222, November 1989.
39. O. Collins and F. Pollara. “Memory management in traceback Viterbi decoders.” TDA Progress Report, Jet Propulsion Laboratory, November 1989.
40. G. Feygin and P. G. Gulak. “Survivor sequence memory management in Viterbi decoders.” In: 1991 International Symposium of Circuits and Systems, Singapore, June 1991.
41. G. Feygin and P. G. Gulak. “Survivor sequence memory management in Viterbi decoders.” Technical report, University of Toronto. Computer Research Institute, CSRI-252, 1991.