| Algorithm 345: an algol convolution procedure based on the fast Fourier transform [C6] |
| Full text |
 Pdf
(964 KB)
|
Source
|
Communications of the ACM
archive
Volume 12 , Issue 3 (March 1969)
table of contents
Pages: 179 - 184
Year of Publication: 1969
ISSN:0001-0782
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 13, Citation Count: 0
|
|
|
 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
|
BERGLAND, G. D. A fast Fourier transform algorithm using base 8 iterations. Math. Comput. 22, 102 (Apr. 1968), 275-279.
|
| |
2
|
COOLEY, J. W., AND TUKEY, J. W. An algorithm for the machine calculation of complex Fourier series. Math. Cornput. 19, 90 (Apr. 1965), 297-301.
|
| |
3
|
GENTLEMAN, W. G., AND SANDE, G. Fast Fourier transforms-for fun and profit. Proc. AFIPS 1966 Fall Joint Comput. Conf., Vol. 29, Spartan Books, New York, 1966, pp. 563-578.
|
 |
4
|
|
| |
5
|
|
| |
6
|
STOCKHAM, T .G . High-speed convolution and correlation. Proc. AFIPS 1966 Spring Joint Comput. Conf., Vol. 28, Spartan Books, New York, 1966, pp. 229-233.
|
INDEX TERMS
Primary Classification:
F.
Theory of Computation
F.2
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.1
Numerical Algorithms and Problems
Subjects:
Computation of transforms (e.g., fast Fourier transform)
General Terms:
Algorithms,
Design,
Theory
Keywords:
Fourier series,
autocorrelation,
autocovariance,
complex Fourier transform,
convolution,
cross-correlation,
digital filtering,
fastFourier transform,
harmonic analysis,
multivariate Fourier transform,
orthogonal polynomials,
orthogonal transformation,
permutation,
spectral analysis
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
