Integrated ESOP Refactoring for Industrial Designs

We present a multi-level logic refactoring algorithm based on exclusive sum-of-product (ESOP) expressions. ESOP expressions are two-level logic representation forms, similar to sum-of-product (SOP) expressions. However, ESOPs use EXOR instead of OR operators. It has been shown that this allows ESOPs to be exponentially more compact than SOP expressions for important classes of functions. Our algorithm is based on a combination of ESOP collapsing, minimization, and refactoring. In EXOR-heavy logic, such as arithmetic units, it unlocks optimizations that may be outside the reach of SOP based methods. We show that our method is able to significantly improve upon logic optimization results, as compared to a similar SOP based flow. On a set of EXOR-heavy benchmarks, we reduce logic levels by up to 83.3% in the best case, and by 44.6% on average. Further, we are able to reduce logic network size by 21.4% on average. We have integrated our method into a commercial synthesis flow. On a set of 46 industrial benchmarks, the optimizations introduced by our algorithm improve design results after physical synthesis.

[1]  Tiziano Villa,et al.  Logic Minimization and Testability of 2-SPP Networks , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Valentina Ciriani Synthesis of SPP three-level logic networks using affine spaces , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Tsutomu Sasao EXMIN: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued input two-valued output functions , 1990, Proceedings of the Twentieth International Symposium on Multiple-Valued Logic.

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

[6]  Tsutomu Sasao EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Tsutomu Sasao,et al.  Logic Synthesis and Optimization , 1997 .

[8]  Rolf Drechsler,et al.  Pseudo Kronecker expressions for symmetric functions , 1997, Proceedings Tenth International Conference on VLSI Design.

[9]  M. Perkowski,et al.  Minimization of multiple-valued input multi-output mixed-radix exclusive sums of products for incompletely specified Boolean functions , 1989, Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic.

[10]  Marek A. Perkowski,et al.  Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  M. Perkowski,et al.  An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions , 1990, IEEE International Symposium on Circuits and Systems.

[12]  Marek A. Perkowski,et al.  EXORCISM-MV-2: minimization of exclusive sum of products expressions for multiple-valued input incompletely specified functions , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[13]  Tsutomu Sasao An exact minimization of AND-EXOR expressions using reduced covering functions , 1993 .

[14]  A. Mishchenko,et al.  Fast Heuristic Minimization of Exclusive-Sums-of-Products , 2001 .

[15]  Marek A. Perkowski,et al.  A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms , 1988, DAC '88.

[16]  Fabrizio Luccio,et al.  On a New Boolean Function with Applications , 1999, IEEE Trans. Computers.

[17]  Patrick Vuillod,et al.  Logic optimization and synthesis: Trends and directions in industry , 2017, Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017.