Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
Signal Processing
2024-02-27 v1 Numerical Analysis
Numerical Analysis
Computation
Methodology
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 .
Cite
@article{arxiv.2402.16225,
title = {Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm},
author = {D. F. G. Coelho and R. J. Cintra},
journal= {arXiv preprint arXiv:2402.16225},
year = {2024}
}
Comments
Originally written in Oct 2016. Contains 55 pages, 17 figures, 4 tables