A fast Fourier transform compiler
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
A New Prime Edge Length Crystallographic FFT
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
A fast Fourier transform compiler
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Design and implementation of a parallel prime edge-length symmetric FFT
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
A parallel prime edge-length crystallographic FFT
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Hi-index | 0.00 |
Determining the structure of a crystal by X-ray methods requires repeated computation of the three-dimensional Fourier transform. Over the last few years, algorithms for computing finite Fourier transforms that take advantage of various crystal symmetries have been developed. These algorithms are efficient especially when the sampling space contains a prime number of points in each coordinate direction. In this work, we present a method of combining programs for two relatively prime integers p and q to obtain a program for sampling space containing p . q number of points in each coordinate direction.