Efficient realization of the block frequency domain adaptive filter

D.W.E. Schobben; G.P.M. Egelmeers; P.C.W. Sommen

Efficient realization of the block frequency domain adaptive filter

D.W.E. Schobben, G.P.M. Egelmeers, P.C.W. Sommen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

221 Downloads (Pure)

Abstract

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.

Original language	English
Title of host publication	Proc. ICASSP 97, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing
Place of Publication	Los Alamitos, CA
Publisher	IEEE Computer Society
Pages	2257-2260
ISBN (Print)	0-8186-7919-0
Publication status	Published - 1997
Event	1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997) - Munich, Germany Duration: 21 Apr 1997 → 24 Apr 1997

Conference

Conference	1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997)
Abbreviated title	ICASSP 1997
Country/Territory	Germany
City	Munich
Period	21/04/97 → 24/04/97

Access to Document

590796158047606Final author version , 141 KB

Cite this

@inproceedings{e0fcc50bb24b4691a28d4bba88b9f5b8,

title = "Efficient realization of the block frequency domain adaptive filter",

abstract = "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.",

author = "D.W.E. Schobben and G.P.M. Egelmeers and P.C.W. Sommen",

year = "1997",

language = "English",

isbn = "0-8186-7919-0",

pages = "2257--2260",

booktitle = "Proc. ICASSP 97, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing",

publisher = "IEEE Computer Society",

address = "United States",

note = "1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997), ICASSP 1997 ; Conference date: 21-04-1997 Through 24-04-1997",

}

Schobben, DWE, Egelmeers, GPM & Sommen, PCW 1997, Efficient realization of the block frequency domain adaptive filter. in Proc. ICASSP 97, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE Computer Society, Los Alamitos, CA, pp. 2257-2260, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997), Munich, Bavaria, Germany, 21/04/97.

Efficient realization of the block frequency domain adaptive filter. / Schobben, D.W.E.; Egelmeers, G.P.M.; Sommen, P.C.W.
Proc. ICASSP 97, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing. Los Alamitos, CA: IEEE Computer Society, 1997. p. 2257-2260.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Efficient realization of the block frequency domain adaptive filter

AU - Schobben, D.W.E.

AU - Egelmeers, G.P.M.

AU - Sommen, P.C.W.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

M3 - Conference contribution

SN - 0-8186-7919-0

SP - 2257

EP - 2260

BT - Proc. ICASSP 97, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing

PB - IEEE Computer Society

CY - Los Alamitos, CA

T2 - 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997)

Y2 - 21 April 1997 through 24 April 1997

ER -

Efficient realization of the block frequency domain adaptive filter

Abstract

Conference

Access to Document

Fingerprint

Cite this