Fast and low complexity blind equalization via subgradient projections

IEEE Transactions on Signal Processing

Volumn 53, Issue 7, 2005, Pages 2513-2524

  Erdogan, Alper Tunga ^a   Kizilkale, Can ^a  

^a KOÇ UNIVERSITY   (Turkey)

Author keywords

Blind equalization; Convex optimization; Subgradient

Indexed keywords

BLIND SOURCE SEPARATION; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ITERATIVE METHODS; LINEAR EQUATIONS; OPTIMIZATION; STATISTICAL METHODS;

BLIND EQUALIZATION; CONSTANT MODULUS ALGORITHM (CMA); CONVEX OPTIMIZATION; COST FUNCTIONS; SUBGRADIENT PROJECTIONS;

SIGNAL PROCESSING;

EID: 23844436275     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2005.849195     Document Type: Article

References (42)

1. D. Hatzinakos and C. L. Nikias, "Blind equalization using a trispectrum based algorithm," IEEE Trans. Commun., vol. 39, no. 5, pp. 669-681, May 1991.
2. B. Porat and B. Friedlander, "Blind equalization of digital communications channels using higher order moments," in IEEE Trans. Acoust., Speech, Signal Process., vol. 39, Feb. 1991, pp. 522-526.
3. J. Tugnait, "Blind equalization and estimation of FIR communications channels using fractional sampling," IEEE Trans. Commun., vol. 44, no. 3, pp. 324-336, Mar. 1996.
4. J. Tugnait, "Self-recovering equalization and carrier tracking in two-dimensional data communication systems," IEEE Trans. Commun., vol. COM-28, no. 11, pp. 1867-1875, Nov. 1980.
5. C. Johnson, J. Schniter, T. Endres, J. Behm, R. Casas, V. Brown, and C. Berg, "Blind equalization using the constant modulus criterion: A review," in Proc. IEEE, Special Issue on Blind System Identification and Estimation, vol. 47, Jun. 1998, pp. 1927-1950.
6. H. Liu, G. Xu, L. Tong, and T. Kailath, "Recent developments in blind channel equalization: From cyclostationarity to subspaces," Signal Process., vol. 50, pp. 83-99, Apr. 1996.
7. E. Moulines, P. Duhamel, J. Cardoso, and S. Mayrargue, "Subspace methods for the blind identification of multichannel FIR filters," IEEE Trans. Signal Process., vol. 43, no. 2, pp. 516-525, Feb. 1995.
8. W. Sethares, G. A. Rey, and C. Johnson, "Approaches to blind equalization of signals with multiple modulus," in Proc. ICASSP, vol. 2, 1989, pp. 972-975.
9. C. Papadias and D. Slock, "On the decision-directed equalization of constant modulus signals," in Proc. 28th Asilomar Conf. Signals, Syst., Comput., vol. 2, 1994, pp. 1423-1427.
10. T.-H. Li, "Finite-alphabet information and multivariate blind deconvolution and identification of linear systems," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 330-337, Jan. 2003.
11. A. van der Veen, S. Talwar, and A. Paulraj, "Blind identification of FIR channels carrying multiple finite alphabet signals," in Proc. ICASSP, vol. 2, 1995, pp. 1213-1216.
12. L. Tong and S. Perreau, "Multichannel blind identification: From subspace to maximum likelihood methods," Proc. IEEE, vol. 86, no. 10, pp. 1951-1968, Oct. 1998.
13. Z. Ding and C. R. Johnson, "On the nonvanishing stability of undesirable equilibria for FIR Godard blind equalizers," IEEE Trans. Signal Process., vol. 41, no. 5, pp. 1940-1944, May 1993.
14. S. Lambotharan, J. Chambers, and C. R. Johnson, "Attraction of saddles and slow convergence in CMA adaptation," Signal Process., vol. 59, pp. 335-340, Jun. 1997.
15. O. Shalvi and E. Weinstein, "Super-exponential methods for blind deconvolution," IEEE Trans. Inf. Theory, vol. 39, no. 2, pp. 504-519, Mar. 1993.
16. M. Mboup and P. Regalia, "A gradient search interpretation of the super-exponential algorithm," IEEE Trans. Inf. Theory, vol. 46, no. 6, pp. 2731-2734, Nov. 2000.
17. P. Regalia and M. Mboup, "Undermodeled equalization: A characterization of stationary points for a family of blind criteria," IEEE Trans. Signal Process., vol. 47, no. 3, pp. 760-770, Mar. 1999.
18. S. Vembu, S. Verdu, R. Kennedy, and W. Sethares, "Convex cost functions in blind equalization," IEEE Trans. Signal Process., vol. 42, no. 8, pp. 1952-1960, Aug. 1994.
19. Z. Ding and Z. Luo, "A fast linear programming algorithm for blind equalization," in IEEE Trans. Commun., vol. 48, Sep. 2000, pp. 1432-1436.
20. Z.-Q. Luo, M. Meng, K. M. Wong, and J.-K. Zhang, "A fractionally spaced blind equalizer based on linear programming," IEEE Trans. Signal Process., vol. 50, no. 7, pp. 1650-1660, Jul. 2002.
21. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1999.
22. J.-B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms I. New York: Springer-Verlag, 1996.
23. O. Shalvi and E. Weinstein, "New criteria for blind deconvolution of nonminimum phase systems (channels)," IEEE Trans. Inf. Theory, vol. 36, no. 2, pp. 312-321, Mar. 1990.
24. Y. Li and Z. Ding, "Global convergence of fractionally spaced Godard (cma) adaptive equalizers," IEEE Trans. Signal Process., vol. 44, no. 4, pp. 818-826, Apr. 1996.
25. G. A. Watson, "Approximation in normed linear spaces," J. Comput. Applied Math., vol. 121, pp. 1-36, Sept. 2000.
26. S. Haykin, Adaptive Filter Theory. Englewood Cliffs, NJ: Prentice-Hall, 2002.
27. A. H. Sayed, Fundamentals of Adaptive Filtering. New York: Wiley, 2003.
28. B. T. Polyak, "A general method for solving extremal problems," Doklady Akademii Nauk SSSR, vol. 174, pp. 33-36, 1967.
29. N. Shor, Minimization Methods for Nondifferentiable Functions. New York: Springer-Verlag, 1985.
30. A. Nedic and D. Bertsekas, "Convergence rate of incremental subgradient algorithms," in Stochastic Optimization: Algorithms and Applications, S. Ursayev and P. M. Pardalos, Eds. Boston, MA: Kluwer, 2000.
31. U. Brannlund, "On Relaxation Methods for Nonsmooth Convex Optimization," Ph.D. Thesis, Dept. Math., R. Inst. Technol., Stockholm, Sweden, 1993.
32. J. Goffin, "On convergence rates of subgradient optimization methods," Math. Programming, vol. 13, pp. 329-347, May 1977.
33. M. Held, P. Wolfe, and H. Crowder, "Validation of subgradient optimization," Math. Programming, vol. 6, pp. 62-88, Feb. 1974.
34. B. Polyak, "Minimization of unsmooth functionals," USSR Comput. Math. Phys., vol. 9, pp. 509-521, 1969.
35. E. Allen, R. Helgason, J. Kennington, and B. Shetty, "A generalization of Polyak's convergence result for subgradient optimization," Math. Programming, vol. 37, pp. 309-317, May 1987.
36. M. Bazaraa and H. Sherali, "On the choice of step size in subgradient optimization," Eur J. Oper. Res., vol. 7, pp. 380-388, Aug. 1981.
37. S. Kim, H. Ahn, and S.-C. Cho, "Variable target value subgradient method," Math. Programming, vol. 49, pp. 359-369, Jan. 1991.
38. J. Goffin and K. Kiwiel, "Convergence of a simple subgradient level method," Math. Programming, vol. 85, no. 1, pp. 207-211, 1999.
39. H. Sherali, G. Choi, and C. Tuncbilek, "Variable target value method for nondifferentiable optimization," Oper. Res. Lett., vol. 26, pp. 1-8, Feb. 2000.
40. D. A. Spielman and S.-H. Teng, "Smoothed analysis of termination of linear programming algorithms," Math. Programming, vol. 97, pp. 375-404, Jul. 2003.
41. C. Papadias, "Methods for Blind Equalization and Identification of Linear Channels," Ph.D. dissertation, EUROCOM Inst., Roissy en Brie, France, 1995.
42. G.shdsl: Symmetric High-Bitrate Digital Subscriber Line Standard, 2001. ITU-T.