Subband DFT--Interpretation, accuracy, and computational complexity

Ognjan V. Shentov*, Abdul N. Hossen, Sanjit K. Mitra, Ulrich Heute

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

A detailed analysis of a newly proposed fast Fourier transform (FFT) type algorithm is presented. Several variants are introduced in the form of signal-flow graph (SFG) descriptions. The main characteristic of the approach is the frequency-separation property of the subsequences involved in the decomposition process. A novel filter-bank interpretation of the procedure is presented, allowing understanding of the errors occurring in the method's use for an appropriate partial-band transform. These errors are studied in depth to obtain general formulas describing their nature, whatever the number and type of decomposition stages might be. The computational complexity of the algorithm is analyzed both theoretically and in terms of running-time measurements. With these insights, the novel algorithm is compared to existing methods, especially for the computation of a limited number of frequency points. Previously reported complexity estimates are refined and extended.

Original languageEnglish
Title of host publicationConference Record - Asilomar Conference on Circuits, Systems & Computers
PublisherPubl by Maple Press, Inc
Pages95-100
Number of pages6
Volume1
ISBN (Print)0818624701
Publication statusPublished - 1991
Event25th Asilomar Conference on Signals, Systems & Computers Part 1 (of 2) - Pacific Grove, CA, USA
Duration: Nov 4 1991Nov 6 1991

Other

Other25th Asilomar Conference on Signals, Systems & Computers Part 1 (of 2)
CityPacific Grove, CA, USA
Period11/4/9111/6/91

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Subband DFT--Interpretation, accuracy, and computational complexity'. Together they form a unique fingerprint.

Cite this