Efficient realization of the block frequency domain adaptive filter

In many frequency domain adaptive lters Fast Fourier Fourier Transforms FFTs are used to transform signals which are augmented with zeros The overall computational complexity of these adaptive lters is mainly determined by these windowed FFTs rather than by the ltering operation itself This contribution presents a new way of calculating these windowed FFTs efficiently In addition a method is deduced for implementing nonwindowed FFTs of overlapping input data using the previously mentioned ecient windowed FFTs Also a method is presented for implementing the windowed FFTs in the update part even more efficient