Author:
Seguel Jaime,Bollman Dorothy,Orozco Edusmildo
Publisher
Springer Berlin Heidelberg
Reference5 articles.
1. L. Auslander, and M. Shenefelt, Fourier transforms that respect crystallogaphic sym-metries, IBM J. Res. and Dev., 31, (1987), pp. 213–223.
2. M. An, J. W. Cooley, and R. Tolimeri, Factorization methods for crystallographic Fourier transforms, Advances in Appl. Math., 11 (1990), pp. 358–371.
3. J. Cooley, and J. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comp., 19 (1965), pp. 297–301.
4. B. Elspas, The Theory of Autonomous Linear Sequential Networks, Linear Sequential Switching Circuits, ed. W. Kautz, Holden-Day inc., 1965, 21–61.
5. M. Frigo, S. G. Johnson An adaptive software architecture for the FFT ICASSP Conference Proceedings, 3 (1998), pp 1381–1384.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimizing Symmetric FFTs with Prime Edge-Length;Computational Science and Its Applications – ICCSA 2004;2004
2. A Scalable Crystallographic FFT;Recent Advances in Parallel Virtual Machine and Message Passing Interface;2003
3. A Parallel Prime Edge-Length Crystallographic FFT;Lecture Notes in Computer Science;2003
4. Design and Implementation of a Parallel Prime Edge-Length Symmetric FFT;Computational Science and Its Applications — ICCSA 2003;2003