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
T3 - Conference Record - Asilomar Conference on Circuits, Systems & Computers
SP - 95
EP - 100
BT - Conference Record - Asilomar Conference on Circuits, Systems & Computers
PB - Publ by Maple Press, Inc
T2 - 25th Asilomar Conference on Signals, Systems & Computers Part 1 (of 2)
Y2 - 4 November 1991 through 6 November 1991
ER -