Discrete Fourier transform
Y = fft(X)
Y = fft(X,n)
Y = fft(X,,dim)
Y = fft(X,n,dim)
The functions X = fft(x) and x = ifft(X) implement the transform and inverse transform pair given for vectors of length by:
is an th root of unity.
Y = fft(X) returns the discrete Fourier transform (DFT) of vector X, computedwith a fast Fourier transform (FFT) algorithm.
If X is a matrix, fft returns the Fourier transform of each column of the matrix.
If X is a multidimensional array, fft operates on the first nonsingleton dimension.
Y = fft(X,n) returns the n-point DFT. If the length of X is less than n, X is padded with trailing zeros to length n. If the length of X is greater than n, the sequence X istruncated. When X is a matrix, the length of the columns are adjusted in the same manner.
Y = fft(X,,dim) and Y = fft(X,n,dim) applies the FFT operation across the dimension dim.
A common use of Fourier transforms is to find the frequency components of a signal buried in a noisy time domain signal. Consider data sampled at 1000 Hz. Form a signal containing a 50 Hz sinusoid of amplitude0.7 and 120 Hz sinusoid of amplitude 1 and corrupt it with some zero-mean random noise:
Fs = 1000; % Sampling frequency
T = 1/Fs; % Sample time
L = 1000; % Length of signal
t = (0:L-1)*T; % Time vector
% Sum of a 50 Hz sinusoid and a 120 Hz sinusoid
x = 0.7*sin(2*pi*50*t) + sin(2*pi*120*t);
y = x +2*randn(size(t)); % Sinusoids plus noise
title('Signal Corrupted with Zero-Mean Random Noise')
It is difficult to identify the frequency components by looking at the original signal. Converting to the frequency domain, the discrete Fourier transform of the noisy signal y is found by taking the fast Fourier transform (FFT):
NFFT = 2^nextpow2(L); %Next power of 2 from length of y
Y = fft(y,NFFT)/L;
f = Fs/2*linspace(0,1,NFFT/2);
% Plot single-sided amplitude spectrum.
title('Single-Sided Amplitude Spectrum of y(t)')
The main reason the amplitudes are not exactly at 0.7 and 1 is because of the noise. Several executions of this code (including recomputation ofy) will produce different approximations to 0.7 and 1. The other reason is that you have a finite length signal. Increasing L from 1000 to 10000 in the example above will produce much better approximations on average.
The FFT functions (fft, fft2, fftn, ifft, ifft2, ifftn) are based on a library called FFTW ,. To compute an -point DFT when is composite (that is, when ), theFFTW library decomposes the problem using the Cooley-Tukey algorithm , which first computes transforms of size , and then computes transforms of size . The decomposition is applied recursively to both the - and -point DFTs until the problem can be solved using one of several machine-generated fixed-size "codelets." The codelets in turn use several algorithms in combination, including a variationof Cooley-Tukey , a prime factor algorithm , and a split-radix algorithm . The particular factorization of is chosen heuristically.
When is a prime number, the FFTW library first decomposes an -point problem into three ( )-point problems using Rader's algorithm . It then uses the Cooley-Tukey decomposition described above to compute the ( )-point DFTs.
For most , real-input DFTsrequire roughly half the computation time of complex-input DFTs. However, when has large prime factors, there is little or no speed difference.
The execution time for fft depends on the length of the transform. It is fastest for powers of two. It is almost as fast for lengths that have only small prime factors. It is typically several times slower for lengths that are prime or which have large...