Paulo Flores
Paulo Flores
INESC-ID, Instituto Superior Técnico (IST), Universidade de Lisboa (ULisboa)
Verified email at inesc-id.pt - Homepage
TitleCited byYear
Exact and approximate algorithms for the optimization of area and delay in multiple constant multiplications
L Aksoy, E Da Costa, P Flores, J Monteiro
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2008
1482008
Search algorithms for the multiple constant multiplications problem: Exact and approximate
L Aksoy, EO Güneş, P Flores
Microprocessors and Microsystems 34 (5), 151-162, 2010
932010
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
P Flores, J Monteiro, E Costa
ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005 …, 2005
762005
An exact solution to the minimum size test pattern problem
PF Flores, HC Neto, JP Marques-Silva
ACM Transactions on Design Automation of Electronic Systems (TODAES) 6 (4 …, 2001
742001
Prime implicant computation using satisfiability algorithms
VM Manquinho, PF Flores, JPM Silva, AL Oliveira
Proceedings Ninth IEEE International Conference on Tools with Artificial …, 1997
721997
PMSat: a parallel version of MiniSAT
L Gil, P Flores, LM Silveira
Journal on Satisfiability, Boolean Modeling and Computation 6 (1-3), 71-98, 2010
692010
Assignment and reordering of incompletely specified pattern sequences targetting minimum power dissipation
P Flores, J Costa, H Neto, J Monteiro, J Marques-Silva
Proceedings Twelfth International Conference on VLSI Design.(Cat. No …, 1999
581999
Design of digit-serial FIR filters: Algorithms, architectures, and a CAD tool
L Aksoy, C Lazzari, E Costa, P Flores, J Monteiro
IEEE transactions on very large Scale integration (VLSI) systems 21 (3), 498-511, 2012
452012
An exact breadth-first search algorithm for the multiple constant multiplications problem
L Aksoy, EO Gunes, P Flores
2008 NORCHIP, 41-46, 2008
442008
Optimization of area in digital FIR filters using gate-level metrics
L Aksov, E Costa, P Flores, J Monteiro
Proceedings of the 44th annual Design Automation Conference, 420-423, 2007
442007
On applying set covering models to test set compaction
PF Flores, HC Neto, JP Marques-Silva
Proceedings Ninth Great Lakes Symposium on VLSI, 8-11, 1999
311999
Efficient shift-adds design of digit-serial multiple constant multiplications
L Aksoy, C Lazzari, E Costa, P Flores, J Monteiro
Proceedings of the 21st edition of the great lakes symposium on Great lakes …, 2011
282011
Outstanding issues in model order reduction
JMS Silva, JF Villena, P Flores, LM Silveira
Scientific Computing in Electrical Engineering, 139-152, 2007
282007
Finding the optimal tradeoff between area and delay in multiple constant multiplications
L Aksoy, E Costa, P Flores, J Monteiro
Microprocessors and microsystems 35 (8), 729-741, 2011
232011
VHDL generation of optimized FIR filters
FF Daitx, VS Rosa, E Costa, P Flores, S Bampi
2008 2nd International Conference on Signals, Circuits and Systems, 1-5, 2008
232008
A tutorial on multiplierless design of FIR filters: algorithms and architectures
L Aksoy, P Flores, J Monteiro
Circuits, Systems, and Signal Processing 33 (6), 1689-1719, 2014
222014
Quaternary logic lookup table in standard CMOS
D Brito, TG Rabuske, JR Fernandes, P Flores, J Monteiro
IEEE Transactions on very large scale integration (vlsi) systems 23 (2), 306-316, 2014
202014
Optimization algorithms for the multiplierless realization of linear transforms
L Aksoy, E Costa, P Flores, J Monteiro
ACM Transactions on Design Automation of Electronic Systems (TODAES) 17 (1 …, 2012
202012
Optimization of area in digit-serial multiple constant multiplications at gate-level
L Aksoy, C Lazzari, E Costa, P Flores, J Monteiro
2011 IEEE International Symposium of Circuits and Systems (ISCAS), 2737-2740, 2011
192011
Optimization of area and delay at gate-level in multiple constant multiplications
L Aksoy, E Costa, P Flores, J Monteiro
2010 13th Euromicro Conference on Digital System Design: Architectures …, 2010
172010
The system can't perform the operation now. Try again later.
Articles 1–20