β Scribed by Zhaodou Chen; Lijing Zhang
No coin nor oath required. For personal study only.
A new fast algorithm is presented for the multidimensional discrete Fourier transform (DFT). This algorithm is derived using an interesting technique called "vector coding" (VC), and we call it the vector-coding fast Fourier transform (VC-FFT) algorithm. Since the VC-FFT is an extension of the Cooley-Tukey algorithm from 1-D to multidimensional form, the structure of the program is as simple as the Cooley-Tukey fast Fourier transform (FFT). The new algorithm significantly reduces the number of multiplications and recursive stages. The VC-FFT therefore comprehensively reduces the complexity of the algorithm as compared with other current multidimensional DFT algorithms.
π SIMILAR VOLUMES
Title ofprogram: MFFT Nature ofphysical problem Any problem requiring Fourier transforms. Catalogue number: AALL Program obtainable from: CPC Program Library, Queen's Uni-Method of solution versity of Belfast, N. Ireland (see application form in this The Discrete Fourier Transform (DFT) is calculate