Improved Blind Equalization Algorithm and Simulation

Article Preview

Abstract:

This paper focuses on the constant modulus Busgang blind equalization algorithm (CMA blind equalization algorithm in Constant, The Modulus Algorithm). Analysis of the convergence performance of the traditional CMA blind equalization algorithm, the fixed step size, convergence speed and convergence of mutual constraint between the precision of its application under great restrictions is demonstrated in the paper. In order to solve this contradiction, this paper presents a CMA blind equalization algorithm based on the mean square error (MSE Mean Square Error).

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1645-1648

Citation:

Online since:

June 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Li Y,Ding Z.Global convergence of fractionally spaced Godard CMA adaptive equalizer[J]. IEEE Trans on signal processing, 1996:44:818-826

DOI: 10.1109/78.492535

Google Scholar

[2] Zheng F C. Cumulant based convolution and identification: several new families of linear equalizers[ J].Signal Processing,1993,30:199-219

DOI: 10.1016/0165-1684(93)90147-3

Google Scholar

[3] Godard D N. Self-recovering equalization and carrier tracking two-dimensional data communication systems. I Transactions on Communications, 1980, 28(11): 867-183

DOI: 10.1109/tcom.1980.1094608

Google Scholar

[4] Tong L, Xu G, and Kailath T. Blind identification equalization based on second-order statistics: A time do approach. IEEE Transactions on Information Theory, 140(2):340-349.

DOI: 10.1109/18.312157

Google Scholar

[5] Naveed A,Qureshi I M, and Hussain A, et al. Blind equalization of communication channels for equal energy sources: Energy matching approach. Electronics Letters, 42 (4): 247-248.

DOI: 10.1049/el:20062983

Google Scholar

[6] Zarzoso V and Comon P. Optimal step-size constant modulusalgorithm. IEEE Transactions on Communications, 2008, 56(1):10-13.

DOI: 10.1109/tcomm.2008.050484

Google Scholar