论文信息 - An improved column compatibility approach for partition based functional decomposition

An improved column compatibility approach for partition based functional decomposition

The paper deals with the problem of generating compatible pairs of a k-block partition P(B)=(B/sub 1/, B/sub 2/, ..., B/sub k/), where B is the bound set. Compatible and incompatible pairs of block partitions of P(B) are generated by a partition calculus based approach called the Block Compatible Approach. The compatible block partitions generate a compatibility graph that can be solved using clique partition algorithms. The incompatible block partitions form an incompatibility graph, which can be solved using a graph colouring algorithm or maximum independent set (MIS) partition algorithm.

Venkatesan Muthukumar | Robert J. Bignall | Henry Selvaraj

[1] Tsutomu Sasao,et al. FPGA Design by Generalized Functional Decomposition , 1993 .

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

[3] Panos M. Pardalos,et al. On maximum clique problems in very large graphs , 1999, External Memory Algorithms.

[4] Wei Wan,et al. A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

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

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