Access Restriction

Author Singleton, Richard C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Complex fourier transform ♦ Fast fourier transform ♦ Virtual core memory ♦ Permutation ♦ Orthogonal polynomials ♦ Multivariate fourier transform ♦ Harmonic analysis ♦ Fourier series ♦ Orthogonal transformation ♦ Spectral analysis
Abstract The following procedures are based on the Cooley-Tukey algorithm [1] for computing the finite Fourier transform of a complex data vector; the dimension of the data vector is assumed here to be a power of two. Procedure COMPLEXTRANSFORM computes either the complex Fourier transform or its inverse. Procedure REALTRANSFORM computes either the Fourier coefficients of a sequence of real data points or evaluates a Fourier series with given cosine and sine coefficients. The number of arithmetic operations for either procedure is proportional to n log2 n, where n is the number of data points.
Description Affiliation: Stanford Research Institute, Menlo Park, CA (Singleton, Richard C.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 11
Issue Number 11
Page Count 4
Starting Page 773
Ending Page 776

Open content in new tab

   Open content in new tab
Source: ACM Digital Library