On computing the fast Fourier transform

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On computing the fast Fourier transform

Full text

Pdf (1.11 MB)

Source

Communications of the ACM archive
Volume 10 , Issue 10 (October 1967) table of contents

Pages: 647 - 654

Year of Publication: 1967

ISSN:0001-0782

Author

Richard C. Singleton

Stanford Research Institute, Menlo Park, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 121, Citation Count: 14

Additional Information:

references cited by 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/363717.363771 What is a DOI?

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	Richard W Hamming, Numerical methods for scientists and engineers (2nd ed.), Dover Publications, Inc., New York, NY, 1986
	2	GOERTZEL, G. An algorithm for the evaluation of finite trigonometric series. Am. Math. Monthly 65 (Jan. 1958), 34- 35.
	3	COOLEY, J. W., LEWIS, P. A. W., AND WELCH, P. D. Historical notes oa the fast Fourier transform. IEEE Trans. Audio Electroacoustics AU-15, 2 (June 1967), 76-79.
	4	DANIELSON, G. C., AND LANCZOS, C. Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids. J. Franklin Inst. 233 (1942), 365- 38O; 435-452.
	5	RUDNICK, P. Note on the calculation of Fourier series. Math. Comput. 20, 95 (July 1966), 429-430.
	6	GOOD, I. J. The interaction algorithm and practical Fourier series. J. Roy. Statist. Soc. Ser. B, 20 (1958), 361-372; Addendum, 22 (1960), 372-375.
	7	COOLEY, J. W., AND TUKEY, J. W. An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 90 (April 1965), 297-301.
	8	GENTLEMAN, W. M., AND SANDE, G. Fast Fourier transforms-for fun and profit. Proc. AFIPS 1966 Fall Joint Comput. Conf., Vol. 29, pp. 563-578,
	9	SINGLETON, R. C. An ALGOL convolution procedure based on the fast Fourier transform. SRI Project 181531-132, Stanford Res. Inst., Menlo Park, Calif., Jan. 1967, Defense Doc. Ctr. AD-646 628.
	10	COOLEY, J. W. Harmonic analysis complex Fourier series. SHARE Program library No. SDA 3425, Feb. 7, 1966.
	11	BINGHAM, C., GODFREY, M. D., AND TUKEY, J. W. Modern techniques of power spectral estimation. IEEE Trans. Audio Electroacoustics AU-15, 2 (June 1967), 56-66.
	12	SINGLETON, R. C. A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage. IEEE Trans. Audio Electroacoustics AU-15, 2 (June 1967) 91-98.
	13	SINGLETON, R. C. ALGOL procedures for the fast Fourier transform. SRI Project 181531-132, Stanford Res. Inst., Menlo Park, Calif., Nov. 1966, Defense Doc. Ctr. AD-643 996.
	14	SINGLETON, R. C. An ALGOL procedure for the fast Fourier transform with arbitrary factors. SRI Project 181531-132, Stanford Res. Inst., Menlo Park, Calif., Dec. 1966, Defense Doc. Ctr. AD-643 997.

CITED BY 14

	J. Morris, ACM Algorithm 346: F-Test Probabilities, Communications of the ACM, v.12 n.3, p.184-185, March 1969
	Richard C. Singleton, Remark on algorithm 339 [C6]: an algol procedure for the fast Fourier transform with arbitrary factors, Communications of the ACM, v.12 n.3, p.187, March 1969
	Robert A. Wagner, The Boolean Vector Machine [BVM], ACM SIGARCH Computer Architecture News, v.11 n.3, p.59-66, June 1983
	Glenn D. Bergland, Numerical Analysis: A fast fourier transform algorithm for real-valued series, Communications of the ACM, v.11 n.10, p.703-710, Oct. 1968
	Forest Baskett , Alan Jay Smith, Interference in multiprocessor computer systems with interleaved memory, Communications of the ACM, v.19 n.6, p.327-334, June 1976
	Richard C. Singleton, Algorithms: Algorithm 339: an algol procedure for the fast Fourier transform with arbitrary factors, Communications of the ACM, v.11 n.11, p.776-779, Nov. 68
	Robert T. Moenck, Practical fast polynomial multiplication, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.136-148, August 10-12, 1976, Yorktown Heights, New York, United States
	Richard C. Singleton, Algorithms: Algorithm 338: algol procedures for the fast Fourier transform, Communications of the ACM, v.11 n.11, p.773-776, Nov. 68
	E. G. Coffman , L. C. Varian, Further experimental data on the behavior of programs in a paging environment, Communications of the ACM, v.11 n.7, p.471-474, July 1968
	G. Miel, Constant Geometry Fast Fourier Transforms on Array Processors, IEEE Transactions on Computers, v.42 n.3, p.371-375, March 1993
	Richard C. Singleton, Algorithm 345: an algol convolution procedure based on the fast Fourier transform [C6], Communications of the ACM, v.12 n.3, p.179-184, March 1969
	Arvid G. Larson , Richard C. Singleton, Real-time spectral analysis on a small general-purpose computer, Proceedings of the November 14-16, 1967, fall joint computer conference, November 14-16, 1967, Anaheim, California
	Feng Zhou , Peter Kornerup, A New Fast Discrete Fourier Transform, Journal of VLSI Signal Processing Systems, v.20 n.3, p.219-232, Dec. 1998
	V. G. Vassiliadis , A. G. Rigas, A semi-parametric test based on a quasi-likelihood approach for comparing the estimated spectra of two neural spike trains, Neurocomputing, v.72 n.13-15, p.3212-3219, August, 2009