The Viterbi Algorithm

Proceedings of the IEEE

Volumn 61, Issue 3, 1973, Pages 268-278

  Forney, G David ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC; DIGITAL COMMUNICATION SYSTEMS; INFORMATION THEORY;

COMPUTER PROGRAMMING;

EID: 0015600423     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1973.9030     Document Type: Article

References (61)

1. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, Apr. 1967.
2. G. D. Forney, Jr., “Convolutional codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 720–738, Nov. 1970.
3. G. D. Forney, Jr., “Review of random tree codes,” NASA Ames Res. Cen., Moffett Field, Calif., Contract NAS2-3637, NASA CR 73176, Final Rep., Dec. 1967, appendix A.
4. G. C. Clark, R. C. Davis, J. C. Herndon, and D. D. McRae, “Interim report on convolution coding research,” Advanced System Operation, Radiation Inc., Melbourne, Fla., Memo Rep. 38, Sept. 1969.
5. A. J. Viterbi and J. P. Odenwalder, “Further results on optimal decoding of convolutional codes,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-15, pp. 732–734, Nov. 1969.
6. A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 751–772, Oct. 1971.
7. G. D. Forney, Jr., “Convolutional codes II: Maximum likelihood decoding,” Stanford Electronics Labs., Stanford, Calif., Tech. Rep. 7004-1, June 1972.
8. J. A. Heller, “Short constraint length convolutional codes,” in Space Program Summary 37-54, vol. III. Jet Propulsion Lab., Calif. Inst. Technol., pp. 171–177, Oct.–Nov. 1968.
9. J. A. Heller, “Improved performance of short constraint length convolutional codes,” in Space Program Summary 37-56, vol. III Jet Propulsion Lab., Calif. Inst. Technol., pp. 83–84, Feb.–Mar. 1969.
10. J. P. Odenwalder, “Optimal decoding of convolutional codes,” Ph.D. dissertation, Dep. Syst. Sci., Sch. Eng. Appl. Sci., Univ. of California, Los Angeles, 1970.
11. J. L. Ramsey, “Cascaded tree codes,” MIT Res. Lab. Electron., Cambridge, Mass., Tech. Rep. 478, Sept. 1970.
12. G. W. Zeoli, “Coupled decoding of block-convolutional concatenated codes,” Ph.D. dissertation, Dep. Elec. Eng., Univ. of California, Los Angeles, 1971.
13. J. M. Wozencraft, “Sequential decoding for reliable communication,” in 1957 IRE Nat. Conv. Rec., vol. 5, pt. 2, pp. 11–25.
14. R. M. Fano, “A heuristic discussion of probabilistic decoding,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 64–74, Apr. 1963.
15. K. S. Zigangirov, “Some sequential decoding procedures,” Probl. Pered. Inform., vol. 2, pp. 13–25, 1966.
16. F. Jelinek, “Fast sequential decoding algorithm using a stack,” IBM J. Res. Develop., vol. 13, pp. 675–685, Nov. 1969.
17. L. R. Bahl, C. D. Cullum, W. D. Frazer, and F. Jelinek, “An efficient algorithm for computing free distance,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-18, pp. 437–439, May 1972.
18. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate” (Abstract), in 1972 Int. Symp. Information Theory (Pacific Grove, Calif., Jan. 1972), p. 90.
19. P. L. McAdam, L. R. Welch, and C. L. Weber, “M.A.P. bit decoding of convolutional codes,” in 1972 Int. Symp. Information Theory Pacific Grove, Calif., Jan. 1972), p. 91.
20. Linkabit Corp., “Coding systems study for high data rate telemetry links,” Final Rep. on NASA Ames Res. Cen., Moffett Field, Calif., Contract NAS2-6024, Rep. CR-114278, 1970.
21. G. C. Clark, “Implementation of maximum likelihood decoders for convolutional codes,” in Proc. Int. Telemetering Conf. (Washington, D. C., 1971).
22. J. A. Heller and I. M. Jacobs, “Viterbi decoding for satellite and space communication,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 835–847, Oct. 1971.
23. G. C. Clark, Jr., and R. C. Davis, “Two recent applications of error-correction coding to communications system design,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 856–863, Oct. 1971.
24. I. M. Jacobs and R. J. Sims, “Configuring a TDMA satellite communication system with coding, in Proc. 5th Hawaii Int. Conf. Systems Science. Honolulu, Hawaii: Western Periodicals, 1972, pp. 443–446.
25. A. R. Cohen, J. A. Heller, and A. J. Viterbi, “A new coding technique for asynchronous multiple access communication,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 849–855, Oct. 1971.
26. D. Quagliato, “Error correcting codes applied to satellite channels,” in 1972 IEEE Int. Conf. Communications (Philadelphia, Pa.), pp. 15/13–18.
27. Linkabit Corp., “Hybrid coding system study,” Final Rep. on Contract NAS2-6722, NASA Ames Res. Cen., Moffett Field, Calif., NASA Rep. CR114486, Sept. 1972.
28. G. C. Clark, Jr., and R. C. Davis, “Reliability-of-decoding indicators for maximum likelihood decoders,” in Proc. 5th Hawaii Int. Conf. Systems Science. Honolulu, Hawaii: Western Periodicals, 1927, pp. 447–450.
29. G. D. Forney, Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 363–378, May 1972.
30. G. D. Forney, Jr., “Lower bounds on error probability in the presence of large intersymbol interference,” IEEE Trans. Commun. Technol. (Corresp.), vol. COM-20, pp. 76–77, Feb. 1972.
31. J. K. Omura, “On optimum receivers for channels with intersymbol interference,” abstract presented at the IEEE Int. Symp. Information Theory, Noordwijk, The Netherlands, June 1970.
32. H. Kobayashi, “Correlative level coding and maximum-likelihood decoding,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 586–594, Sept. 1971.
33. M. J. Ferguson, “Optimal reception for binary partial response channels,” Bell Syst. Tech. J., vol. 51, pp. 493–505, Feb. 1972.
34. F. R. Magee, Jr., and J. G. Proakis, “Adaptive maximum-likelihood sequence estimation for digital signaling in the presence of intersymbol interference,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-19, pp. 120–124, Jan. 1973.
35. L. K. Mackechnie, “Maximum likelihood receivers for channels having memory,” Ph.D. dissertation, Dep. Elec. Eng., Univ. of Notre Dame, Notre Dame, Ind., Jan. 1973.
36. R. W. Chang and J. C. Hancock, “On receiver structures for channels having memory,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 463–468, Oct. 1966.
37. K. Abend, T. J. Harley, Jr., B. D. Fritchman, and C. Gumacos, “On optimum receivers for channels having memory,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-14, pp. 819–820, Nov. 1968.
38. R. R. Bowen, “Bayesian decision procedures for interfering digital signals,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-15, pp. 506–507, July 1969.
39. K. Abend and B. D. Fritchman, “Statistical detection for communication channels with intersymbol interference,” Proc. IEEE, vol. 58, pp. 779–785, May 1970.
40. C. G. Hilborn, Jr., “Applications of unsupervised learning to problems of digital communication,” in Proc. 9th IEEE Symp. Adaptive Processes, Decision, and Control (Dec. 7–9, 1970).
41. C. G. Hilborn, Jr., and D. G. Lainiotis, “Optimal unsupervised learning multicategory dependent hypotheses pattern recognition,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 468–470, May 1968.
42. G. Ungerboeck, “Nonlinear equalization of binary signals in Gaussian noise,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 1128–1137, Dec. 1971.
43. G. Ungerboeck, “Adaptive maximum-likelihood receiver for carrier-modulated data transmission systems,” in preparation.
44. M. G. Pelchat, R. C. Davis, and M. B. Luntz, “Coherent demodulation of continuous-phase binary FSK signals,” in Proc. Int. Telemetry Conf. (Washington, D. C., 1971).
45. R. de Buda, “Coherent demodulation of frequency-shift keying with low deviation ratio,” IEEE Trans. Commun. Technol., vol. COM-20, pp. 429–435, June 1972.
46. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, Ill.: Univ. of Ill. Press, 1949.
47. C. E. Shannon, “Prediction and entropy of printed English,” Bell Syst. Tech. J., vol. 30, pp. 50–64, Jan. 1951.
48. D. L. Neuhoff, “The Viterbi algorithm as an aid in text recognition,” Stanford Electronic Labs., Stanford, Calif., unpublished.
49. J. Raviv, “Decision making in Markov chains applied to the problem of pattern recognition,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 536–551, Oct. 1967.
50. H. Kobayashi, “A survey of coding schemes for transmission or recording of digital data,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 1087–1100, Dec. 1971.
51. H. Kobayashi, “Application of probabilistic decoding to digital magnetic recording systems,” IBM J. Res. Develop., vol. 15, pp. 64–74, Jan. 1971.
52. U. Timor, “Sequential ranging with the Viterbi algorithm,” Jet Propulsion Lab., Pasadena, Calif., JPL Tech. Rep. 32-1526, vol. II, pp. 75–79, Jan. 1971.
53. J. K. Omura, “On the Viterbi algorithm for source coding” (Abstract), in 1972 IEEE Int. Symp. Information Theory (Pacific Grove, Calif., Jan. 1972), p. 21.
54. F. P. Preparata and S. R. Ray, “An approach to artificial nonsymbolic cognition,” Inform. Sci., vol. 4, pp. 65–86, Jan. 1972.
55. S. W. Golomb, Shift Register Sequences. San Francisco, Calif.: Holden-Day, 1967, pp. 13–17.
56. G. J. Minty, “A comment on the shortest-route problem,” Oper. Res., vol. 5, p. 724, Oct. 1957.
57. M. Pollack and W. Wiebenson, “Solutions of the shortest-route problem—A review,” Oper. Res., vol. 8, pp. 224–230, Mar. 1960.
58. R. Busacker and T. Saaty, Finite Graphs and Networks: An Introduction with Applications. New York: McGraw-Hill, 1965.
59. J. K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 177–179, Jan. 1969.
60. J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering. New York: Wiley, 1965, ch. 4.
61. J. K. Omura, “Optimal receiver design for convolutional codes and channels with memory via control theoretical concepts,” Inform. Sci., vol. 3, pp. 243–266, July 1971.