Algorithm 545: An Optimized Mass Storage FFT [C6]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 545: An Optimized Mass Storage FFT [C6]

Full text

Pdf (1.14 MB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 5 , Issue 4 (December 1979) table of contents

Pages: 500 - 517

Year of Publication: 1979

ISSN:0098-3500

Author

Donald Fraser

Division of Computing Research, CSIRO, P.O. Box 1800, Canberra City, ACT 2601, Australia

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 19, Citation Count: 0

Additional Information:

appendices and supplements references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355853.355867 What is a DOI?

APPENDICES and SUPPLEMENTS

CMFFT and RMFFT (545.gz) (19 KB)

computing real and complex fast Fourier transforms, minimizing I/O
Gams: J1a1,J1a2,J1b

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BRENNER, N M. FOR2D. Program 360D-13.4.007, SHARE Program Library Agency, 1969.
	2	COCHRAN, W.T., ET AL., What is the fast Fourier transform? IEEE Trans. Audio Electroacoust. AU-15, 2 (June 1967), 45-55.
	3	COOLEY, J.W., AND TUKEY, J.W. An algorithm for the machine calculation of complex Fourier series. Math Comput 19 (April 1965), 297-301.
	4	COOLEY, J.W., ET AL., The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine, and Laplace transforms. J. Sound V~b. 12 (July 1970), 315-337.
	5	DELOTTO, i., AND DOTTI, D. A new procedure for optimum mass storage use in FT algorithms. Alta Freq. 42, 8 (Aug. 1973), 379-384.
	6	DELOTTO, I., AND DOTTI, D. Two-dimensional transforms by minicomputer without matrix transposing. Comp Graphzcs Image Processing 4 (Oct 1975), 271-278.
	7	EKLUNDH, J.O. A fast computer method for matrix transposing IEEE Trans. Comptr. C-21, 7 (July 1972), 801-803.
	8	Donald Fraser, Array Permutation by Index-Digit Permutation, Journal of the ACM (JACM), v.23 n.2, p.298-309, April 1976 [doi>10.1145/321941.321949]
	9	SINGLETON, R.C. A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage IEEE Trans. Audio Electroacoust. A U-15, 2 (June 1967), 91-98.