Microprocessor Implementations Of Discrete Fourier Transform Machines
Paul Chow, Zvonko G. Vranesic, Jui Lin Yen · 2005
When computing the Fourier Transform with a microprocessor, the speed and complexity of the algorithm which is used become especially important. The most frequently used algorithm has been the Fast Fourier Transform. More recently developed algorithms require fewer multiplications and about the same number of additions as the FFT. A comparison of these algor ithms is made and some possible structures of machines are suggested. A description of a machine built to use one of the new algorithms is given and the problems which were encountered are discussed.