An Approximation for the 32-point Discrete Fourier Transform
Signal Processing
2024-08-01 v2 Numerical Analysis
Numerical Analysis
Methodology
Abstract
This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.
Keywords
Cite
@article{arxiv.2407.12708,
title = {An Approximation for the 32-point Discrete Fourier Transform},
author = {R. J. Cintra},
journal= {arXiv preprint arXiv:2407.12708},
year = {2024}
}
Comments
Corrected a typo in (4). 8 pages, 2 tables