A new canonical form for fast boolean matching in logic synthesis and verification

Abdollahi, Afshin; Pedram, Massoud

doi:10.1145/1065579.1065681

Cited by 31 publications

(30 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A survey of Boolean matching techniques for library binding is given in [4]. Until recently, Boolean matching techniques scaled only to 10-20 inputs and one output [5,2], which is sufficient for technology mapping, but not for applications considered in our work. In 2008, Abdollahi and Pedram presented algorithms based on canonical forms that can handle libraries with numerous cells limited to approximately 20 inputs [2].…”

Section: Previous Workmentioning

confidence: 99%

“…Until recently, Boolean matching techniques scaled only to 10-20 inputs and one output [5,2], which is sufficient for technology mapping, but not for applications considered in our work. In 2008, Abdollahi and Pedram presented algorithms based on canonical forms that can handle libraries with numerous cells limited to approximately 20 inputs [2]. Their approach uses generalized sig-natures (signatures of one or more variables) to find a canonicity-producing (CP) phase assignment and ordering for variables.…”

Section: Previous Workmentioning

confidence: 99%

“…The goal of signature-based matching is to prune the Boolean matching space by filtering out impossible I/O correspondences [4,1]. On the other hand, in matching based on canonical forms, first canonical representations of two Boolean functions are computed and then compared against each other to find valid I/O matches [3,2]. Here, our PP-equivalence checking method first prunes the search space using graph algorithms and simulation signatures, then it invokes SAT-solving until exact I/O matches are found ( Figure 2).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Large-Scale Boolean Matching

Katebi

Markov

2010

Advanced Techniques in Logic Synthesis, Optimizations and Applications

View full text Add to dashboard Cite

Section: Previous Workmentioning

confidence: 99%

Section: Previous Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Large-Scale Boolean Matching

Katebi

Markov

2010

Advanced Techniques in Logic Synthesis, Optimizations and Applications

View full text Add to dashboard Cite

“…Therefore, structural approaches can only handle simple functions. In contrast, functional mapping approaches [3,4] use the formal algorithms to check whether the target function matches the netlist with the given permutable boundary. Several recent studies [4,5] use Boolean signatures for identifying large-scale functions.…”

Section: Introductionmentioning

confidence: 99%

ICCAD-2013 CAD contest in technology mapping for macro blocks and benchmark suite

Hsu¹,

Lin²,

Wang³

et al. 2013

2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

View full text Add to dashboard Cite

As technology advances, there is an increasing need in the industrial domain for an algorithm that can map macro blocks. This type of algorithm would solve several front-end problems. For example, existing structural or functional algorithms cannot solve the challenge of mapping large-scale functions without boundary information. Fortunately, in practical problems, we only consider the target mapping functions that are the constructs of the datapath, and these macro blocks are easily recognized through their special arithmetic signatures. In this problem, the contestants need to design a mapping algorithm that recognizes macro blocks and replaces the mapped region with the macro blocks. Therefore, we can fairly evaluate the quality of the mapping algorithm as the size reduction of the revised netlist. Under our well-designed benchmarks, we will clearly differentiate the capability of proposed algorithms with several indexes. We look forward to triggering the academic area to investigate on this problem.

show abstract

“…In the early 90's, the work in the article [1] opened the door of research on Boolean matching for technology mapping. Over the past decade, many studies had been devoted to Boolean matching and various Boolean matching methods were proposed [1]- [6]. Among these methods, exploiting signatures and computing canonical forms of Boolean functions are the most successful approaches to deal with Boolean matching.…”

Section: Introductionmentioning

confidence: 99%

Exploiting K-Distance Signature for Boolean Matching and G-Symmetry Detection

Wang

2006

Proceedings of the 43rd Annual Conference on Design Automation - DAC '06

View full text Add to dashboard Cite

In this paper, we present the concept of k-distance signature which is a general case of many existing signatures. By exploiting k-distance signature, we propose an Algorithm for Input Differentiation (AID) which is very powerful to distinguish inputs of Boolean functions. Moreover, based on AID, we propose a heuristic method to detect G-symmetry of Boolean functions and a Boolean matching algorithm. The experimental results show that our methods are not only effective but also very efficient for Boolean matching and G-symmetry detection.

show abstract

A new canonical form for fast boolean matching in logic synthesis and verification

Cited by 31 publications

References 10 publications

Large-Scale Boolean Matching

Large-Scale Boolean Matching

ICCAD-2013 CAD contest in technology mapping for macro blocks and benchmark suite

Exploiting K-Distance Signature for Boolean Matching and G-Symmetry Detection

Contact Info

Product

Resources

About