Referenced Items are not available for this document.
Two recently developed ideas, the conversion of a discrete Fourier transform (DFT) to convolution and the implementation of short convolutions with a minimum of multiplications, are combined to give efficient algorithms for long transforms. Three transform algorithms are compared in terms of the number of multiplications and additions. Timing for a prime factor fast Fourier transform (FFT) algorithm using high-speed convolution, which was programmed for an IBM 370 and an 8080 microprocessor, is presented.
Published in:
Acoustics, Speech and Signal Processing, IEEE Transactions on
(Volume:25
,
Issue:
4
)
Date of Publication: Aug 1977
- Page(s):
- 281 - 294
- ISSN :
- 0096-3518
- Digital Object Identifier :
- 10.1109/TASSP.1977.1162973
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 29 January 2003
- Issue Date :
- Aug 1977
- 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.
