<< Chapter < Page | Chapter >> Page > |
The Fast Fourier Transform ( FFT ) can be used to analyze the spectral content of a signal. Recallthat the FFT is an efficient algorithm for computing the Discrete Fourier Transform ( DFT ), a frequency-sampled version of the DTFT .
Because the FFT is a block-based algorithm, its computation is performed at the block I/O rate, in contrast to otherexercises in which processing occurred on a sample-by-sample basis.
Notification Switch
Would you like to follow the 'Dsp laboratory with ti tms320c54x' conversation and receive update notifications?