Use of the Newton Method for Blind Adaptive Equalization Based on the Constant Modulus Algorithm

We study the applicability of the second-order Newton gradient descent method for blind equalization of complex signals based on the constant modulus algorithm (CMA). The constant modulus (CM) loss function is real with complex valued arguments, and, hence, nonanalytic. We, therefore, use the framework of the Wirtinger calculus to derive a useful and insightful form of the Hessian for noiseless FIR channels and rederive the known fact that the full Hessian of the CM loss function is always singular in a simpler manner. For the implementation of a suboptimum version of Newton algorithm, we give the conditions under which the leading partial Hessian is nonsingular for a noiseless FIR channel model. For this channel model, we show that the perfectly equalizing solutions are stationary points of the CM loss function and also evaluate the leading partial Hessian and the full Hessian at a perfectly equalizing solution. We also discuss regularization of the full Newton method. Finally, some simulation results are given.

[1]  W. Kenneth Jenkins,et al.  A comparison of three algorithms for blind equalization based on the constant modulus error criterion , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[2]  J. Treichler,et al.  A new approach to multipath correction of constant modulus signals , 1983 .

[3]  Y. Sato,et al.  A Method of Self-Recovering Equalization for Multilevel Amplitude-Modulation Systems , 1975, IEEE Trans. Commun..

[4]  Maria D. Miranda,et al.  Tracking issues of some blind equalization algorithms , 2004, IEEE Signal Processing Letters.

[5]  A. Bos Complex gradient and Hessian , 1994 .

[6]  H. Howard Fan,et al.  A Newton-like algorithm for complex variables with applications in blind equalization , 2000, IEEE Trans. Signal Process..

[7]  D. Godard,et al.  Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication Systems , 1980, IEEE Trans. Commun..

[8]  Zhi Ding,et al.  Ill-convergence of Godard blind equalizers in data communication systems , 1991, IEEE Trans. Commun..

[9]  R. Remmert,et al.  Theory of Complex Functions , 1990 .

[10]  W. Kenneth Jenkins,et al.  Designing adaptive equalizers based on the constant modulus error criterion , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[11]  Philip Schniter,et al.  Blind equalization using the constant modulus criterion: a review , 1998, Proc. IEEE.

[12]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[13]  Roberto Cusani,et al.  Convergence analysis of the CMA blind equalizer , 1995, IEEE Trans. Commun..

[14]  Ken Kreutz-Delgado,et al.  The Complex Gradient Operator and the CR-Calculus ECE275A - Lecture Supplement - Fall 2005 , 2009, 0906.4835.

[15]  Onkar Dabeer,et al.  Convergence analysis of the constant modulus algorithm , 2003, IEEE Trans. Inf. Theory.

[16]  Golub Gene H. Et.Al Matrix Computations, 3rd Edition , 2007 .

[17]  B. A. D. H. Brandwood A complex gradient operator and its applica-tion in adaptive array theory , 1983 .