A New Algorithm for Boolean Matching Utilizing Structural Information : PAPER Special Issue on Synthesis and Verification of Hardware Design
スポンサーリンク
概要
- 論文の詳細を見る
The paper describes a new algorithm for Boolean matching, which is based on BDD structure manipulation. Pruning of the search space takes place after partial assignments if certain subgraphs of two BDD's become inequivalent. This pruning is different from existing techniques, so that the search space is further reduced. Another feature of this algorithm is topological filtering. Usually, many functions have no matchings and this is easily found by only counting the number of minterms. To check it quickly, upper and lower bounds of minterm count are calculated from topological information. Using these bounds, functions that have no matchings are discarded without building their BDD's.
- 一般社団法人電子情報通信学会の論文
- 1995-03-25
著者
関連論文
- Phase Optimization in Technology Mapping
- Enhanced Unique Sensitization for Efficient Test Generation (Special Issue on Synthesis and Verification of Hardware Design)
- Robust Heuristics for Multi-Level Logic Simplification Considering Local Circuit Structure (Special Section on VLSI Design and CAD Algorithms)
- An Iterative Improvement Method for State Minimization of Incompletely Specified Finite State Machines (Special Issue on Synthesis and Verification of Hardware Design)
- A New Algorithm for Boolean Matching Utilizing Structural Information : PAPER Special Issue on Synthesis and Verification of Hardware Design
- MINT-An Exact Algorithm for Finding Minimum Test Set (Special Section on VLSI Design and CAD Algorithms)