Order of N complexity transform domain adaptive filters

Author

Farhang-Boroujeny, B.

Author_Institution

Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore

Volume

42

Issue

7

fYear

1995

fDate

7/1/1995 12:00:00 AM

Firstpage

478

Lastpage

480

Abstract

Implementation of the transform domain adaptive filters is addressed. Recent results have shown that if the input data to a radix-2 fast Fourier transform (FFT) structure is sliding one sample at a time, only N-1 butterflies need to be calculated for updating the FFT structure. This is opposed to most of the previous reports that assume order of NlogN complexity for such implementation. In this correspondence, a generalization of the sliding FFT, which introduces a wide class of orthogonal transforms that can be implemented with the order of N complexity is proposed

Keywords

adaptive filters; computational complexity; digital filters; fast Fourier transforms; filtering theory; fast Fourier transform; order of N complexity; orthogonal transforms; radix-2 FFT structure; sliding FFT; transform domain adaptive filters; Adaptive filters; Computational complexity; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Least squares approximation; Output feedback; Quantization; Robustness;

fLanguage

English

Journal_Title

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7130

Type

jour

DOI

10.1109/82.401172

Filename

401172