Andrea Costamagna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Andrea Costamagna has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Giovanni De Micheli
EPFL, Lausanne, Switzerland
3 shared publications - Alessandro Tempia Calvino
EPFL, Lausanne, Switzerland
2 shared publications Alan Mishchenko
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA
1 shared publication- Alan Mishchenko
UC Berkeley, Berkeley, CA, USA
1 shared publication - Ezio Venturino
University of Turin
1 shared publication - Jack Wetherell
European Theoretical Spectroscopy Facility
1 shared publication
Latest Publications
- Open Access
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 1112-1119
Area-Oriented Optimization After Standard-Cell Mapping
We address the problem of minimizing the area of circuits mapped to a technology library, with or without delay constraints. While traditional methods optimize first a technology-independent representation and then perform technology mapping to a library, this paper explores the potential for further optimizations through technology-dependent algorithms. We propose an optimization engine for mapped circuits that relies on a database of mapped sub-networks for efficient resynthesis. Experimental results on the EPFL benchmarks after area-oriented optimization and mapping show that the proposed method leads to average area improvements of 5.47% without degrading the delay.
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 1112-1119
Open AccessArea-Oriented Optimization After Standard-Cell Mapping
We address the problem of minimizing the area of circuits mapped to a technology library, with or without delay constraints. While traditional methods optimize first a technology-independent representation and then perform technology mapping to a library, this paper explores the potential for further optimizations through technology-dependent algorithms. We propose an optimization engine for mapped circuits that relies on a database of mapped sub-networks for efficient resynthesis. Experimental results on the EPFL benchmarks after area-oriented optimization and mapping show that the proposed method leads to average area improvements of 5.47% without degrading the delay.
- Open Access
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44 (7) , 2571-2584
Area-Oriented Resubstitution For Networks of Look-Up Tables
This article addresses the challenge of reducing the number of nodes in look-up table (LUT) networks with two significant applications. First, field-programmable gate arrays (FPGAs) can be modeled as networks of LUTs, and minimizing the node count is imperative to meet resource constraints. Second, in area-oriented design space exploration for standard-cell designs, collapsing a circuit into a LUT network, restructuring it, and later remapping to the original representation helps escape local minima. Thus, the development of algorithms for optimizing and restructuring LUT networks holds considerable promise for area-oriented optimization. Substitution (also called resubstitution) is a powerful logic minimization method that can identify nonlocal logic dependencies and exploit them for logic minimization. State-of-the-art substitution algorithms for LUT networks rely heavily on SAT solving, limiting the number of optimization attempts and the size of the substitution subnetworks to one node [1]. Conversely, our method relies on circuit simulation to increase the number of substitution candidates and enables substitutions with more than one node. The experimental results show that the proposed method identifies optimization opportunities overlooked by other methods, improving 11 out of 23 best-known results in the EPFL synthesis competition and yielding a 3.46% area reduction compared to the state-of-the-art.
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44 (7) , 2571-2584
Open AccessArea-Oriented Resubstitution For Networks of Look-Up Tables
This article addresses the challenge of reducing the number of nodes in look-up table (LUT) networks with two significant applications. First, field-programmable gate arrays (FPGAs) can be modeled as networks of LUTs, and minimizing the node count is imperative to meet resource constraints. Second, in area-oriented design space exploration for standard-cell designs, collapsing a circuit into a LUT network, restructuring it, and later remapping to the original representation helps escape local minima. Thus, the development of algorithms for optimizing and restructuring LUT networks holds considerable promise for area-oriented optimization. Substitution (also called resubstitution) is a powerful logic minimization method that can identify nonlocal logic dependencies and exploit them for logic minimization. State-of-the-art substitution algorithms for LUT networks rely heavily on SAT solving, limiting the number of optimization attempts and the size of the substitution subnetworks to one node [1]. Conversely, our method relies on circuit simulation to increase the number of substitution candidates and enables substitutions with more than one node. The experimental results show that the proposed method identifies optimization opportunities overlooked by other methods, improving 11 out of 23 best-known results in the EPFL synthesis competition and yielding a 3.46% area reduction compared to the state-of-the-art.
- Open Access
- 26 December 2022
- Published by Elsevier in Integration
- Vol. 89, 248-260
Accuracy recovery: A decomposition procedure for the synthesis of partially-specified Boolean functions
- 26 December 2022
- Published by Elsevier in Integration
- Vol. 89, 248-260
Open AccessAccuracy recovery: A decomposition procedure for the synthesis of partially-specified Boolean functions
- 12 June 2020
- Published by Royal Society of Chemistry (RSC) in Faraday Discussions
- Vol. 224, 265-291
Insights into one-body density matrices using deep learning
Deep-learning constraints of the one-body reduced density matrix from its compressibility to enable efficient determination of key observables.
- 12 June 2020
- Published by Royal Society of Chemistry (RSC) in Faraday Discussions
- Vol. 224, 265-291
Insights into one-body density matrices using deep learning
Deep-learning constraints of the one-body reduced density matrix from its compressibility to enable efficient determination of key observables.
- 17 January 2012
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 89 (4) , 561-584
Epidemics spreading in predator–prey systems
In this paper, we consider an ecosystem in which two disease-affected populations thrive and in which the epidemics can spread from one species to the other one by contact. The feasibility and stability conditions of the equilibria of the system are investigated analytically. The model does not possess Hopf bifurcations. Numerical simulations are performed to investigate the role of the main epidemiological and demographic parameters in the model, thus discovering that the predation of healthy or diseased predators on an infected prey allows some kind of control of the prey, if the latter, for instance, represents a pest.
- 17 January 2012
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 89 (4) , 561-584
Epidemics spreading in predator–prey systems
In this paper, we consider an ecosystem in which two disease-affected populations thrive and in which the epidemics can spread from one species to the other one by contact. The feasibility and stability conditions of the equilibria of the system are investigated analytically. The model does not possess Hopf bifurcations. Numerical simulations are performed to investigate the role of the main epidemiological and demographic parameters in the model, thus discovering that the predation of healthy or diseased predators on an infected prey allows some kind of control of the prey, if the latter, for instance, represents a pest.