Referenced Items are not available for this document.
This paper presents a general split-radix algorithm which can flexibly compute the discrete Fourier transforms (DFT) of length q*2m where q is an odd integer. Comparisons with previously reported algorithms show that substantial savings on arithmetic operations can be made. Furthermore, a wider range of choices on different sequence lengths is naturally provided
Published in:
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
(Volume:45
,
Issue:
6
)
Date of Publication: Jun 1998
- Page(s):
- 685 - 690
- ISSN :
- 1057-7130
- INSPEC Accession Number:
- 5957724
- Digital Object Identifier :
- 10.1109/82.686687
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jun 1998
- Sponsored by :
- IEEE Circuits and Systems 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.
