On-the-fly and DAG-aware: Rewriting Boolean Networks with Exact Synthesis

The paper presents a generalization of DAG-aware AIG rewriting for k-feasible Boolean networks, whose nodes are k-input lookup tables (k-LUTs). We introduce a high-effort DAG-aware rewriting algorithm, called cut rewriting, which uses exact synthesis to compute replacements on the fly, with support for Boolean don’t cares. Cut rewriting pre-computes a large number of possible replacement candidates, but instead of eagerly rewriting the Boolean network, stores the replacements in a conflict graph. Heuristic optimization is used to derive a best, maximal subset of replacements that can be simultaneously applied to the Boolean network from the conflict graph. We optimize LUT mapped Boolean networks obtained from the ISCAS and EPFL combinational benchmark suites. For 3-LUT networks, experiments show that we achieve an average size improvement of 5.58% and up to 40.19% after state-of-the-art Boolean rewriting techniques were applied until saturation. Similarly, for 4-LUT networks, we obtain an average improvement of 4.04% and up to 12.60%.

[1]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[2]  Robert K. Brayton,et al.  Improvements to Technology Mapping for LUT-Based FPGAs , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Robert K. Brayton,et al.  Reducing structural bias in technology mapping , 2006, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[4]  Leo Hellerman,et al.  A Catalog of Three-Variable Or-Invert and And-Invert Logical Circuits , 1963, IEEE Trans. Electron. Comput..

[5]  Robert K. Brayton,et al.  Scalable don't-care-based logic optimization and resynthesis , 2009, FPGA '09.

[6]  Sungmin Cho,et al.  Combinational and sequential mapping with priority cuts , 2007, ICCAD 2007.

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

[8]  Giovanni De Micheli,et al.  SAT Based Exact Synthesis using DAG Topology Families , 2018, 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC).

[9]  Jason Cong,et al.  Cut ranking and pruning: enabling a general and efficient FPGA mapping solution , 1999, FPGA '99.

[10]  Mathias Soeken,et al.  Exact Synthesis of Majority-Inverter Graphs and Its Applications , 2017, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[12]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..

[13]  Giovanni De Micheli,et al.  The EPFL Combinational Benchmark Suite , 2015 .

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

[15]  Grigory Yaroslavtsev,et al.  Finding Efficient Circuits Using SAT-Solvers , 2009, SAT.

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

[17]  Giovanni De Micheli,et al.  Busy man's synthesis: Combinational delay optimization with SAT , 2017, Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017.

[18]  Giovanni De Micheli,et al.  The EPFL Logic Synthesis Libraries , 2018, ArXiv.

[19]  Malay K. Ganai,et al.  Robust Boolean reasoning for equivalence checking and functional property verification , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Giovanni De Micheli,et al.  Majority-Inverter Graph: A New Paradigm for Logic Optimization , 2016, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Jason Cong,et al.  On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.