A fast Fourier transformation algorithm for parallel computers | Zendy

Raftery J. | Zendy; Sawyer L. | Zendy; Pawley G. S. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A fast Fourier transformation algorithm for parallel computers

Author(s) -

Raftery J.,

Sawyer L.,

Pawley G. S.

Publication year - 1985

Publication title -

journal of applied crystallography

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.429

H-Index - 162

ISSN - 1600-5767

DOI - 10.1107/s0021889885010652

Subject(s) - fast fourier transform , split radix fft algorithm , prime factor fft algorithm , fourier transform , algorithm , cooley–tukey fft algorithm , computer science , phase correlation , discrete fourier transform (general) , rader's fft algorithm , fourier series , transformation (genetics) , fourier analysis , mathematics , mathematical analysis , short time fourier transform , chemistry , biochemistry , gene

A new algorithm is presented for using the fast Fourier transform (FFT) in a very efficient mode. This algorithm is ideal for a parallel computer such as the ICL Distributed Array Processor (DAP), though it can be used with benefit on any serial computer. For a two‐ or three‐dimensional electron density Fourier map the Fourier coefficients are arranged in a one‐dimensional vector form of the chosen length and the whole map is obtained by a single FFT operation. To obtain a higher density of calculated points in the map a number of FFT operations is required, each entailing a phase modification of the one‐dimensional Fourier coefficients. A three‐dimensional map using 1429 crystal reflections and giving the density at 32768 points takes roughly 2 s in the ICL DAP.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research