163 citations · 1.5k across the 72 of their papers we have counts for
72 papers
32-point DFT Approximations Based on Minimal Frobenius Error and DFT Symmetries
L. Andrade-Silva, W. A. S. Aleixo, R. J. Cintra
This work introduces low-complexity, multiplierless approximations for the 32-point discrete Fourier transform. The proposed methods are obtained by minimizing the Frobenius error…
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…
Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity
A. P. Radünz, L. Portella, R. S. Oliveira +2
The discrete cosine transform (DCT) is a central tool for image and video coding because it can be related to the Karhunen-Loève transform (KLT), which is the optimal transform in…
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.
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…
An Iterative Wavelet Threshold for Signal Denoising
F. M. Bayer, A. J. Kozakevicius, R. J. Cintra
This paper introduces an adaptive filtering process based on shrinking wavelet coefficients from the corresponding signal wavelet representation. The filtering procedure considers…