Abstract
Recent developments in algorithm design have made the Fast Fourier Transform even faster. We described the implementation on the CRAY-1 of a prime factor FFT algorithm which adapts some of these developments to a vector-processing scientific computer. Comparative times are given for the new and old versions of the FFT algorithm, applied to the problem of performing multiple simultaneous complex transforms. It is shown that worthwhile gains are obtained in both speed and storage requiremennts. The new algorithm is also vectorizable in the more difficult cases of a single transform. Finally, we use timing measurements of the new routine to estimate the value on the CRAY-1 of Hockney's parameter n 1 2 , which characterizes a computer in terms of its apparent degree of parallelism.
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.
