A New Radix-6 FFT Algorithm

Using complex numbers of the form a + bμ (where µ is a complex cube root of unity), a radix-6 FFT algorithm in which the component six-point DFT’s do not require any multiplication is developed. This number system was used by Dubois and Venetsanopoulos to implement radix-3 FFT. The number of arithmetic operations for the new algorithm is compared with those of standard radix-6, radix-2, and radix-4 FFT algorithms. © 1981 IEEE