Abstract—The least-mean-squares (LMS) algorithm which updates the ﬁlter coefﬁcients by a stochastic gradient descent approach is the most popular adaptive ﬁltering one. In this paper we propose a novel amplitude banded (AB) technique with LMS on Godard (ABGodard) and Sato (ABSato) algorithms for the equalization of communication channels. The non-linear properties of the AB technique with LMS algorithm are inherited into the ABGodard and ABSato algorithms, resulting in an improvement of equalization performance. These properties are validated from a signal separation aspect based on decision boundary. Mean square error (MSE) and bit error rate (BER) are investigated on several communication channel models. Observations on simulations show that the ABGodard and ABSato algorithms provide better performance than the standard Godard and Sato algorithms, respectively, and that the ABSato algorithm is superior to the ABGodard algorithm. As the division number used for the AB technique is increased, the MSE and BER performances of the ABSato algorithm are improved. A parallel structure of the Sato and ABSato algorithms provides a further improvement of the MSE and BER performances.
Index Terms—Least-Mean-Squares, Non-linear Adaptive Algorithm, ABGodard Algorithm, ABSato Algorithm, Blind Equalization
Cite:Muhammad Lutfor Rahman Khan, Mohammed H. Wondimagegnehu and Tetsuya Shimamura, "Blind Channel Equalization with Amplitude Banded Godard and Sato Algorithms," Journal of Communications, vol. 4, no.6, pp.3888-395, 2009.
Copyright © 2013-2020 Journal of Communications, All Rights Reserved