Boolean Decomposition for AIG Optimization

Restructuring techniques for And-Inverter Graphs (AIG), such as rewriting and refactoring, are powerful, scalable and fast, achieving highly optimized AIGs after few iterations. However, these techniques are biased by the original AIG structure and limited by single output optimizations. This paper investigates AIG optimization for area, exploring how far Boolean methods can reduce AIG nodes through local optimization.Boolean division is applied for multi-output functions using two-literal divisors and Boolean decomposition is introduced as a method for AIG optimization. Multi-output blocks are extracted from the AIG and optimized, achieving a further AIG node reduction of 7.76% on average for ITC99 and MCNC benchmarks.

[1]  Peichen Pan,et al.  A new retiming-based technology mapping algorithm for LUT-based FPGAs , 1998, FPGA '98.

[2]  Noah A. Smith,et al.  Structured Sparsity in Natural Language Processing: Models, Algorithms and Applications , 2012, NAACL.

[3]  Jordi Cortadella,et al.  Boolean decomposition using two-literal divisors , 2004, 17th International Conference on VLSI Design. Proceedings..

[4]  Robert K. Brayton,et al.  Boolean factoring and decomposition of logic networks , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[5]  Robert K. Brayton,et al.  The use of observability and external don't cares for the simplification of multi-level networks , 1991, DAC '90.

[6]  Mayler G. A. Martins,et al.  KL-cut based digital circuit remapping , 2012, NORCHIP 2012.

[7]  Jan Schmidt,et al.  Improving the iterative power of resynthesis , 2012, 2012 IEEE 15th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS).

[8]  Christoph Scholl.  Multi-output functional decomposition with exploitation of don't cares , 1998, Proceedings Design, Automation and Test in Europe.

[9]  Lun Yao Wang,et al.  Multilevel logic simplification based on a containment recursive paradigm , 2003 .

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

[11]  Jordi Cortadella.  Timing-driven logic bi-decomposition , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  R. Brayton,et al.  Scalable Logic Synthesis using a Simple Circuit Structure , 2006 .

[13]  Robert K. Brayton,et al.  Combinational and sequential mapping with priority cuts , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[14]  Robert K. Brayton,et al.  DAG-aware AIG rewriting: a fresh look at combinational logic synthesis , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[15]  Felipe S. Marques,et al.  KL-Cuts: A new approach for logic synthesis targeting multiple output blocks , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).

[16]  A. Mishchenko,et al.  Factor Cuts , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

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