Subband DFT--Interpretation, accuracy, and computational complexity

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

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

Fingerprint

Discrete Fourier transforms
Computational complexity
Signal flow graphs
Decomposition
Filter banks
Time measurement
Fast Fourier transforms

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Shentov, O. V., Hossen, A. N., Mitra, S. K., & Heute, U. (1991). Subband DFT--Interpretation, accuracy, and computational complexity. In Conference Record - Asilomar Conference on Circuits, Systems & Computers (Vol. 1, pp. 95-100). Publ by Maple Press, Inc.

Subband DFT--Interpretation, accuracy, and computational complexity. / Shentov, Ognjan V.; Hossen, Abdul N.; Mitra, Sanjit K.; Heute, Ulrich.

Conference Record - Asilomar Conference on Circuits, Systems & Computers. Vol. 1 Publ by Maple Press, Inc, 1991. p. 95-100.

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

Shentov, OV, Hossen, AN, Mitra, SK & Heute, U 1991, Subband DFT--Interpretation, accuracy, and computational complexity. in Conference Record - Asilomar Conference on Circuits, Systems & Computers. vol. 1, Publ by Maple Press, Inc, pp. 95-100, 25th Asilomar Conference on Signals, Systems & Computers Part 1 (of 2), Pacific Grove, CA, USA, 11/4/91.
Shentov OV, Hossen AN, Mitra SK, Heute U. Subband DFT--Interpretation, accuracy, and computational complexity. In Conference Record - Asilomar Conference on Circuits, Systems & Computers. Vol. 1. Publ by Maple Press, Inc. 1991. p. 95-100
Shentov, Ognjan V. ; Hossen, Abdul N. ; Mitra, Sanjit K. ; Heute, Ulrich. / Subband DFT--Interpretation, accuracy, and computational complexity. Conference Record - Asilomar Conference on Circuits, Systems & Computers. Vol. 1 Publ by Maple Press, Inc, 1991. pp. 95-100
@inproceedings{606711dd245742948646ea08ff25de66,
title = "Subband DFT--Interpretation, accuracy, and computational complexity",
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.",
author = "Shentov, {Ognjan V.} and Hossen, {Abdul N.} and Mitra, {Sanjit K.} and Ulrich Heute",
year = "1991",
language = "English",
isbn = "0818624701",
volume = "1",
pages = "95--100",
booktitle = "Conference Record - Asilomar Conference on Circuits, Systems & Computers",
publisher = "Publ by Maple Press, Inc",

}

TY - GEN

T1 - Subband DFT--Interpretation, accuracy, and computational complexity

AU - Shentov, Ognjan V.

AU - Hossen, Abdul N.

AU - Mitra, Sanjit K.

AU - Heute, Ulrich

PY - 1991

Y1 - 1991

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

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

UR - http://www.scopus.com/inward/record.url?scp=0026306952&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026306952&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026306952

SN - 0818624701

VL - 1

SP - 95

EP - 100

BT - Conference Record - Asilomar Conference on Circuits, Systems & Computers

PB - Publ by Maple Press, Inc

ER -