Referenced Items are not available for this document.
The problem of comparing different algorithms for the execution of the fast Fourier transform (FFT) is considered. Instead of counting the required arithmetic operations, the necessary number of instruction cycles for an FFT implementation on different digital signal processors (DSPs) is used as a measure. It turns out that this more practical figure of merit yields a rather different valuation of the algorithms. Furthermore, a method to halve the table size for the radix-2 twiddle factors is described. Some new FFT programs for execution on DSPs are compared with programs provided by the manufacturers
Published in:
Acoustics, Speech, and Signal Processing, 1990. ICASSP-90., 1990 International Conference on
Date of Conference: 3-6 Apr 1990
- Page(s):
- 1503 - 1506 vol.3
- Meeting Date :
- 03 Apr 1990-06 Apr 1990
- ISSN :
- 1520-6149
- INSPEC Accession Number:
- 3864330
- Conference Location :
- Albuquerque, NM
- Digital Object Identifier :
- 10.1109/ICASSP.1990.115692
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
