Boolean matching using binary decision diagrams with applications to logic synthesis and verification

Lai, Yung-Te; Sastry, S.; Pedram, Massoud

doi:10.1109/iccd.1992.276313

Cited by 57 publications

(31 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Algorithms for Boolean matching have applications in cell-library binding where it is necessary to repeatedly check if some part of a multiplelevel representation of a Boolean function can be realized by any of the cells from a given library [7], in logic verification where correspondence of the inputs of two circuits are unknown [14,24], and in table look-up based logic synthesis [5]. In this paper, we consider Boolean matching problem for cell-library binding.…”

Section: Introductionmentioning

confidence: 99%

“…Equality in the signatures are a necessary condition for Boolean matching of two functions; although it is not the sufficient condition, signature-based algorithms have successfully demonstrated their effectiveness. Some of the signature-based algorithms are efficient for performing pair-wise Boolean matching [14,18,23,24]; however, to match a function against a library they often require to perform pair-wise matchings of the function with all the library cells. Therefore, Boolean matching techniques based on them are unsuitable for handling libraries with large number of cells.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient computation of canonical form for boolean matching in large libraries

Debnath¹,

Sasao²

ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)

View full text Add to dashboard Cite

Abstract-This paper presents an efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large. As a basis of the Boolean matching, we use the notion NP-representative (NPR); two functions have the same NPR if one can be obtained from the other by a permutation and/or complementation(s) of the variables. By using a table look-up and a tree-based breadthfirst search strategy, our method quickly computes NPR for a given function. Boolean matching of the given function against the whole library is determined by checking the presence of its NPR in a hash table, which stores NPRs for all the library functions and their complements. The effectiveness of our method is demonstrated through experimental results, which shows that it is more than two orders of magnitude faster than the Hinsberger-Kolla's algorithm-the fastest Boolean matching algorithm for large libraries.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient computation of canonical form for boolean matching in large libraries

Debnath¹,

Sasao²

ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)

View full text Add to dashboard Cite

show abstract

“…They are well-known and widely used in logic synthesis [16,10] and formal verification [2,15] of integrated circuits. BDDs are well-suited for applications in the area of logic synthesis, because the cubes in the ON-set of a Boolean function are implicitly represented in this data structure.…”

Section: Introductionmentioning

confidence: 99%

Disjoint Sum of Product Minimization by Evolutionary Algorithms

Drechsler

Hilgemeier

Fey

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD.This paper presents an Evolutionary Algorithm (EA) to optimize the DSOP representation of a given Boolean function. The EA is used to find an optimized variable ordering for the BDD representation. Then the DSOP is derived from the optimized BDD using structural and symbolic techniques. Experiments are performed to adjust the parameters of the EA. Experimental results are given to demonstrate the efficiency of the approach.

show abstract

“…Signatures of the functions and of the individual variables are widely utilized for this purpose [3], [6], [7], [10]. Symmetry property among variables is another important characteristic [3], [6], [7], [8], [9], [10].…”

Section: Introductionmentioning

confidence: 99%

“…This is due to the fact that, in most cases, the input variable correspondence is not known in advance. In recent years, Boolean matching has been proposed, where networks are converted to their Boolean function representations and matching is decided by the equivalence check on the appropriate functions [2], [3], [6], [7], [9], [10].…”

Section: Introductionmentioning

confidence: 99%

Boolean matching using generalized Reed-Muller forms

Tsai

Marek-Sadowska

1994

Proceedings of the 31st Annual Conference on Design Automation Conference - DAC '94

View full text Add to dashboard Cite

--In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis tool. Input permutation, as well as input and output negation for matching are handled simultaneously. To reduce the search space for input correspondence, we have developed a method that can detect symmetries of any number of inputs simultaneously. Experiments on MCNC benchmark circuits are very encouraging.

show abstract

Boolean matching using binary decision diagrams with applications to logic synthesis and verification

Cited by 57 publications

References 10 publications

Efficient computation of canonical form for boolean matching in large libraries

Efficient computation of canonical form for boolean matching in large libraries

Disjoint Sum of Product Minimization by Evolutionary Algorithms

Boolean matching using generalized Reed-Muller forms

Contact Info

Product

Resources

About