Publications associées à Circuit booléen

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

2024

Technology-Aware Logic Synthesis for Superconducting Electronics

Giovanni De Micheli, Alessandro Tempia Calvino, Dewmini Sudara Marakkalage, Mingfei Yu, Siang-Yun Lee, Rassul Bairamkulov

Superconducting electronics provide us with cryogenic digital circuits that can rival established technologies in performance and energy consumption. Today, the lack of tools for the design of large-scale integrated superconducting circuits is a major obst ...

2024

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Giovanni De Micheli, Alessandro Tempia Calvino

Rapid single-flux quantum (RSFQ) is one of the most advanced and promising superconducting logic families, offering exceptional energy efficiency and speed. RSFQ technology requires delay registers (DFFs) and splitter cells to satisfy the path-balancing an ...

2024

Overhead-constrained circuit knitting for variational quantum dynamics

Giuseppe Carleo, Gian Florin Gentinetta, Friederike Metz

Simulating the dynamics of large quantum systems is a formidable yet vital pursuit for obtaining a deeper understanding of quantum mechanical phenomena. While quantum computers hold great promise for speeding up such simulations, their practical applicatio ...

Verein Forderung Open Access Publizierens Quantenwissenschaf2024

Unleashing Parallelism in Elastic Circuits with Faster Token Delivery

Paolo Ienne, Andrea Guerrieri, Lana Josipovic, Ayatallah Ahmed Gamal Kamal Elakhras

High-level synthesis (HLS) is the process of automatically generating circuits out of high-level language descriptions. Previous research has shown that dynamically scheduled HLS through elastic circuit generation is successful at exploiting parallelism in ...

IEEE COMPUTER SOC2022

Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

Bruno Schmitt Antunes

We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a nonscalabl ...

ASSOC COMPUTING MACHINERY2022

Improving First-Order Threshold Implementations of SKINNY

Andrea Felice Caforio, Daniel Patrick Collins, Subhadeep Banik, Ognjen Glamocanin

Threshold Implementations have become a popular generic technique to construct circuits resilient against power analysis attacks.In this paper, we look to devise efficient threshold circuits for the lightweight block cipher family SKINNY. The only threshol ...

Springer, Cham2021

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Edoardo Charbon, Claudio Bruschini, Ivan Michel Antolovic, Mario Stipcevic

Harnessing quantum randomness for the generation of random numbers is an important concept crucial for information security and many other computer-related applications. Quantum random number generators (QRNGs) are evolving from bulky, slow, and expensive ...

SPIE2021

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

IEEE2021

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Circuit booléen

Scalable Logic Rewriting Using Don’t Cares

Technology-Aware Logic Synthesis for Superconducting Electronics

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Overhead-constrained circuit knitting for variational quantum dynamics

Proofs, Circuits, and Communication

Unleashing Parallelism in Elastic Circuits with Faster Token Delivery

Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

Improving First-Order Threshold Implementations of SKINNY

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

Graph Chatbot

Chattez avec Graph Search

Overhead-constrained circuit knitting for variational quantum dynamics

Technology-Aware Logic Synthesis for Superconducting Electronics

Unleashing Parallelism in Elastic Circuits with Faster Token Delivery

Scalable Logic Rewriting Using Don’t Cares

Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

Improving First-Order Threshold Implementations of SKINNY

Proofs, Circuits, and Communication