Diego F. G. Coelho

Orcid: 0000-0002-8067-0623

According to our database1, Diego F. G. Coelho authored at least 22 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm.
CoRR, 2024

2022
A Class of Low-Complexity DCT-Like Transforms for Image and Video Coding.
IEEE Trans. Circuits Syst. Video Technol., 2022

Radix-$N$ Algorithm for Computing $N^{2^{n}}$-Point DFT Approximations.
IEEE Signal Process. Lett., 2022

Low-Complexity Loeffler DCT Approximations for Image and Video Coding.
CoRR, 2022

Towards a Low-SWaP 1024-beam Digital Array: A 32-beam Sub-system at 5.8 GHz.
CoRR, 2022

2021
Low-Complexity Scaling Methodsfor DCT-II Approximations.
IEEE Trans. Signal Process., 2021

Low-complexity Scaling Methods for DCT-II Approximations.
CoRR, 2021

2020
A Low-SWaP 16-Beam 2.4 GHz Digital Phased Array Receiver Using DFT Approximation.
IEEE Trans. Aerosp. Electron. Syst., 2020

Low-complexity Architecture for AR(1) Inference.
CoRR, 2020

Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming.
IEEE Access, 2020

2018
Advanced Methods for Efficient Digital Signal Processing and Matrix-Based Computations.
PhD thesis, 2018

Efficient Computation of the 8-point DCT via Summation by Parts.
J. Signal Process. Syst., 2018

Computation of 2D 8×8 DCT Based on the Loeffler Factorization Using Algebraic Integer Encoding.
IEEE Trans. Computers, 2018

Efficient computation of tridiagonal matrices largest eigenvalue.
J. Comput. Appl. Math., 2018

Fast matrix inversion and determinant computation for Polarimetric Synthetic Aperture Radar.
Comput. Geosci., 2018

Analog Approximate-FFT 8/16-Beam Algorithms, Architectures and CMOS Circuits for 5G Beamforming MIMO Transceivers.
IEEE J. Emerg. Sel. Topics Circuits Syst., 2018

2017
DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures.
IEEE Trans. Computers, 2017

On the Computation of Neumann Series.
CoRR, 2017

Fast estimation of tridiagonal matrices largest eigenvalue.
Proceedings of the 30th IEEE Canadian Conference on Electrical and Computer Engineering, 2017

A Parallel Method for the Computation of Matrix Exponential Based on Truncated Neumann Series.
Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017

2016
Error-free computation of 8-point discrete cosine transform based on the Loeffler factorisation and algebraic integers.
IET Signal Process., 2016

Detection of neovascularization near the optic disk due to diabetic retinopathy.
Proceedings of the 24th European Signal Processing Conference, 2016


  Loading...