An Approximation for the 32-point Discrete Fourier Transform

2024/07/17 by R. J. Cintra, Cintra, R. J.
Computer Science · #65T50 #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #G.1.2 #Matrix Theory and Algorithms #Methodology (stat.ME) #Numerical Analysis (math.NA) #Signal Processing (eess.SP) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.2407.12708

openalex publication_date 2024/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.

Related

• Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
• Approximating the Analytic Fourier Transform with the Discrete Fourier Transform
• Discrete Weierstrass Fourier Transform and Experiments
• Quantitative estimates: How well does the discrete Fourier transform approximate the Fourier transform on ℝ
• Fast Compressed-Domain N-Point Discrete Fourier Transform: The "Twiddless" FFT Algorithm