Recherche

Afficher tous les résultats pour

Accueil

Personne

Giovanni De Micheli

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (554)

Accuracy recovery: A decomposition procedure for the synthesis of partially-specified Boolean functions

Giovanni De Micheli, Andrea Costamagna

Logic Synthesis From Partial Specifications (LSFPS) is the problem of finding the hardware implementation of a Boolean function from a partial knowledge of its care set. The elements missing from the specifications are named don't knows. The exact solution ...

ELSEVIER2023

Garbled Circuits Reimagined: Logic Synthesis Unleashes Efficient Secure Computation

Giovanni De Micheli, Dewmini Sudara Marakkalage, Mingfei Yu

Garbled circuit (GC) is one of the few promising protocols to realize general-purpose secure computation. The target computation is represented by a Boolean circuit that is subsequently transformed into a network of encrypted tables for execution. The need ...

MDPI2023

Striving for Both Quality and Speed: Logic Synthesis for Practical Garbled Circuits

Giovanni De Micheli, Mingfei Yu

IEEE2023

Technology Mapping Using Multi-output Library Cells

Giovanni De Micheli, Alessandro Tempia Calvino

2023

Depth-optimal Buffer and Splitter Insertion and Optimization in AQFP Circuits

Giovanni De Micheli, Alessandro Tempia Calvino

The Adiabatic Quantum-Flux Parametron (AQFP) is an energy-efficient superconducting logic family. AQFP technology requires buffer and splitting elements (B/S) to be inserted to satisfy path-balancing and fanout-branching constraints. B/S insertion policies ...

IEEE2023

Boolean Rewriting Strikes Back: Reconvergence- Driven Windowing meets Resynthesis

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

The paper presents a novel DAG-aware Boolean rewriting algorithm for restructuring combinational logic before technology mapping. The algorithm, called window rewriting, repeatedly selects small parts of the logic and replaces them with more compact implem ...

IEEE2022

Efficient deterministic preparation of quantum states using decision diagrams

Giovanni De Micheli, Fereshte Mozafari Ghoraba

Loading classical data into quantum registers is one of the most important primitives of quantum computing. While the complexity of preparing a generic quantum state is exponential in the number of qubits, in many practical tasks the state to prepare has a ...

2022

Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective

Giovanni De Micheli

Universal and fault-tolerant quantum computation is a promising new paradigm that may efficiently conquer difficult computation tasks beyond the reach of classical computation. It motivates the development of various quantum technologies. The rapid progres ...

2022

Design and Optimization of Quantum Electronic Circuits

Giovanni De Micheli

Quantum electronic circuits where the logic information is processed and stored in single flux quanta promise efficient computation in a performance/power metric, and thus are of utmost interest as possible replacement or enhancement of CMOS. Several elect ...

ASSOC COMPUTING MACHINERY2022

A Versatile Mapping Approach for Technology Mapping and Graph Optimization

Giovanni De Micheli, Heinz Riener, Alessandro Tempia Calvino, Shubham Rai, Akash Kumar

This paper proposes a versatile mapping approach that has three objectives: i) it can map from one technology-independent graph representation to another; ii) it can map to a cell library; iii) it supports logic rewriting. The method is cut-based, mitigate ...

IEEE2022

Design and Automation for Quantum Computation and Quantum Technologies

Giovanni De Micheli

Quantum computation is a promising field of research that will shift the computation paradigm for data and information processing with quantum parallelism. This Special Issue of the IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS (JETC ...

2022

tweedledum: A Compiler Companion for Quantum Computing

Giovanni De Micheli, Bruno Schmitt Antunes

This work presents tweedledum-an extensible open-source library aiming at narrowing the gap between high-level algorithms and physical devices by enhancing the expressive power of existing frameworks. For example, it allows designers to insert classical lo ...

IEEE2022

Logic 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 ...

IEEE2022

Fanout-Bounded Logic Synthesis for Emerging Technologies - A Top- Down Approach

Giovanni De Micheli, Dewmini Sudara Marakkalage

2022

Cost-generic Resubstitution Algorithm with Customizable Cost Functions

Giovanni De Micheli, Siang-Yun Lee, Hanyu Wang

2022

External Don’t Cares in Logic Synthesis

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

2022

Xor-And-Inverter Graphs for Quantum Compilation

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

Quantum compilation is the task of translating a high-level description of a quantum algorithm into a sequence of low-level quantum operations. We propose and motivate the use of Xor-And-Inverter Graphs (XAG) to specify Boolean functions for quantum compil ...

2022

A Simulation-Guided Paradigm for Logic Synthesis and Verification

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

This article proposes a new logic synthesis and verification paradigm based on circuit simulation. In this paradigm, high quality, expressive simulation patterns are pregenerated to be reused in multiple runs of optimization and verification algorithms, re ...

2022

Majority-based Design Flow for AQFP Superconducting Family

Giovanni De Micheli, Dewmini Sudara Marakkalage, Siang-Yun Lee, Alessandro Tempia Calvino

Adiabatic superconducting devices are promising candidates to develop high-speed/low-power electronics. Advances in physical technology must be matched with a systematic development of comprehensive design and simulation tools to bring superconducting elec ...

IEEE2022

Efficient Preparation of Cyclic Quantum States

Giovanni De Micheli, Fereshte Mozafari Ghoraba

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

IEEE2022

Page 3 sur 28