Note 17. FFT: Decimation-in-Time Algorithms
Consider the discrete Fourier transform for an N-point sequence
17.1
where
For even N, the DFT summation can be split into two separate summations—one for the even-indexed samples of x[n] and one for the odd-indexed samples.
17.2
Each of the summations in the final line of Eq. (17.2) is in the form of an (N/2)-point DFT. The signal flow graph (SFG) corresponding to the final line of Eq. (17.2) is shown ...
Get Notes on Digital Signal Processing: Practical Recipes for Design, Analysis and Implementation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
