Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm

Abstract

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$.

Originally written in Oct 2016. Contains 55 pages, 17 figures, 4 tables