33 citations · 123 across the 11 of their papers we have counts for
11 papers
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…
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…
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
D. F. G. Coelho, R. J. Cintra, F. M. Bayer +6
This paper introduced a matrix parametrization method based on the Loeffler discrete cosine transform (DCT) algorithm. As a result, a new class of eight-point DCT approximations wa…
Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming
A. Madanayake, R. J. Cintra, N. Akram +6
The discrete Fourier transform (DFT) is widely employed for multi-beam digital beamforming. The DFT can be efficiently implemented through the use of fast Fourier transform (FFT) a…
Towards a Low-SWaP 1024-beam Digital Array: A 32-beam Sub-system at 5.8 GHz
Arjuna Madanayake, Viduneth Ariyarathna, Suresh Madishetty +8
Millimeter wave communications require multibeam beamforming in order to utilize wireless channels that suffer from obstructions, path loss, and multi-path effects. Digital multibe…
A Class of Low-complexity DCT-like Transforms for Image and Video Coding
T. L. T. da Silveira, D. R. Canterle, D. F. G. Coelho +3
The discrete cosine transform (DCT) is a relevant tool in signal processing applications, mainly known for its good decorrelation properties. Current image and video coding standar…
Low-complexity Scaling Methods for DCT-II Approximations
D. F. G. Coelho, R. J. Cintra, A. Madanayake +1
This paper introduces a collection of scaling methods for generating -point DCT-II approximations based on -point low-complexity transformations. Such scaling is based on th…
Low-complexity Architecture for AR(1) Inference
A. Borges, R. J. Cintra, D. F. G. Coelho +1
In this Letter, we propose a low-complexity estimator for the correlation coefficient based on the signed process. The introduced approximation is suitable f…
Fast Matrix Inversion and Determinant Computation for Polarimetric Synthetic Aperture Radar
D. F. G. Coelho, R. J. Cintra, A. C. Frery +1
This paper introduces a fast algorithm for simultaneous inversion and determinant computation of small sized matrices in the context of fully Polarimetric Synthetic Aperture Radar…
Efficient Computation of the 8-point DCT via Summation by Parts
D. F. G. Coelho, R. J. Cintra, V. S. Dimitrov
This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula. The proposed method converts the DCT matrix into…
On the Computation of Neumann Series
Vassil Dimitrov, Diego Coelho
This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large siz…