𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A high-performance fast Fourier transform algorithm for the Cray-2

✍ Scribed by David H. Bailey

Publisher
Springer US
Year
1987
Tongue
English
Weight
660 KB
Volume
1
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

✦ Synopsis

Most implementations of a radix-2 fast Fourier transform on large scientific computers use algorithms that involve memory accesses whose strides are powers of two. (The term stride means the memory increment between successive elements stored or fetched.) Such strides are unacceptable for recently developed supercomputers, particularly the Cray-2, because of serious difficulties with memory bank conflicts.

This article describes an algorithm for evaluating the fast Fourier transform that avoids this difficulty and thus could provide the basis for implementations that more fully utilize the power of the Cray-2. A Fortran program implementing this algorithm is included, and timing comparisons with the Cray assembly-coded library subroutine are shown.

πŸ“œ SIMILAR VOLUMES

Adaptation of a fast Fourier transform-b
Adaptation of a fast Fourier transform-based docking algorithm for protein design
✍ Po-Ssu Huang; John J. Love; Stephen L. Mayo πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 333 KB

## Abstract Designing proteins with novel protein/protein binding properties can be achieved by combining the tools that have been developed independently for protein docking and protein design. We describe here the sequence‐independent generation of protein dimer orientations by protein docking fo

Algorithms for solving Hermite interpola
Algorithms for solving Hermite interpolation problems using the Fast Fourier Transform
✍ ElΓ­as Berriochoa; Alicia Cachafeiro πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 297 KB

We present a method for computing the Hermite interpolation polynomial based on equally spaced nodes on the unit circle with an arbitrary number of derivatives in the case of algebraic and Laurent polynomials. It is an adaptation of the method of the Fast Fourier Transform (FFT) for this type of pro