  This report elaborates on approximations for the discrete Fourier transform
by means of replacing the exact Cooley-Tukey algorithm twiddle-factors by
low-complexity integers, such as $0, \pm \frac{1}{2}, \pm 1$.
