next up previous
Next: 1 Introduction

Implementation and Comparison of Radix-2 and Radix-4 FFT Algorithms

Michael J. Andrews

Convergent Technology Center
ECE Department, WPI
Worcester, MA 01609-2280


Development of a recursive, in-place, decimation in frequency fast Fourier transform algorithm that falls within the Cooley-Tukey[1] class of algorithms. In particular, development of both radix-2 and radix-4 algorithms for sequences equal in length to finite powers of two and four is covered. A comparison of the two algorithms using a sample of points obtained on a variety of computational platforms and for several sequence lengths is presented.

Keywords: fourier series, FFT, algorithm

next up previous
Next: 1 Introduction

Mike Andrews