Premium
FAST : a compact general crystallographic fast Fourier transform (FFT)
Author(s) -
Langs D. A.
Publication year - 1996
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/s0021889896003056
Subject(s) - fast fourier transform , fourier transform , fourier transform infrared spectroscopy , split radix fft algorithm , materials science , computer science , crystallography , physics , optics , fourier analysis , algorithm , chemistry , short time fourier transform , quantum mechanics
A space‐group‐general radix‐2 crystallographic fast Fourier transform (FFT) has been written in only 130 lines of executable Fortran code. Computational times compare favorably with other FFT programs that require 1000 or more lines of code excluding peak‐interpolation routines. The complete program and description of control parameters are given. The program is dimensioned to a maximum grid size of 128 3 points and a Miller‐index range of ±60. These arrays may be altered by simply changing the values of NPAR and MH in the PARAMETER statements of the program.