Fast Fourier Transform
• • •
The fast Fourier transform using radix-2 and radix-4 Decimation or decomposition in frequency and in time Programming examples
The fast Fourier transform (FFT) is an efﬁcient algorithm that is used for converting a time-domain signal into an equivalent frequency-domain signal, based on the discrete Fourier transform (DFT). Several real-time programming examples on FFT are included.
6.1 INTRODUCTION The discrete Fourier transform converts a time-domain sequence into an equivalent frequency-domain sequence. The inverse discrete Fourier transform performs the reverse operation and converts a frequency-domain sequence into an equivalent time-domain sequence. The fast Fourier transform (FFT) is a very efﬁcient...