Eleonora Testa
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
Eleonora Testa has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Giovanni De Micheli
EPFL, Lausanne, Switzerland
5 shared publications - Mathias Soeken
Integrated Systems Laboratory, EPFL
4 shared publications Alan Mishchenko
Department of EECS, UC Berkeley, Berkeley, California, USA
2 shared publicationsPatrick Vuillod
Synopsys Inc., Montbonnot-Saint-Martin, France
2 shared publications- Pierre-Emmanuel Gaillardon
Department of Electrical and Computer Engineering, The University of Utah, Salt Lake City, UT, USA
2 shared publications - Alan Mishchenko
UC Berkeley, Berkeley, CA, USA
1 shared publication
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Shared Logic Unleashed: Multiple-Node Boolean Optimization for Next-Gen Synthesis
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessShared Logic Unleashed: Multiple-Node Boolean Optimization for Next-Gen Synthesis
- 20 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Circuits and Systems Magazine
- Vol. 25 (2) , 23-28
A MAJestic Synthesis Review [Special Section on 2025 IEEE Kirchhoff Award]
This article presents a review of Majority-Inverter Graphs (MIGs) and their practical use in various applications within logic synthesis. MIGs are directed acyclic graphs consisting of three-input majority nodes and regular/complemented edges. They represent a paradigm shift in representing and optimizing logic using only majority (MAJ) and inversion (INV) functions. In this article, we review different optimization algorithms that work on MIGs, including algebraic, Boolean, and exact methods. We also describe different applications of MIGs in logic synthesis: From classical CMOS-based synthesis to their use for theoretical results and emerging technologies.
- 20 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Circuits and Systems Magazine
- Vol. 25 (2) , 23-28
A MAJestic Synthesis Review [Special Section on 2025 IEEE Kirchhoff Award]
This article presents a review of Majority-Inverter Graphs (MIGs) and their practical use in various applications within logic synthesis. MIGs are directed acyclic graphs consisting of three-input majority nodes and regular/complemented edges. They represent a paradigm shift in representing and optimizing logic using only majority (MAJ) and inversion (INV) functions. In this article, we review different optimization algorithms that work on MIGs, including algebraic, Boolean, and exact methods. We also describe different applications of MIGs in logic synthesis: From classical CMOS-based synthesis to their use for theoretical results and emerging technologies.
- Open Access
- 15 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 226828-226844
Extending Boolean Methods for Scalable Logic Synthesis
In recent years, Boolean methods in logic synthesis have been drawing the attention of EDA researchers due to the continuous push to advance quality of results. Boolean methods require high computational cost, as they rely on complete functional properties of a logic circuit (e.g., don’t cares), but usually result in better optimization. In particular, Boolean resubstitution is considered one of the most powerful Boolean methods in logic synthesis. In this paper, we present three novel Boolean resubstitution algorithms designed to be scalable and runtime-effective in a modern synthesis flow. They make use of circuit partitioning techniques and Boolean filtering to be fast and computationally tractable. We also discuss different data structures and reasoning engines, namely truth tables, binary decision diagrams, and satisfiability, that are required to gather don’t cares and functional information. As the choice of the engine determines the scalability of Boolean resubstitution, we present different scenarios in which the Boolean methods are best driven by one or the other of these. We have implemented the presented resubstitution techniques together with state-of-the-art methods in an industrial logic optimization engine to create a novel resynthesis flow. Our global resynthesis flow achieves significant synthesis results: Within the EPFL synthesis competition, we improve the best-known area results when mapped into LUT-6; when embedded in a commercial EDA flow, the new Boolean resynthesis flow results in 3:12% combinational area savings and 1:34% WNS reduction after physical implementation, at contained (w.r.t. the time of the entire flow) runtime cost.
- 15 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 226828-226844
Open AccessExtending Boolean Methods for Scalable Logic Synthesis
In recent years, Boolean methods in logic synthesis have been drawing the attention of EDA researchers due to the continuous push to advance quality of results. Boolean methods require high computational cost, as they rely on complete functional properties of a logic circuit (e.g., don’t cares), but usually result in better optimization. In particular, Boolean resubstitution is considered one of the most powerful Boolean methods in logic synthesis. In this paper, we present three novel Boolean resubstitution algorithms designed to be scalable and runtime-effective in a modern synthesis flow. They make use of circuit partitioning techniques and Boolean filtering to be fast and computationally tractable. We also discuss different data structures and reasoning engines, namely truth tables, binary decision diagrams, and satisfiability, that are required to gather don’t cares and functional information. As the choice of the engine determines the scalability of Boolean resubstitution, we present different scenarios in which the Boolean methods are best driven by one or the other of these. We have implemented the presented resubstitution techniques together with state-of-the-art methods in an industrial logic optimization engine to create a novel resynthesis flow. Our global resynthesis flow achieves significant synthesis results: Within the EPFL synthesis competition, we improve the best-known area results when mapped into LUT-6; when embedded in a commercial EDA flow, the new Boolean resynthesis flow results in 3:12% combinational area savings and 1:34% WNS reduction after physical implementation, at contained (w.r.t. the time of the entire flow) runtime cost.
- Open Access
- 20 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 40 (10) , 2184-2188
Three-Input Gates for Logic Synthesis
Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused primarily on graphs with 2-input nodes such as AND and OR gates, the recently proposed paradigm of Majority-Inverter Graphs instead uses the 3-input Majority gate as the node function. As this technique proved to be a success, it is natural to ask: Are there other 3-input gates better suited for logic synthesis? Motivated by this question, we investigate the relative advantages of 3-input gates as constituents of logic networks. We consider representative gates from each of the ten non-degenerate 3-input NPN classes and study how powerful they are at representing Boolean functions. Using SAT-based exact synthesis, we evaluate each 3-input gate using the minimum number of such gates (together with inverters) needed to synthesize all 4-input Boolean functions and a subset of frequent 5-input and 6-input Boolean functions. We show that the logic gate Dot(x,y,z):=x(zxy) outperforms the rest in terms of expressive power. We further confirm this observation by showing that Dot-Inverter Graph representations are more than 14% smaller as compared to Majority-Inverter Graph representations of EPFL benchmarks.
- 20 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 40 (10) , 2184-2188
Open AccessThree-Input Gates for Logic Synthesis
Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused primarily on graphs with 2-input nodes such as AND and OR gates, the recently proposed paradigm of Majority-Inverter Graphs instead uses the 3-input Majority gate as the node function. As this technique proved to be a success, it is natural to ask: Are there other 3-input gates better suited for logic synthesis? Motivated by this question, we investigate the relative advantages of 3-input gates as constituents of logic networks. We consider representative gates from each of the ten non-degenerate 3-input NPN classes and study how powerful they are at representing Boolean functions. Using SAT-based exact synthesis, we evaluate each 3-input gate using the minimum number of such gates (together with inverters) needed to synthesize all 4-input Boolean functions and a subset of frequent 5-input and 6-input Boolean functions. We show that the logic gate Dot(x,y,z):=x(zxy) outperforms the rest in terms of expressive power. We further confirm this observation by showing that Dot-Inverter Graph representations are more than 14% smaller as compared to Majority-Inverter Graph representations of EPFL benchmarks.
- 14 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 68 (5) , 791-797
Mapping Monotone Boolean Functions into Majority
We consider the problem of decomposing monotone Boolean functions into majority-of-three operations, with a particular focus on decomposing the majority-n function. When targeting monotone Boolean functions, Shannon's expansion can be expressed by a single majority-of-three operation. We exploit this property to transform binary decision diagrams (BDDs) for monotone functions into majority-inverter graphs (MIGs), using a simple one-to-one mapping. This process highlights desirable properties for further majority graph optimization, e.g., symmetries between the inputs of primitive operations, which are not apparent from BDDs. Although our construction yields a quadratic upper bound on the number of majority-3 operations required to realize majority-n, for small n the concrete values are much smaller compared to those obtained from previous constructions which have linear and quasi-linear asymptotic upper bounds. Further, we demonstrate that minimum size MIGs, for the monotone functions majority-5 and majority-7, can be obtained applying a small number of algebraic transformations to the BDD.
- 14 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 68 (5) , 791-797
Mapping Monotone Boolean Functions into Majority
We consider the problem of decomposing monotone Boolean functions into majority-of-three operations, with a particular focus on decomposing the majority-n function. When targeting monotone Boolean functions, Shannon's expansion can be expressed by a single majority-of-three operation. We exploit this property to transform binary decision diagrams (BDDs) for monotone functions into majority-inverter graphs (MIGs), using a simple one-to-one mapping. This process highlights desirable properties for further majority graph optimization, e.g., symmetries between the inputs of primitive operations, which are not apparent from BDDs. Although our construction yields a quadratic upper bound on the number of majority-3 operations required to realize majority-n, for small n the concrete values are much smaller compared to those obtained from previous constructions which have linear and quasi-linear asymptotic upper bounds. Further, we demonstrate that minimum size MIGs, for the monotone functions majority-5 and majority-7, can be obtained applying a small number of algebraic transformations to the BDD.
- Open Access
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 107 (1) , 165-184
Logic Synthesis for Established and Emerging Computing
Logic synthesis is an enabling technology to realize integrated computing systems, and it entails solving computationally intractable problems through a plurality of heuristic techniques. A recent push toward further formalization of synthesis problems has shown to be very useful toward both attempting to solve some logic problems exactly-which is computationally possible for instances of limited size today-as well as creating new and more powerful heuristics based on problem decomposition. Moreover, technological advances including nanodevices, optical computing, and quantum and quantum cellular computing require new and specific synthesis flows to assess feasibility and scalability. This review highlights recent progress in logic synthesis and optimization, describing models, data structures, and algorithms, with specific emphasis on both design quality and emerging technologies. Example applications and results of novel techniques to established and emerging technologies are reported.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 107 (1) , 165-184
Open AccessLogic Synthesis for Established and Emerging Computing
Logic synthesis is an enabling technology to realize integrated computing systems, and it entails solving computationally intractable problems through a plurality of heuristic techniques. A recent push toward further formalization of synthesis problems has shown to be very useful toward both attempting to solve some logic problems exactly-which is computationally possible for instances of limited size today-as well as creating new and more powerful heuristics based on problem decomposition. Moreover, technological advances including nanodevices, optical computing, and quantum and quantum cellular computing require new and specific synthesis flows to assess feasibility and scalability. This review highlights recent progress in logic synthesis and optimization, describing models, data structures, and algorithms, with specific emphasis on both design quality and emerging technologies. Example applications and results of novel techniques to established and emerging technologies are reported.