Efficient Boolean matching in technology mapping with very large cell libraries

A new method for quickly retrieving Boolean functions from an arbitrarily large library is introduced. The method relies on signature calculation for variables of Boolean functions. Signatures induce an ordering of the variables which is used to construct a BDD (binary decision diagram). The potential of the method is demonstrated by an application in technology mapping for Actel FPGAs (field programmable gate arrays). The proposed approach can handle any kind of gate in the library. Experimental results show that libraries 3 to 4 orders of magnitude larger than those previously used can be dealt with efficiently.

[1]  Kurt Keutzer.  DAGON: Technology Binding and Local Optimization by DAG Matching , 1987, DAC.

[2]  Alberto Sangiovanni-Vincentelli,et al.  Logic synthesis for vlsi design , 1989 .

[3]  Giovanni De Micheli,et al.  Technology mapping using Boolean matching and don't care sets , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[4]  Robert K. Brayton,et al.  Logic synthesis for programmable gate arrays , 1991, DAC '90.

[5]  Giovanni De Micheli,et al.  Technology mapping for electrically programmable gate arrays , 1991, 28th ACM/IEEE Design Automation Conference.

[6]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[7]  Ulf Schlichtmann,et al.  Characterization of Boolean functions for rapid matching in EPGA technology mapping , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[8]  Massoud Pedram,et al.  Boolean matching using binary decision diagrams with applications to logic synthesis and verification , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[9]  D. E. Long,et al.  Efficient Boolean function matching , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.