The FFT algorithms are described which, like those described by Rader and Brenner, use pure real (or imaginary) constant factors. Since these factors contain

(or

), these processes are somewhat better conditioned than those of Rader/Brenner, and are comparably efficient.