PROJECT
12 Fast Fourier Transform
12.0 Introduction
12.1 Fourier Transform of Discretly Sampled Data
12.2 Fast Fourier Transform (FFT)
12.3 FFT of Real Functions, Sine and Cosine Transforms
12.4 FFT in Two and More Dimensions
12.5 Fourier Transforms of Real Data in Two and Three Dimensions
12.6 External Storage of Memory-Local FFTs
13 Fourier and Spectral Applications
13.0 Introduction
13.1 Convolution and Deconvolution Using the FFT
13.2 Correlation and Autocorrelation Using the FFT
13.3 Optimal (Wiener) Filtering with the FFT
13.4 Power Spectrum Estimation Using the FFT
13.5 Digital Filtering in Time Domain
13.6 Linear Prediciton and Linear Predictive Coding
13.7 Power Spectrum Estimation by the Maximum Entropy
(All Poles) Method
13.8 Spectral Analysis of Unevenly Sampled Data
13.9 Computing Fourier Integrals Using the FFT
13.10 Wavelet Transforms
13.11 Numerical Use of the Sampling Theorem
PROJECT
PROJECT