By Topic

A step-by-step quasi-Newton algorithm in the frequency domain and its application to adaptive channel equalization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Berberidis, K. ; Dept. of Comput. Eng. & Informatics/R.A.C.T.I., Univ. of Patras, Greece ; Rantos, S. ; Palicot, Jacques

In this paper, a new efficient adaptive filtering algorithm belonging to the Quasi-Newton (QN) family is proposed. In the new algorithm, the involved inverse Hessian matrix is approximated by a proper expansion, consisting of powers of a Toeplitz matrix. Due to this formulation, the algorithm can be implemented in the frequency domain (FD) using the fast Fourier transform (FFT). Efficient recursive relations for the frequency domain quantities updated on a step-by-step basis have been derived. The proposed algorithm turns out to be particularly suitable for adaptive channel equalization in wireless burst transmission systems. Based on this approach, new adaptive linear equalization (LE) and decision feedback equalization (DFE) algorithms have been developed. These algorithms enjoy the combined advantages of QN formulation and FD implementation, exhibiting faster convergence rate than their stochastic gradient counterparts and less computational complexity, as compared with other Newton-type algorithms.

Published in:

Signal Processing, IEEE Transactions on  (Volume:52 ,  Issue: 12 )