Fast algorithms through divide- and combine-and-conquer strategies Original Research Article

The fast Fourier transform (FFT) algorithm is explained in a simple and novel way. It is shown how the two canonic forms of the FFT (decimation in time and decimation in frequency) can be respectively arranged as “combine-and-conquer” or “divide-and-conquer” algorithms.