Efficient logic synthesis for FPGAs with functional decomposition based on information relationship measures

General functional decomposition has important applications in many fields of modern engineering and science. Its practical usefulness for very complex systems is, however, limited by the lack of an effective and efficient method for selection of the appropriate input supports for subsystems. A classical method based on a systematic search of the whole solution space is inefficient. In this paper, an effective heuristic method for input support selection is proposed and discussed. The method is based on application of information relationship measures, which allows us to reduce the search space to a manageable size while keeping high-quality solutions in the reduced space. Experimental results demonstrate that the proposed heuristic method is able to construct optimal or near-optimal supports efficiently, even for large systems. It is much faster than the systematic method while delivering results of comparable quality.

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

[2]  Tadeusz Łuba,et al.  Multi-level logic synthesis based on decomposition , 1994 .

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

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

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

[6]  T. Y. Lin,et al.  Rough Sets and Data Mining , 1997, Springer US.

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

[8]  Lech J o zwiak.  Analysis and Synthesis of Information Systems with Information Relationships and Measures , 1998 .

[9]  Tadeusz Luba,et al.  Rough Sets and Some Aspects of Logic Synthesis , 1992, Intelligent Decision Support.

[10]  Blaz Zupan,et al.  Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition , 1998, Informatica.

[11]  Malgorzata Marek-Sadowska,et al.  Decomposition of Multiple-Valued Relations , 1997, ISMVL.

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

[13]  Tsau Young Lin,et al.  Rough Sets and Data Mining: Analysis of Imprecise Data , 1996 .

[14]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .