Free Kronecker decision diagrams and their application to Atmel 6000 series FPGA mapping

This paper introduces the concepts of PseudoKronecker Decision Diagrams (PKDDs) with Negated Edges, as well as F+ee Kronecker Decision Diagrams (FKDDs), that generalize both the well-known Binary Decision Diagmms and Functional Decision Diagmms, as well as Ihe recently introduced Ordered Kronecker Decision Diagrams (OKDDs . We give efficient algorithm for Ihe generation / o FKDDs for multi-output functions and show their application 20 FPGA mapping. On MCNC benchmarks we demon&ale Ihe advantage of FKDDs in terms of reduced number.9 of nodes (cells) and levels in Ihe circuit over Ihe OKDDs and Permuted RM ties. The mapping algorithm can be easily adopied lo other cellular FPGAS, especially those from Motorola.

[1]  D. Green.  Families of Reed-Muller canonical forms , 1991 .

[2]  Marek A. Perkowski,et al.  Minimization of Permuted Reed-Muller Trees for Cellular Logic , 1992, FPL.

[3]  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.

[4]  Marek A. Perkowski.  The generalized orthonormal expansion of functions with multiple-valued inputs and some of its applications , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[5]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[6]  Jean-Pierre Deschamps,et al.  Discrete and switching functions , 1978 .

[7]  M. Crastes,et al.  Synthesis on multiplexer-based programmable devices using (ordered) binary decision diagrams , 1992, Proceedings Euro ASIC '92.

[8]  Ron Kohavi,et al.  Bottom-Up Induction of Oblivious Read-Once Decision Graphs: Strengths and Limitations , 1994, AAAI.

[9]  Marek A. Perkowski,et al.  Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  M. A. Perkowski,et al.  Canonical multi-valued input Reed-Muller trees and forms , 1991 .

[11]  Fabio Somenzi,et al.  Variable ordering for binary decision diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.

[12]  Wolfgang Rosenstiel,et al.  Multilevel logic synthesis based on functional decision diagrams , 1992, [1992] Proceedings The European Conference on Design Automation.

[13]  Rolf Drechsler,et al.  Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams , 1994, 31st Design Automation Conference.

[14]  Marek A. Perkowski,et al.  EXORCISM-MV-2: minimization of exclusive sum of products expressions for multiple-valued input incompletely specified functions , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[15]  Marek Perkowski,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 .

[16]  Marek A. Perkowski,et al.  Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.