Incremental refinement of DFT and STFT approximations

Author

Winograd, Joseph M. ; Nawab, S. Hamid

Author_Institution

Dept. of Electr. Comput. & Syst. Eng., Boston Univ., MA, USA

Volume

2

Issue

2

fYear

1995

Firstpage

25

Lastpage

27

Abstract

We present a class of multistage algorithms for carrying out incremental refinement of DFT and STFT approximations. Each stage is designed to improve the previous stage´s approximation in terms of frequency coverage, frequency resolution, and SNR. These algorithms rely almost exclusively on vector summation operations, and they can be designed to exhibit a variety of tradeoffs between improvement in approximation quality and computational cost per stage. The performance of incremental STFT refinement on real data serves to illustrate the relevance of such algorithms to application systems with dynamic real-time constraints.<>

Keywords

approximation theory; discrete Fourier transforms; signal processing; DFT approximations; SNR; STFT approximations; application systems; approximation quality; computational cost; dynamic real-time constraints; frequency coverage; frequency resolution; incremental refinement; multistage algorithms; performance; signal processing; vector summation operations; Algorithm design and analysis; Approximation algorithms; Computational efficiency; Degradation; Discrete Fourier transforms; Fourier transforms; Frequency; Real time systems; Refining; Signal analysis;

fLanguage

English

Journal_Title

Signal Processing Letters, IEEE

Publisher

ieee

ISSN

1070-9908

Type

jour

DOI

10.1109/97.365530

Filename

365530