Maximum-Likelihood Sequence Estimation of Digital Sequences in the Presence of Intersymbol Interference

IEEE Transactions on Information Theory

Volumn 18, Issue 3, 1972, Pages 363-378

  Forney, G David ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMPLITUDE MOLDULATION; NOISE, SPURIOUS-SIGNAL; PULSE MODULATION;

INTERSYMBOL INTERFERENCE;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0015346024     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1972.1054829     Document Type: Article

References (42)

1. A. Lender, “Correlative digital communication techniques,” IEEE Trans. Commun. Technol., vol. COM-12, pp. 128–135, Dec. 1964.
2. E. R. Kretzmer, “Generalization of a technique for binary data communication,” IEEE Trans. Commun. Technol. (Concise Papers), vol. COM-14, pp. 67–68, Feb. 1966.
3. A. M. Gerrish and R. D. Howson, “Multilevel partial-response signalling,” in IEEE Int. Conf Communications Rec., Minneapolis, Minn., June 1967, p. 186.
4. C. W. Helstrom, Statistical Theory of Signal Detection. New York: Pergamon, 1960, sect. IV.5.
5. D. A. George, “Matched filters for interfering signals,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-11, pp. 153–154, Jan. 1965.
6. D. W. Tufts, “Nyquist’s problem-The joint optimization of transmitter and receiver in pulse amplitude modulation,” Proc. IEEE, vol. 53, pp. 248–259, Mar. 1965.
7. M. R. Aaron and D. W. Tufts, “Intersymbol interference and error probability,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 26–34, Jan. 1966.
8. T. Berger and D. W. Tufts, “Optimum pulse amplitude modulation, part I : Transmitter-receiver design and bounds from information theory,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 196–208, Apr. 1967.
9. R. W. Lucky, J. Salz, and E. J. Weldon, Jr., Principles of Data Communication. New York: McGraw-Hill, 1968, ch. 5.
10. J. G. Proakis and J. H. Miller, “An adaptive receiver for digital signaling through channels with intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 484–497, July 1969.
11. T. Ericson, “Structure of optimum receiving filters in data transmission systems,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-17, pp. 352–353, May 1971.
12. 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.
13. 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.
14. R. R. Bowen, “Bayesian decision procedure for interfering digital signals,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-15, pp. 506–507, July 1969.
15. K. Abend and B. D. Fritchman, “Statistical detection for communication channels with intersymbol interference,” Proc. IEEE, vol. 58, pp. 779–785, May 1970.
16. 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; also 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.
17. 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; also 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.
18. M. E. Austin, “Decision-feedback equalization for digital communication over dispersive channels,” M.I.T. Lincoln Lab., Lexington, Mass., Tech. Rep. 437, Aug. 1967; also Sc.D. thesis, Massachusetts Inst. Technol., Cambridge, May 1967.
19. D. A. George, R. R. Bowen, and J. R. Storey, “An adaptive decision feedback equalizer,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 281–293, June 1971.
20. 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.
21. G. D. Forney, Jr., “Review of random tree codes,” NASA Ames Res. Cen., Moffett Field, Calif., Contr. NAS2-3637, NASA CR 73176, Final Rep., Appendix A, Dec. 1967.
22. A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 751–772, Oct. 1971.
23. G. J. Minty, “A comment on the shortest-route problem,” Oper. Res., vol. 5, p. 724, Oct. 1957.
24. M. Pollack and W. Wiebenson, “Solutions of the shortest-route problem—A review,” Oper. Res., vol. 8, pp. 224-230, Mar. 1960.
25. O. Wing, “Algorithms to find the most reliable path in a network,” IRE Trans. Circuit Theory (Corresp.), vol. CT-8, pp. 78–79, Mar. 1961.
26. S. C. Parikh and I. T. Frisch, “Finding the most reliable routes in communication systems,” IEEE Trans. Commun. Syst., vol. CS-11, pp. 402–406, Dec. 1963.
27. R. Busacker and T. Saaty, Finite Graphs and Networks: An Introduction with Applications. New York: McGraw-Hill 1965.
28. Y. S. Fu, “Dynamic programming and optimum routes in probabilistic communication networks,” in IEEE Int. Conv. Rec., pt. 1, pp, 103–105, Mar. 1965.
29. J. K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-15. pp. 177–179. Jan. 1969.
30. J. K. Omura, “On optimum receivers for channels with intersymbol interference,” (Abstract), presented at the IEEE Int. Symp. Information Theory, Noordwijk, Holland, June 1970.
31. J. K. Omura, “Optimal receiver design for convolutional codes and channels with memory via control theoretic concepts,” unpublished.
32. H. Kobayashi and D. T. Tang, “On decoding and error control for a correlative level coding system,” (Abstract), presented at the IEEE Int. Symp. Information Theory, Noordwijk, Holland, June 1970.
33. H. Kobayashi, “Application of probabilistic decoding to digital magnetic recording systems,” IBM J. Res. Develop., vol. 15, pp. 64–74, Jan. 1971.
34. H. Kobayashi, “Correlative level coding and maximum-likelihood decoding,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 586–594, Sept. 1971.
35. T. N. Morrissey, Jr., “A unified analysis of decoders for convolutional codes,” Univ. Notre Dame, Notre Dame, Ind., Tech. Rep. EE-687, Oct. 1968, ch. 7; also T. N. Morrissey, Jr., “Analysis of decoders for convolutional codes by stochastic sequential machine methods,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 460–469, July 1970.
36. J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering. New York: Wiley, 1965, ch. 4.
37. B. H. Bharucha and T. T. Kadota, “On the representation of continuous parameter processes by a sequence of random vari ables,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 139–141, Mar. 1970.
38. H. L. Van Trees, Detection, Estimation, and Modulation Theory, Part I. New York: Wiley, 1968, problems 2.6.17-18.
39. 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.
40. J. F. Gunn and J. A. Lombardi, “Error detection for partial-response systems,” IEEE Trans. Commun. Technol., vol. COM-17, pp. 734—737, Dec. 1969.
41. R. A. Silverman and M. Balser, “Coding for constant-data-rate systems-Part I. A new error-correcting code,” Proc. IRE, vol. 42, pp. 1428–1435, Sept. 1954.
42. J. W. Smith, “Error control in duobinary systems by means of null zone detection,” IEEE Trans. Commun. Technol., vol. COM-16, pp. 825–830, Dec. 1968.