Digital spectral analysis: with applications
Digital spectral analysis: with applications
The fast Fourier transform and its applications
The fast Fourier transform and its applications
Spectral methods in MatLab
Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Numerical Recipes in FORTRAN: The Art of Scientific Computing
Numerical Recipes in FORTRAN: The Art of Scientific Computing
The FFT: An Algorithm the Whole Family Can Use
Computing in Science and Engineering
The Fast Fourier Transform for Experimentalists, Part II: Convolutions
Computing in Science and Engineering
The Fast Fourier Transform for Experimentalists Part III: Classical Spectral Analysis
Computing in Science and Engineering
The Fast Fourier Transform for Experimentalists, Part IV: Autoregressive Spectral Analysis
Computing in Science and Engineering
The Fast Fourier Transform for Experimentalists, Part V: Filters
Computing in Science and Engineering
The Fast Fourier Transform for Experimentalists, Part VI: Chirp of a Bat
Computing in Science and Engineering
| Hi-index | 0.00 |
The interlaced decomposition method used in the Cooley-Tukey algorithm can be appliedto other orthogonal transformations such as the Hadamard, Hartley, and Haar. However, in this article, we concentrate on the fast Fourier transform's (FFT) application and interpretation.