J. Appl. Cryst. (2002). 35, 505 [doi:10.1107/S0021889802008312]
Abstract: The fast Fourier transform (FFT) algorithm as normally formulated allows one to compute the Fourier transform of up to N complex structure factors, F(h), N/2 
h > -N/2, if the transform ![[bold rho]](/logos/entities/rho_bdgif.gif)
(r) is computed on an N-point grid. Most crystallographic FFT programs test the ranges of the Miller indices of the input data to ensure that the total number of grid divisions in the x, y and z directions of the cell is sufficiently large enough to perform the FFT. This note calls attention to a simple remedy whereby an FFT can be used to compute the transform on as coarse a grid as one desires without loss of precision.
Online 18 July 2002
 |   PDF file (29.8 kbytes) |
To open or display or play some files, you may need to set your browser up to use the appropriate software. See the full list of file types for an explanation of the different file types and their related mime types and, where available links to sites from where the appropriate software may be obtained.
The download button will force most browsers to prompt for a file name to store the data on your hard disk.
Where possible, images are represented by thumbnails.
Copyright © International Union of Crystallography
IUCr Webmaster