Referenced Items are not available for this document.
A new class of DFT algorithms, so-called C-FFTs, is presented. The radix-K C-FFTs are derived from structures composed of K-point convolutions and K-point DFTs. Radix-3, 4, and 6 C-FFTs have the smallest arithmetical complexities, and in contrast to other existing algorithms, this fact does not depend on the complex number base used. Additionally, the transformation of C-FFTs into algorithms for real-valued data is straightforward. The analysis of radix-6 C-FFTs leads to a refinement of the “split-radix” FFT concept. The refinement can be used for deriving improved radix-K FFTs when K is a product of mutually prime numbers
Published in:
Signal Processing, IEEE Transactions on
(Volume:42
,
Issue:
4
)
Date of Publication: Apr 1994
- Page(s):
- 743 - 750
- ISSN :
- 1053-587X
- INSPEC Accession Number:
- 4704929
- Digital Object Identifier :
- 10.1109/78.285639
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Apr 1994
- 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.
