Abstract
The author shows that prime factor FFT algorithms offer little improvement over conventional FFT algorithms on computers such as the Cray-1 and Cyber 205 where the multiplications can be performed in parallel with the additions. A very modest gain may be obtained by using Good's algorithm (1958) with conventional small-n transforms. Winograd's technique (1978), despite its impressive reduction in the number of multiplications, is likely to be slower than the conventional algorithm, particularly on the Cray-1, where memory transfers will dominate the computation. 13 references.
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.
