DocumentCode
1107912
Title
The Relationship Between Two Fast Fourier Transforms
Author
Good, I.J.
Issue
3
fYear
1971
fDate
3/1/1971 12:00:00 AM
Firstpage
310
Lastpage
317
Abstract
The purpose of this note is to show as clearly as possible the mathematical relationship between the two basic fast methods used for the calculation of discrete Fourier transforms and to generalize one of the methods a little further. This method applies to all those linear transformations whose matrices are expressible as direct products.
Keywords
Algorithms, circulices, direct product of matrices, discrete Fourier transforms, fast Fourier transforms, frequency analysis, Hadamard transform, harmonic analysis, multidimensional linear transformation, sparse matrices.; Discrete Fourier transforms; Equations; Fast Fourier transforms; Flexible printed circuits; Fourier transforms; Frequency; Harmonic analysis; Multidimensional systems; Sparse matrices; Vectors; Algorithms, circulices, direct product of matrices, discrete Fourier transforms, fast Fourier transforms, frequency analysis, Hadamard transform, harmonic analysis, multidimensional linear transformation, sparse matrices.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223236
Filename
1671829
Link To Document