Concept
Expression booléenne (programmation informatique)
Publications associées (44)
In Medio Stat Virtus: Combining Boolean and Pattern Matching
Giovanni De Micheli, Alessandro Tempia Calvino, Gianluca Radi
Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...
2024Improving Standard-Cell Design Flow using Factored Form Optimization
Giovanni De Micheli, Alessandro Tempia Calvino
Factored form is a powerful multi-level representation of a Boolean function that readily translates into an implementation of the function in CMOS technology. In particular, the number of literals in a factored form correlates strongly with the number of ...
New York2023BPMN process generation and optimization for readability in the context of telemedecine
In business, automated processes can be specified using the BPMN standard, which stands for Business Process Model and Notation. It is presented as flowcharts with standardized graphical elements to show the possible flows and activities of a process. Thes ...
2022Logic Synthesis From Incomplete Specifications Using Disjoint Support Decomposition
Giovanni De Micheli, Andrea Costamagna
Approximate logic synthesis is an emerging field that tolerates errors in the synthesized logic circuits for better optimization quality. Indeed, in many computing problems, the requirement of preserving the exact functionality either results in unnecessar ...
IEEE2022A Majority Lemma for Randomised Query Complexity
Mika Tapani Göös, Gilbert Théodore Maystre
We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently stro ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition
Giovanni De Micheli, Heinz Riener, Siang-Yun Lee
Logic resynthesis is the problem of finding a dependency function to re-express a given Boolean function in terms of a given set of divisor functions. In this paper, we study logic resynthesis of majority-based circuits, which is motivated by the increasin ...
IEEE2021Three-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 INC2021Learning from survey propagation: a neural network for MAX-E-3-SAT
Many natural optimization problems are NP-hard, which implies that they are probably hard to solve exactly in the worst-case. However, it suffices to get reasonably good solutions for all (or even most) instances in practice. This paper presents a new algo ...
IOP PUBLISHING LTD2021From Boolean functions to quantum circuits: A scalable quantum compilation flow in C++
Giovanni De Micheli, Fereshte Mozafari Ghoraba, Heinz Riener, Giulia Meuli, Bruno Schmitt Antunes
We propose a flow for automated quantum compila- tion. Our flow takes a Boolean function implemented in Python as input and translates it into a format appropriate for reversible logic synthesis. We focus on two quantum compilation tasks: uniform state pre ...
2021Enumerating Optimal Quantum Circuits using Spectral Classification
Giovanni De Micheli, Mathias Soeken, Giulia Meuli
This work targets fault-tolerant quantum computing and focuses on the problem of mapping reversible circuits into the Clifford+T quantum gate library. We present an automatically-generated database containing minimal-cost quantum circuits for Boolean funct ...
IEEE2020