Performance analysis and adaptive Newton algorithms of multimodulus blind equalization criterion

Authors:
Xi-Lin Li;Wen-Jun Zeng
Affiliations:
Department of Automation, Tsinghua University, Beijing 100084, China;Department of Automation, Tsinghua University, Beijing 100084, China
Venue:
Signal Processing
Year:
2009

Citing 7
Cited 2

A feedback approach to the steady-state performance of fractionallyspaced blind adaptive equalizers

IEEE Transactions on Signal Processing
Global convergence of fractionally spaced Godard (CMA) adaptiveequalizers

IEEE Transactions on Signal Processing
Convergence and performance analysis of Godard family and multimodulus algorithms for blind equalization

IEEE Transactions on Signal Processing
Use of the Newton Method for Blind Adaptive Equalization Based on the Constant Modulus Algorithm

IEEE Transactions on Signal Processing - Part II
A Newton-like algorithm for complex variables with applications inblind equalization

IEEE Transactions on Signal Processing
Blind channel approximation: effective channel order determination

IEEE Transactions on Signal Processing
The multimodulus blind equalization and its generalized algorithms

IEEE Journal on Selected Areas in Communications

Equalization and carrier phase recovery of CMA and MMA in blind adaptive receivers

IEEE Transactions on Signal Processing
Blind equalization of square-QAM signals: a multimodulus approach

IEEE Transactions on Communications

Quantified Score

Hi-index	0.08

Visualization

Abstract

This paper studies the stationary points of the multimodulus blind equalization criterion in a noiseless communication channel and proposes two adaptive Newton algorithms. It is shown in this paper that the stationary points of the multimodulus criterion can be grouped into two categories, according to the power of equalizer output. The stationary points having the same equalizer output power with that of the transmitted symbols are desirable global minima, while the stationary points having less equalizer output power than that of the transmitted symbols are saddle points. A pseudo Newton learning algorithm and a full Newton learning algorithm minimizing the multimodulus criterion are proposed. By using the matrix inversion lemma, both Newton algorithms can be efficiently implemented with a computational complexity of O(N^2), where N is the tap length of equalizer. Computer experiment results are presented. It is found that the full Newton algorithm performs well in both static and time-varying communication channels, while the pseudo Newton algorithm performs well only in static communication channels.