Search Results - "Coelho, D. F. G."
-
1
Fast data-independent KLT approximations based on integer functions
Published in Multimedia tools and applications (25-01-2024)“…The Karhunen-Loève transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and…”
Get full text
Journal Article -
2
Efficient Computation of the 8-point DCT via Summation by Parts
Published in Journal of signal processing systems (01-04-2018)“…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…”
Get full text
Journal Article -
3
Low-complexity Scaling Methods for DCT-II Approximations
Published 11-02-2024“…This paper introduces a collection of scaling methods for generating $2N$-point DCT-II approximations based on $N$-point low-complexity transformations. Such…”
Get full text
Journal Article -
4
Fast Data-independent KLT Approximations Based on Integer Functions
Published 11-10-2024“…Multimedia Tools and Applications, 83(26):67303--67325, January 2024 The Karhunen-Lo\`eve transform (KLT) stands as a well-established discrete transform,…”
Get full text
Journal Article -
5
A Class of Low-complexity DCT-like Transforms for Image and Video Coding
Published 08-12-2022“…IEEE Transactions on Circuits and Systems for Video Technology, v. 32, n. 7, July 2022 The discrete cosine transform (DCT) is a relevant tool in signal…”
Get full text
Journal Article -
6
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
Published 29-07-2022“…J. Low Power Electron. Appl. 2018, 8(4), 46 This paper introduced a matrix parametrization method based on the Loeffler discrete cosine transform (DCT)…”
Get full text
Journal Article -
7
Low-complexity Architecture for AR(1) Inference
Published 21-08-2020“…Electronics Letters 56 (14), 732-734, 2020 In this Letter, we propose a low-complexity estimator for the correlation coefficient based on the signed…”
Get full text
Journal Article -
8
Efficient Computation of the 8-point DCT via Summation by Parts
Published 28-03-2018“…J Sign Process Syst (2017) This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula…”
Get full text
Journal Article -
9
Fast Matrix Inversion and Determinant Computation for Polarimetric Synthetic Aperture Radar
Published 21-07-2018“…Computers and Geosciences, no. 119 (2018), pages 109-114 This paper introduces a fast algorithm for simultaneous inversion and determinant computation of small…”
Get full text
Journal Article -
10
Fast matrix inversion and determinant computation for Polarimetric Synthetic Aperture Radar
Published in Computers & geosciences (01-10-2018)“…This paper introduces a fast algorithm for simultaneous inversion and determinant computation of small sized matrices in the context of fully Polarimetric…”
Get full text
Journal Article -
11
An 8-Beam 2.4 GHz Digital Array Receiver Based on a Fast Multiplierless Spatial DFT Approximation
Published in 2018 IEEE/MTT-S International Microwave Symposium - IMS (01-06-2018)“…A low-complexity receive-mode 8-beam multi-beamformer in the digital domain has been realized at 2.4 GHz using an 8-element IQ receiver array. The proposed…”
Get full text
Conference Proceeding -
12
Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
Published 25-02-2024“…This report elaborates on approximations for the discrete Fourier transform by means of replacing the exact Cooley-Tukey algorithm twiddle-factors by…”
Get full text
Journal Article