Logic Optimization of Majority-Inverter Graphs

Conference: MBMV 2019 - 22. Workshop „Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen“
04/08/2019 - 04/08/2019 at Kaiserslautern, Deutschland

Proceedings: MBMV 2019

Pages: 4Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Riener, Heinz; Testa, Eleonora; Haaswijk, Winston; De Micheli, Giovanni; Soeken, Mathias (EPFL, Lausanne, Switzerland)
Mishchenko, Alan (UC Berkeley, CA, United States)
Amaru, Luca (Synopsys Inc, Sunnyvale, CA, United States)

Majority-inverter graphs (MIGs) are a multi-level logic representation of Boolean functions with remarkable algebraic and Boolean properties that enable efficient logic optimizations beyond the capabilities of conventional logic representations. In this paper, we survey two state-of-the-art logic optimization methods for MIGs: cut rewriting and cut resubstitution. Both algorithms are generic and can be applied to arbitrary graph-based logic representations. We describe them in a unified framework and show experimental results for MIG size optimization using the EPFL combinational benchmark suite.