Abstract: A method of performing a fast Fourier transform (FFT) in a single-instruction-stream, multiple-data-stream (SIMD) processor includes providing n-bits of input data, and implementing j number of stages of operations. The n-bits of input data are grouped into groups of x-bits to form i number of vectors so that i=n/x. The method includes parallel butterflies operations on vector [i] with vector [i+(n/2)] using a twiddle factor vector Wt. Data sorting is performed within a processing array if a present stage j is less than y, where y is an integer less than a maximum value of j. The parallel butterflies operations and data sorting are repeated i times, then the process increments to the next stage j. The parallel butterflies operations, data sorting and incrementing are repeated (j?1) times to generate a transformed result and then the transformed result is output.