Comparison of Radix-w and Radix-3 Fast Fourier Transform Algorithms

Author

Hung-Fa Sun

Date of Award

8-1987

Degree Type

Master's Essay - Restricted

Degree Name

Master of Science (MS)

Department

Electrical and Computer Engineering

First Advisor

James A. Heinen

Second Advisor

Russell J. Niederjohn

Abstract

In this essay a radix-3 FFT algorithm is described and implemented. A modified radix-2 FFT algorithm from the subroutine "FOUREA" of the IEEE Library is also included. Comparisons of the two FFT algorithms are given in terms of the number of computations required and in terms of the accuracy obtained using fixed-point arithmetic operations. The results of these comparisons provide detailed descriptions of the efficiency and accuracy of the radix-2 and radix-3 FFT algorithms.

Comments

An Essay Submitted to the Faculty of the Graduate School, Marquette University, in Partial Fulfillment of the Requirements for the Degree of Master of Science. Milwaukee, Wisconsin

Recommended Citation

Sun, Hung-Fa, "Comparison of Radix-w and Radix-3 Fast Fourier Transform Algorithms" (1987). Master's Essays (1922 - ). 2012.
https://epublications.marquette.edu/essays/2012