A variable partition approach for disjoint decomposition

This paper deals with the problem of determining the set of best free and bound variables (variable partitioning problem) for disjoint serial decomposition, such that the decomposed functions are smaller in size and have maximal don't cares. A pruned breadth first search (PBFS) approach is proposed to determine the set of good variable partitions with minimal time and computational complexity. The set of best variable partitions are selected from the set of good variable partitions by (1) determining the number of block partitions in the output partition of the predecessor function, and (2) heuristic evaluation of the number of don't cares that may be introduced during the encoding of the decomposed functions. The proposed approach has been successfully implemented and tested with MCNC and Espresso benchmarks.

[1]  Lech Józwiak,et al.  An efficient approach to decomposition of multi-output Boolean functions with large sets of bound variables , 1998, Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204).

[2]  Lech Józwiak,et al.  Information relationships and measures: an analysis apparatus for efficient information system synthesis , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).

[3]  Mariusz Rawski,et al.  The influence of the number of values in sub-functions on the effectiveness and efficiency of the functional decomposition , 1999, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium.

[4]  Srinivas Devadas,et al.  Exact algorithms for output encoding, state assignment, and four-level Boolean minimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Tadeusz Luba,et al.  A General Approach to Boolean Function Decomposition and its Application in FPGABased Synthesis , 1995, VLSI Design.

[6]  Sarma B. K. Vrudhula,et al.  BDD Based Decomposition of Logic Functions with Application to FPGA Synthesis , 1993, 30th ACM/IEEE Design Automation Conference.

[7]  V. Muthukumar,et al.  An input-output encoding approach for serial decomposition , 2000, Proceedings 13th Symposium on Integrated Circuits and Systems Design (Cat. No.PR00843).

[8]  Peter Weiner,et al.  A Fast Algorithm for the Disjunctive Decomposition of Switching Functions , 1971, IEEE Transactions on Computers.