Maximum-likelihood Receiver for Four-Dimensional Signaling Schemes Corrupted by ISI

IEEE Transactions on Communications

Volumn 40, Issue 2, 1992, Pages 265-277

  Feiz, Saied ^a   Soliman, Samir S ^b  

^a SOUTHERN METHODIST UNIVERSITY   (United States)

^b QUALCOMM INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PHASE MODULATION - PHASE SHIFT KEYING; PROBABILITY; SIGNAL FILTERING AND PREDICTION; SIGNAL RECEIVERS;

FOUR-DIMENSIONAL SIGNALING; MAXIMUM-LIKELIHOOD RECEIVER; MODIFIED VITERBI ALGORITHM; PARALLEL SYNCHRONIZER; QUADRATURE-QUADRATURE PSK;

DATA TRANSMISSION;

EID: 0026810245     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.129189     Document Type: Article

References (38)

1. 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.
2. G. Ungerboeck, “Adaptive maximum-likelihood receiver for carrier-modulated data-transmission systems,” IEEE Trans. Cummun., vol. COM-22, pp. 624-636. May 1974.
3. H. Kobayashi, “Simultaneous adaptive estimation and decision algorithm for carrier modulated data transmission systems.” IEEE Trans. Commun. Technol., vol. COM-19, pp. 268-280, June 1971.
4. R. E. Bellman, Dynamic Programming. Princeton. NJ: Princeton University Press, 1957.
5. J.F. Hayes, “The Viterbi algorithm applied to digital data transmission,” Commun. Soc., vol. 13, pp. 15-20, Mar. 1975.
6. J.J. Stiffler, “maximum-likelihood symbol synchronization,” Jet Prop. Lab., Pasadena, CA, SPS 37-35, vol. IV, pp. 349-357, Oct. 1965.
7. A. P. Sage, and A. L. McBride, “Optimum estimation of bit synchronization,” IEEE Trans. Aerospace Electron. Syst., vol. AES-5. pp. 525-536, May 1969.
8. W.C. Lindsey, and M.K. Simon, “Data-aided carrier tracking loops,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 157-168.
9. W. C. Lindsey, and M. K. Simon, Telecommunication Systems Engineering. Englewood Cliffs, NJ: Prentice-Hall, 1973.
10. H. Robbins, and S. Monro, “A stochastic approximation method,” Ann. Math. Statist., vol. 22, 400-407, 1951.
11. O. Macchi, and L. L. Scharf, “A dynamic programming algorithm for phase estimation and data decoding on random phase channels,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 581-595, Sept. 1981.
12. G. Ungerboeck, “New application for Viterbi algorithm: Carrier phase tracking in synchronous data transmission systems,” in Proc. Nat. Telecommun. Conf., 1974, pp. 734-738.
13. G. Ascheid, M. Oerder, J. Stahl, and H. Meyr, “An all digital receiver architecture for bandwidth efficient transmission at high data rates,” IEEE Trans. Commun., vol. 37, Aug. 1989.
14. D. Saha and T. G. Birdsall, “Quadrature-quadrature phase-shift keying,” IEEE Trans. Commun., vol. 37, May 1989.
15. M. Schwartz, “Abstract vector spaces applied to problems in detection and estimation theory,” IEEE Trans. Inform. Theory, vol. IT-12. pp. 327-336, July 1966.
16. C. R. Rao, “Minimum variance and the estimation of several parameters,” in Proc. Cambridge Phil. Soc., vol. 43, 1947, p. 280.
17. M.G. Kendall and A. Stuart, The Advanced Theory of Statistics. Vol. 2: Inference and Relationship. New York: Hafner, 1961.
18. D. Middleton, An Introduction to Statistical Communication Theory. New York: McGraw-Hill, 1960.
19. D. G. Messerschmitt, “A geometric theory of intersymbol interference, Part II: Performance of the maximum likelihood detector,” Bell Syst. Tech. J., vol. 52, pp. 1521-1539, Nov. 1973.
20. G. D. Forney, “Lower bounds on the error probability in the presence of large intersymbol interference,” IEEE Trans. Commun., vol. COM-20, pp. 76-77, Feb. 1972.
21. N. Seshardi and J. B. Anderson, “Heavily filtered continuous phase modulations,” in Proc. 19th Annu. Conf. Inform. Sci. Syst., The John Hopkins Univ., Baltimore, MD, Mar. 1985.
22. J. B. Anderson and D. P. Taylor, “A bandwidth-efficient class of signal-space codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 703-712, Nov. 1978.
23. S. Crozier et al, “Microprocessor-based implementation and testing of a simple Viterbi detector,” Can. Elect. Eng. J., vol. 6, no. 3, 1981.
24. S. Crozier el al., “An adaptive maximum likelihood sequence estimation technique for wideband HF Communications.” in Proc. Military Commun. Conf, Boston, MA, Oct. 1982, pp. 29. 3.1-29.3.9.
25. N.J.P. Frenette et al., “Implementation of a Viterbi processor for a digital communications system with a time-dispersive channel,” IEEE J. Select. Areas Commun., vol. SAC-4, pp. 160-167. Jan. 1986.
26. H. T. Kung and C. E. Leiserson, “Systolic arrays (for VLSI),” in Spare Matrix Proc. 1978, I. S. Duff and G.W. Stewart, Eds. Philadelphia, PA: SIAM, 1979, pp. 256-282.
27. H.T. Kung, “Why systolic architectures?,” IEEE Comput., vol. 15, pp. 37-46, Jan. 1982.
28. S. Feiz and S. S. Soliman, “Adaptive ML neural network based receiver for Q-PSK modulated data-transmission systems,” IEEE VTC ‘89, San Francisco, CA, May 1989.
29. A. D. Wyner, “Upperbound on the error probability of detection with unbounded intersymbol interference,” Bell Syst. Tech. J., vol. 54, pp. 1341-1351, Sept. 1975.
30. U. B. Deasi and B. Das, “Parallel algorithms for Kalman filtering,” ACC 85, vol. 2, pp. 920-921, 1985.
31. D. Godard, “Channel equalization using a kalman filter for fast data transmission,” IBM J. Res. Develop., vol. 18, pp. 267-273, 1974.
32. S. Feiz and S. S. Soliman, “maximum-likelihood sequence estimation of four dimensional signaling schemes subject to ISI,” IEEE GLOBECOM ‘89, Dallas, TX, Nov. 1989.
33. D. Saha, “Trellis coded quadrature-quadrature phase shift keying,” IEEE MILCOM ‘87, Washington, DC, Oct. 1987, pp. 929-933.
34. G. Ungerboech, “Trellis-coded modulation with redundant signal sets, Part 1 and Part II,” IEEE Commun. Mag., vol. 25, Feb. 1987.
35. F. M. Gardner, “Hangup in phaselock loops,” IEEE Trans. Commun., vol. COM-25, pp. 1210-1214, Oct. 1977.
36. E. Parzen, “Extraction and detection problems and reproducing kernel Hilbert space,” J. SIAM, vol. 1. 1962, p. 53.
37. T. Kailath, “Some application of reproducing kernel Hilbert space,” presented at 3rd Annu. Allerton Conf. Circuit and System Theory, Univ. Illinois, Urbana, 1965.
38. J. Capon, “Hilbert space methods for detection theory and pattern recognition,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 247-259, Apr. 1965.