163 citations · 1.5k across the 72 of their papers we have counts for
Showing 2024 · eess.SPShow all
3 papers · 2 filters
eess.SP2024★ 1 cited
Fast Data-independent KLT Approximations Based on Integer Functions
A. P. Radünz, D. F. G. Coelho, F. M. Bayer +2
The Karhunen-Loève transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and dimensionality reduction. Its ab…
eess.SP2024
An Approximation for the 32-point Discrete Fourier Transform
R. J. Cintra
This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.
eess.SP2024
Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
D. F. G. Coelho, R. J. Cintra
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…