Comparison of some discrete Fourier transform algorithms realized with the digital signal processor TMS 32020

Some problems associated with the implementation of the fast Fourier transform (FFT) algorithms using digital signal processor chips are considered. After a theoretical analysis, the chosen versions of the algorithms were being coded and compared. Comparison was made in terms of execution speed, memory requirements, and numbers of multiply and add operations. It is concluded that, overall, the PFA (prime factor algorithm) looped code seems the best alternative for general use.<>