Blind Equalization Without Gain Identification

IEEE Transactions on Information Theory

Volumn 39, Issue 1, 1993, Pages 292-297

  Anderson, Brian D O ^b   Kennedy, Rodney A ^b  

^a PRINCETON UNIVERSITY   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

adaptive filtering; ARMA models; Blind equalization; deeonvolution

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; INFORMATION THEORY; POLES AND ZEROS; SIGNAL FILTERING AND PREDICTION;

ADAPTIVE FILTERING; ARMA MODELS; BLIND EQUALIZATION; DECONVOLUTION;

EQUALIZERS;

EID: 0027224769     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.179377     Document Type: Article

References (19)

1. K. J. Astrom and T. Soderstrom, “Uniqueness of the maximum likelihood estimates of the parameters of an ARMA model,” IEEE Trans. Automat. Contr., vol. AC-19, pp. 769–773, Dec. 1974.
2. S. Benedetto, E. Biglieri, and V. Castellani, Digital Transmission Theory. Englewood Cliffs, NJ: Prentice-Hall, 1987.
3. A. Beriveniste, M. Goursat, and G. Ruget, “Robust identification of a nonminimum phase system: Blind adjustment of a linear equalizer in data communications,” IEEE Trans. Automat. Contr., vol. AC-25, pp. 385–399, June 1980.
4. Z. Ding, R.A. Kennedy, B.D.O. Anderson, and C.R. Johnson, “Existence and avoidance of ill-convergence of Godard blind equalizers in data communication systems,” IEEE Trans. Commun., vol. 39, pp. 1313–1327, Sept. 1991.
5. Z. Ding, C. R. Johnson, and R. A. Kennedy, “On the (non)existence of undesirable equilibria of Godard blind equalizers,” IEEE Trans. Signal Processing, 1992, to appear.
6. G.J. Foschini, “Equalizing without altering or detecting data,” AT&T Tech. J., vol. 64, pp. 1885–1911, Oct. 1985.
7. G. B. Giannakis, “On the identifiability of non-Gaussian ARMA models using cumulants,” IEEE Trans. Automat. Contr., vol. 35, pp. 18–26, Jan. 1990.
8. D.N. Godard, “Self-recovering equalization and carrier tracking in two-dimensional data communication systems,” IEEE Trans. Commun., vol. COM-28, pp. 1867–1875, Nov. 1980.
9. C. R. Johnson, “Adaptive IIR filtering: Current results and open issues,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 237–250, Mar. 1984.
10. C. R. Johnson, “Admissibility in blind adaptive equalization,” IEEE Control Syst. Mag., vol. 11, pp. 3–15, Jan. 1991.
11. L. Ljung and T. Soderstrom, Theory and Practice of Recursive Identification. Cambridge, MA: MIT Press, 1987.
12. R. W. Lucky, “Automatic Equalization for Digital Communications,” BSTJ, vol. 44, pp. 547–588, Apr. 1965.
13. M. Marden, Geometry of Polynomials. Providence, RI: American Mathematical Society, 1966.
14. N. Nayeri and W. K. Jenkins, “Alternate realizations of adaptive IIR filters and properties of their performance surfaces,” IEEE Trans. Circuits Syst., vol. CAS-36, pp. 485–496, Apr. 1989.
15. O. Shalvi and E. Weinstein, “New criteria for blind deconvolution of non-minimum phase systems (channels),” IEEE Trans. Inform. Theory, vol. 36, pp. 312–321, Mar. 1990.
16. P. Stoica and T. Soderstrom, “Uniqueness of the maximum likelihood estimates of ARMA model parameters—An elementary proof,” IEEE Trans. Automat. Contr., vol. AC-27, pp. 736–738, June 1982.
17. J. K. Tugnait, “Identification of nonminimum phase linear stochastic systems,” Automatica, vol. 22, pp. 457–464, July 1986.
18. S. Vembu, S. Verdu, R.A. Kennedy, and W. Sethares, “Convex cost functions in blind equalization,” Proc. 24th Conf. Inform. Sci. Syst., Baltimore, MD, Mar. 1991, pp. 792–797.
19. S. Verdú, “On the selection of memoryless adaptive laws for blind equalization in binary communications,” Proc. 6th. Int. Conf. Analysis Optimization Syst. Nice, France, June 1984, pp. 239–249.