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.;
