Blind Channel Equalization with Amplitude Banded Godard and Sato Algorithms
نویسندگان
چکیده
The least-mean-squares (LMS) algorithm which updates the filter coefficients by a stochastic gradient descent approach is the most popular adaptive filtering 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.
منابع مشابه
Convergence and performance analysis of Godard family of blind equalization algorithms
We obtain the convergence of the Godard family (including SATO and CM algorithms) in a unified way. Our assumptions are quite realistic: the channel input can be asymptotically stationary and ergodic, the channel impulse response is finite and can be stationary, ergodic (this models fading channels) and the equalizer length is finite. The noise is i.i.d. The channel input can be discrete or con...
متن کاملIll-convergence of Godard blind equalizers in data communication systems
Godard algorithms form an important class of adaptive blind channel equalization algorithms for QAM transmission. In this paper, the existence of stable undesirable equilibria for the Godard algorithms is demonstrated through a simple AR channel model. These undesirable equilibria correspond to local but nonglobal minima of the underlying mean cost function, and thus permit the ill-convergence ...
متن کاملPerformance Comparison of Blind Equalization Algorithms for Wireless Communication
Adaptive equalization is an accepted method to mitigate the Inter-Symbol Interference (ISI) in wireless communication. Frequently, adaptive algorithm must needs transmission of well-known training sequence to track the time varying characteristics of the channel and hence make the most of superfluous bandwidth. It is also not viable to have training sequences in all types of transmissions (e. g...
متن کاملA Bilinear Approach to Constant Modulus Blind Equalization
Modulus Blind Equalization Constantinos B. Papadias and Dirk T. M. Slock Institut EURECOM, 2229 route des Crêtes, B.P. 193, 06904, Sophia Antipolis Cedex, FRANCE e-mail: [email protected], [email protected] Abstract We consider the problem of blind equalization of a constant modulus signal that is received in the presence of Inter-Symbol-Interference (ISI) and additive noise. A well-known clas...
متن کاملLength- and cost-dependent local minima of unconstrained blind channel equalizers
Baud-rate linear blind equalizers may converge to undesirable stable equilibria due to different mechanisms. One such mechanism is the use of linear FIR filters as equalizers. In this paper, it is shown that this type of local minima exist for all unconstrained blind equalizers whose cost functions satisfy two general conditions. The local minima generated by this mechanism are thus called leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCM
دوره 4 شماره
صفحات -
تاریخ انتشار 2009