Fast algorithms through divide- and combine-and-conquer strategies
暂无分享,去创建一个
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.
[1] Robert Sedgewick,et al. Algorithms in C , 1990 .
[2] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[3] K. A. Semendyayev,et al. Handbook of mathematics , 1985 .
[4] JoséM. Pérez-Jordá,et al. In-place self-sorting fast Fourier transform algorithm with local memory references , 1998 .