Fourier Analysis and Filtering
Transforms and filters are tools for processing and analyzing discrete data, and are commonly used in signal processing applications and computational mathematics. When data is represented as a function of time or space, the Fourier transform decomposes the data into frequency components. Thefft
function uses a fast Fourier transform algorithm that reduces its computational cost compared to other direct implementations. For a more detailed introduction to Fourier analysis, seeFourier Transforms. Theconv
andfilter
functions are also useful tools for modifying the amplitude or phase of input data using a transfer function.
Functions
Fourier Transform
fft |
Fast Fourier transform |
fft2 |
2-D fast Fourier transform |
fftn |
N-D fast Fourier transform |
fftshift |
Shift zero-frequency component to center of spectrum |
fftw |
Define method for determining FFT algorithm |
ifft |
Inverse fast Fourier transform |
ifft2 |
2-D inverse fast Fourier transform |
ifftn |
Multidimensional inverse fast Fourier transform |
ifftshift |
Inverse zero-frequency shift |
nextpow2 |
Exponent of next higher power of 2 |
interpft |
1-D interpolation (FFT method) |
Convolution
Topics
The Fourier transform is a powerful tool for analyzing data across many applications, including Fourier analysis for signal processing.
Use the Fourier transform for frequency and power spectrum analysis of time-domain signals.
Use the fast Fourier transform to estimate coefficients of a polynomial interpolant.
Transform 2-D optical data into frequency space.
Smooth noisy, 2-D data using convolution.
Filtering is a data processing technique used for smoothing data or modifying specific data characteristics, such as signal amplitude.