Referenced Items are not available for this document.
This correspondence presents details of a new implementation of the prime factor FFT algorithm (PFA) for computing the discrete Fourier transform (DFT). This implementation applies a program generation technique to the PFA algorithm and saves about 40 percent of the execution time of the conventional one.
Published in:
Acoustics, Speech and Signal Processing, IEEE Transactions on
(Volume:35
,
Issue:
8
)
Date of Publication: Aug 1987
- Page(s):
- 1221 - 1223
- ISSN :
- 0096-3518
- Digital Object Identifier :
- 10.1109/TASSP.1987.1165265
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 29 January 2003
- Issue Date :
- Aug 1987
- Sponsored by :
- IEEE Signal Processing Society
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.
