Referenced Items are not available for this document.
We consider the problem of computing the DFT and present two reductions over the standard formula. In the special case of an N-point sequence with N = 2l, the number of multiplications per output point required by this algorithm is, at most, N/4 - 1 and, on the average, N/6 - 1. Each output point requires no more than N - 1 additions. In applications requiring only some of the output points, a computational savings over the standard (FFT) techniques may be achieved. Furthermore, we argue that in a certain sense these reductions are optimal.
Published in:
Acoustics, Speech and Signal Processing, IEEE Transactions on
(Volume:34
,
Issue:
6
)
Date of Publication: Dec 1986
- Page(s):
- 1658 - 1659
- ISSN :
- 0096-3518
- Digital Object Identifier :
- 10.1109/TASSP.1986.1164967
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 29 January 2003
- Issue Date :
- Dec 1986
- 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.
