A new FFT algorithm of radix 3,6, and 12

A new algorithm for implementation of radix 3, 6, and 12 FFT is introduced. An FFT using this algorithm is computed in an ordinary (1,j) complex plane and the number of additions can be significantly reduced; the number of multiplication is also reduced. High efficiency of the algorithm is derived from the fact that, if an input sequence is favorably reordered, rotating factors can be treated in pairs so that the rotating factors are conjugate to each other.