Concept
Karnaugh map
Related publications (16)
Scalable Logic Rewriting Using Don’t Cares
Giovanni De Micheli, Alessandro Tempia Calvino
Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...
2024Three-Input Gates for Logic Synthesis
Giovanni De Micheli, Mathias Soeken, Dewmini Sudara Marakkalage, Eleonora Testa, Heinz Riener
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 ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021The Complexity of Self-Dual Monotone 7-Input Functions
Giovanni De Micheli, Mathias Soeken, Eleonora Testa, Winston Jason Haaswijk
The study of the complexity of Boolean functions has recently found applications in logic synthesis and optimization algorithms, as for instance in logic rewriting. Previous works have focused on the minimum length of Boolean chains for functions up to 5 i ...
2019Classifying Functions with Exact Synthesis
Giovanni De Micheli, Mathias Soeken, Eleonora Testa, Winston Jason Haaswijk
Due to recent advances, constraint solvers have become efficient tools for synthesizing optimum Boolean circuits. We take advantage of this by showing how SAT based exact synthesis may be used as a method for finding minimum length Boolean chains. As oppos ...
IEEE2017Inversion optimization in majority-inverter graphs
Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Eleonora Testa, Odysseas Zografos
Many emerging nanotechnologies realize majority gates as primitive building blocks and they benefit from a majority-based synthesis. Recently, Majority-Inverter Graphs (MIGs) have been introduced to abstract these new technologies. We present optimi ...
Ieee2016Heuristic NPN classification for large functions using AIGs and LEXSAT
Giovanni De Micheli, Paolo Ienne, Mathias Soeken, Ana Petkovska
Two Boolean functions are NPN equivalent if one can be ob- tained from the other by negating inputs, permuting inputs, or negating the output. NPN equivalence is an equivalence relation and the number of equivalence classes is significantly smaller than th ...
Springer Int Publishing Ag2016Side-Channel Attacks on Threshold Implementations using a Glitch Algebra
Threshold implementations allow to implement circuits us- ing secret sharing in a way to thwart side-channel attacks based on prob- ing or power analysis. It was proven they resist to attacks based on glitches as well. In this report, we show the limitatio ...
Springer Int Publishing Ag2016