The influence of the number of values in sub-functions on the effectiveness and efficiency of the functional decomposition

General functional decomposition has important applications in many fields of modern engineering and science. However, its practical usefulness for very complex systems is limited by the lack of an effective and efficient method for the construction of high quality sub-systems. One of the three basic problems of sub-system construction is the choice of an appropriate multi-valued sub-function to be computed by a certain sub-system. In this paper we show that the number of values of the sub-function is the decisive factor in sub-function selection. It shows a very strong positive correlation with both the number of logic blocks and the number of logic levels in the decomposition network, i.e. with the cost and delay of the network. This is a very important result from the practical viewpoint, because its exploitation enables efficient construction of high-quality multi-level circuits, by selection of a sub-function with the minimum possible number of values at each decomposition step. This result also gives a link for the input support selection for sub-systems. The selected input support should enable construction of a sub-function with the minimum possible number of values.

[1]  Mariusz Rawski,et al.  Efficient input support selection for sub-functions in functional decomposition based on information relationship measures , 1999, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium.

[2]  Robert J Bignall,et al.  Character Recognition Using Functional Decomposition , 1998 .

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

[4]  Henry Selvaraj,et al.  Balanced multilevel decomposition and its applications in FPGA-based synthesis , 1995 .

[5]  Shih-Chieh Chang,et al.  Technology mapping for TLU FPGAs based on decomposition of binary decision diagrams , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Lech Jóźwiak,et al.  General Decomposition and Its Use in Digital Circuit Synthesis , 1995 .

[7]  Lech Jozwiak,et al.  Input support minimization for efficient PLD and FPGA synthesis , 1996 .

[8]  Tadeusz Luba,et al.  Decomposition of multiple-valued functions , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[9]  Marek Perkowski,et al.  Exact Graph Coloring for Functional Decomposition: Do We Need It? , 1998 .

[10]  Mariusz Rawski,et al.  Non-disjoint decomposition of Boolean functions and its application in FPGA-oriented technology mapping , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).

[11]  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).