Logic Optimization of Majority-Inverter Graphs

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (29)

SAT-Based Exact Synthesis for Multi-Level Logic Networks

Winston Jason Haaswijk

Today, the design of electronic systems is largely automated. The practice of using software automation technologies for the design of electronic hardware is commonly referred to as Electronic Design Automation (EDA). EDA comprises a large set of tools, fr ...

EPFL2019

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa, Mathias Soeken

Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates. Our appro ...

ASSOC COMPUTING MACHINERY2019

The Complexity of Self-Dual Monotone 7-Input Functions

Giovanni De Micheli, Winston Jason Haaswijk, Eleonora Testa, Mathias Soeken

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

2019

Integrated ESOP Refactoring for Industrial Designs

Giovanni De Micheli, Luca Gaetano Amarù, Winston Jason Haaswijk, Mathias Soeken

We present a multi-level logic refactoring algorithm based on exclusive sum-of-product (ESOP) expressions. ESOP expressions are two-level logic representation forms, similar to sum of -product (SOP) expressions. However, ESOPs use EXOR instead of OR operat ...

IEEE2018

SAT Based Exact Synthesis using DAG Topology Families

Giovanni De Micheli, Winston Jason Haaswijk, Mathias Soeken

SAT based exact synthesis is a powerful technique, with applications in logic optimization, technology mapping, and synthesis for emerging technologies. However, its runtime behavior can be unpredictable and slow. In this paper, we propose to add a new typ ...

IEEE2018

Improvements to Boolean resynthesis

Giovanni De Micheli, Luca Gaetano Amarù, Mathias Soeken

In electronic design automation Boolean resynthesis techniques are increasingly used to improve the quality of results where algebraic methods hit local minima Boolean methods rely on complete functional properties of a logic circuit, preferably including ...

IEEE2018

Size Optimization of MIGs with an Application to QCA and STMG Technologies

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa, Mathias Soeken, Heinz Riener

Majority-inverter graphs (MIGs) are a logic representation with remarkable algebraic and Boolean properties that enable efficient logic optimizations beyond the capabilities of traditional logic representations. Further, since many nano-emerging technologi ...

ASSOC COMPUTING MACHINERY2018

Nonsilicon, Non-von Neumann Computing—Part I

Giovanni De Micheli

IEE2018

Majority Logic Synthesis

Giovanni De Micheli, Luca Gaetano Amarù, Odysseas Zografos, Eleonora Testa, Mathias Soeken

The majority function (xyz) evaluates to true, if at least two of its Boolean inputs evaluate to true. The majority function has frequently been studied as a central primitive in logic synthesis applications for many decades. Knuth refers to the majority f ...

ASSOC COMPUTING MACHINERY2018

Page 2 sur 2