Evaluating finite Fourier transforms that respect group symmetries
Lisa Auslander, R. W. Johnson, Michael Vulis · Acta Crystallographica Section A Foundations of Crystallography · 1988
A general method for producing efficient algorithms to evaluate finite Fourier transforms that fully utilize symmetry to reduce both computing time and space requirements is described. The method is applicable to all space groups. The resulting algorithms retain the 'N log N' behavior of the fast Fourier transform while reducing the size of the data to approximately an asymmetric unit. The algorithm for the p3 and P3 groups is shown.