Bi-Decomposition and Tree-Height Reduction for Timing Optimization

A novel approach for timing-driven logic decomposition is presented. It is based on the combination of two strategies: logic bi-decompositionof Boolean functions and treeheight reduction of Boolean expressions. This technologyindependent approach allows to find tree-like expressions with smaller depths than the ones obtained by state-of-theart techniques. Experimentalresults show an average delay reduction of more than 20% with regard to speed up in SIS.

[1]  Massoud Pedram,et al.  OBDD-based function decomposition: algorithms and implementation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Robert K. Brayton,et al.  Delay-optimal technology mapping by DAG covering , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[3]  Robert K. Brayton,et al.  Timing optimization of combinational logic , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[4]  James C. Beatty.  An axiomatic approach to code optimization for expressions , 1972, JACM.

[5]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

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

[7]  Kenneth L. McMillan,et al.  Approximation and decomposition of binary decision diagrams , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[8]  Robert K. Brayton,et al.  Delay optimization of combinational logic circuits by clustering and partial collapsing , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

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

[10]  D. Bochmann,et al.  A new decomposition method for multilevel circuit design , 1991, Proceedings of the European Conference on Design Automation..

[11]  David L. Kuck,et al.  The Structure of Computers and Computations , 1978 .

[12]  Bernd Steinbach,et al.  An algorithm for bi-decomposition of logic functions , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[13]  Jean-Loup Baer,et al.  Compilation of arithmetic expressions for parallel computations , 1968, IFIP Congress.

[14]  Ankur Srivastava,et al.  On the complexity of gate duplication , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..