Optimizing Majority-Inverter Graphs with Functional Hashing

A <i>Majority-Inverter Graph</i> (MIG) is a recently introduced logic representation form whose algebraic and Boolean properties allow for efficient logic optimization. In particular, when considering logic depth reduction, MIG algorithms obtained significantly superior synthesis results as compared to the state-of-the-art approaches based on AND-inverter graphs and commercial tools. In this paper, we present a new MIG optimization algorithm targeting size minimization based on functional hashing. The proposed algorithm makes use of minimum MIG representations which are precomputed for functions up to 4 variables using an approach based on <i>Satisfiability Modulo Theories</i> (SMT). Experimental results show that heavily-optimized MIGs can be further minimized also in size, thanks to our proposed methodology. When using the optimized MIGs as starting point for technology mapping, we were able to improve both depth and area for the arithmetic instances of the EPFL benchmarks beyond the current results achievable by state-of- the-art logic synthesis algorithms.

Published in:
Proceedings of the Design, Automation & Test in Europe Conference (DATE)
Presented at:
Design, Automation & Test in Europe Conference (DATE), Dresden, Germany, March 14-18, 2016
New York, IEEE

 Record created 2015-11-03, last modified 2018-01-28

External link:
Download fulltext
Rate this document:

Rate this document:
(Not yet reviewed)