Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
<|reference_start|>Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm: 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$.<|reference_end|>
@article{coelho2024discrete,
    title={Discrete Fourier Transform Approximations Based on the Cooley-Tukey
  Radix-2 Algorithm},
    author={D. F. G. Coelho, R. J. Cintra},
    journal={arXiv preprint arXiv:2402.16225},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.16225},
    primaryClass={eess.SP cs.NA math.NA stat.CO stat.ME}
}