Abstract
The decimation-in-time radix-2, radix-4, split-ra- dix, and radix-8 algorithms, presented in a paper by Linzer and Feig (5), are described in detail. These algorithms compute discrete Fourier transforms (DFT's) on input sequences with lengths that are powers of with fewer multiply-adds than tra- ditional Cooley-Tukey algorithms. The descriptions given pro- vide the needed details to implement these algorithms efficiently in a computer program that could compute DFT's on a length 2 sequence for general m. We describe and give timing results for a radix-4 version that we have implemented on the RS/6000 workstation. The timing results show that a substantial saving in execution time is obtained when the new radix-4 FFT is used instead of a standard Cooley-Tukey radix-4 FFT. Finally, we present a set of experiments that suggest that numerical behav- ior of the new algorithms is slightly better than the numerical behavior of Cooley-Tukey FFT's.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
