By Topic

Generalized sliding FFT and its application to implementation of block LMS adaptive filters

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

2 Author(s)
Farhang-Boroujeny, B. ; Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore ; Gazor, S.

This paper has two contributions. First, the concept of the generalized sliding fast Fourier transform (GSFFT) as an efficient implementation of the hopping FFT is introduced. Application of the GSFFT is broad and not limited to what has been considered in this paper. The frequency domain block LMS (FBLMS) adaptive filters are then revised, and their implementations for block lengths less than the length of the adaptive filter are studied. The GSFFT and the available pruned FFTs are used to give an efficient implementation of these filters. In the particular case of the block length equal to one, where the FBLMS algorithm reduces to the frequency domain LMS (FLMS) algorithm, it is shown that the latter can be implemented with the order of M complexity, where M is the length of the adaptive filter

Published in:

Signal Processing, IEEE Transactions on  (Volume:42 ,  Issue: 3 )