Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12464
Title: Nesting algorithm for very fast discrete Fourier transforms
Authors: Siu, WC 
Issue Date: 1988
Publisher: IEEE
Source: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 1988, p. 1898-1901 How to cite?
Abstract: The use of a nesting discrete Fourier transform technique to compute discrete Fourier transforms is proposed. This technique only relies on two primitive modules and other modules are generated by a standard nestin procedure. The speed of computation of this approach is comparable to the speed of computation for the WFTA, whereas the program size of the present approach is smaller than that of the WFTA. This approach is most suitable for cases where there are restrictions on memory size.
Description: ICASSP '88: 1988 International Conference on Acoustics, Speech, and Signal Processing. V 1, Speech Processing; v 2, Multidimensional Signal Processing; v 3, Digital Signal Processing; v 4, VLSI Spectral Estimation; v 5, Audio & Electroacoustics, New York, NY, USA
URI: http://hdl.handle.net/10397/12464
ISSN: 0736-7791
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Oct 2, 2017

Page view(s)

106
Last Week
1
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.