Majority-Inverter Graph: A novel data-structure and algorithms for efficient logic optimization

In this paper, we present Majority-Inverter Graph (MIG), a novel logic representation structure for efficient optimization of Boolean functions. An MIG is a directed acyclic graph consisting of three-input majority nodes and regular/complemented edges. We show that MIGs include any AND/OR/Inverter Graphs (AOIGs), containing also the wellknown AIGs. In order to support the natural manipulation of MIGs, we introduce a new Boolean algebra, based exclusively on majority and inverter operations, with a complete axiomatic system. Theoretical results show that it is possible to explore the entire MIG representation space by using only five primitive transformation rules. Such feature opens up a great opportunity for logic optimization and synthesis. We showcase the MIG potential by proposing a delay-oriented optimization technique. Experimental results over MCNC benchmarks show that MIG optimization reduces the number of logic levels by 18%, on average, with respect to AIG optimization performed by ABC academic tool. Employed in a traditional optimization-mapping circuit synthesis flow, MIG optimization enables an average reduction of {22%, 14%, 11%} in the estimated {delay, area, power} metrics, before physical design, as compared to academic/commercial synthesis flows.

[1]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[2]  Hans-Jürgen Bandelt,et al.  Median algebras , 1983, Discret. Math..

[3]  G. De Micheli,et al.  Polarity control in double-gate, gate-all-around vertically stacked silicon nanowire FETs , 2012, 2012 International Electron Devices Meeting.

[4]  Alberto L. Sangiovanni-Vincentelli,et al.  Multiple-Valued Minimization for PLA Optimization , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[6]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[7]  Robert K. Brayton,et al.  Multiple-Level Logic Optimization System , 2003 .

[8]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[9]  P. D. Tougaw,et al.  Logical devices implemented using quantum cellular automata , 1994 .

[10]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[11]  Wolfgang Porod,et al.  Device and Architecture Outlook for Beyond CMOS Switches , 2010, Proceedings of the IEEE.

[12]  M. Stone The theory of representations for Boolean algebras , 1936 .

[13]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[14]  Congguang Yang,et al.  BDD-BASED LOGIC OPTIMIZATION SYSTEM , 2000 .

[15]  Maciej J. Ciesielski,et al.  BDS: a BDD-based logic optimization system , 2000, DAC.

[16]  G. Birkhoff,et al.  A ternary operation in distributive lattices , 1947 .

[17]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  Tsutomu Sasao,et al.  Switching Theory for Logic Synthesis , 1999, Springer US.

[19]  Robert K. Brayton,et al.  ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.