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

Add code
Feb 25, 2024
D. F. G. Coelho, R. J. Cintra
Figure 1 for Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
Figure 2 for Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
Figure 3 for Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
Figure 4 for Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

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  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon