37 citations · 104 across the 11 of their papers we have counts for
12 papers
Think Locally Before Computing Jointly: Efficient Secure Multi-Party Computation via Maximizing Local Processing
Mingfei Yu, Chenglu Jin, Giovanni De Micheli
Secure multi-party computation (MPC) lets parties evaluate a function over private inputs without revealing them. In garbled-circuit (GC) protocols, prior optimization has largely…
TRAM: Training Approximate Multiplier Structures for Low-Power AI Accelerators
Chang Meng, Hanyu Wang, Yuyang Ye +3
Reducing power consumption in AI accelerators is increasingly important. Approximate computing can reduce power consumption while keeping the accuracy loss small. Since multipliers…
Practical Boolean Decomposition for Delay-driven LUT Mapping
Alessandro Tempia Calvino, Alan Mishchenko, Giovanni De Micheli +1
Ashenhurst-Curtis decomposition (ACD) is a decomposition technique used, in particular, to map combinational logic into lookup tables (LUTs) structures when synthesizing hardware d…
Quantum State Preparation Using an Exact CNOT Synthesis Formulation
Hanyu Wang, Bochen Tan, Jason Cong +1
Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation, as they introduce coupling constraints and more noise than single-qubit gate…
Scalable Sequential Optimization Under Observability Don't Cares
Dewmini Sudara Marakkalage, Eleonora Testa, Walter Lau Neto +3
Sequential logic synthesis can provide better Power-Performance-Area (PPA) than combinational logic synthesis since it explores a larger solution space. As the gate cost in advance…
Perspectives and Challenges of Scaled Boolean Spintronic Circuits Based on Magnetic Tunnel Junction Transducers
F. Meng, S. -Y. Lee, O. Zografos +9
This paper addresses the question: Can spintronic circuits based on Magnetic Tunnel Junction (MTJ) transducers outperform their state-of-the-art CMOS counterparts? To this end, we…
Efficient Deterministic Preparation of Quantum States Using Decision Diagrams
Fereshte Mozafari, Giovanni De Micheli, Yuxiang Yang
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…
QubitHD: A Stochastic Acceleration Method for HD Computing-Based Machine Learning
Samuel Bosch, Alexander Sanchez de la Cerda, Mohsen Imani +2
Machine Learning algorithms based on Brain-inspired Hyperdimensional(HD) computing imitate cognition by exploiting statistical properties of high-dimensional vector spaces. It is a…
The EPFL Logic Synthesis Libraries
Mathias Soeken, Heinz Riener, Winston Haaswijk +8
We present a collection of modular open source C++ libraries for the development of logic synthesis applications. These libraries can be used to develop applications for the design…
Design Automation and Design Space Exploration for Quantum Computers
Mathias Soeken, Martin Roetteler, Nathan Wiebe +1
A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for ar…
A Sound and Complete Axiomatization of Majority-n Logic
Luca Amaru, Pierre-Emmanuel Gaillardon, Anupam Chattopadhyay +1
Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators en…
An Application-Specific Design Methodology for STbus Crossbar Generation
Srinivasan Murali, Giovanni De Micheli
As the communication requirements of current and future Multiprocessor Systems on Chips (MPSoCs) continue to increase, scalable communication architectures are needed to support th…