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

Author

Popovic, M.V. ; Sarajlic, Z.

Author_Institution

Fac. of Electr. Eng., Belgrade Univ., Yugoslavia

fYear

1989

Firstpage

181

Lastpage

184

Abstract

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

Keywords

digital signal processing chips; fast Fourier transforms; FFT; PFA looped code; TMS 32020; digital signal processor chips; discrete Fourier transform algorithms; execution speed; fast Fourier transform; memory requirements; prime factor algorithm; Algorithm design and analysis; Application software; Assembly; Digital signal processing chips; Digital signal processors; Discrete Fourier transforms; Fast Fourier transforms; Guidelines; Performance analysis; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrotechnical Conference, 1989. Proceedings. 'Integrating Research, Industry and Education in Energy and Communication Engineering', MELECON '89., Mediterranean

Conference_Location

Lisbon

Type

conf

DOI

10.1109/MELCON.1989.50012

Filename

50012