New algorithm for Boolean matching utilizing structural information

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)219-223
Number of pages5
JournalIEICE Transactions on Information and Systems
VolumeE78-D
Issue number3
Publication statusPublished - Mar 1995
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design
  • Information Systems
  • Software

Cite this

New algorithm for Boolean matching utilizing structural information. / Matsunaga, Yusuke.

In: IEICE Transactions on Information and Systems, Vol. E78-D, No. 3, 03.1995, p. 219-223.

Research output: Contribution to journalArticle

@article{6aa29a6293dc4dd88940cc6820cb9d52,
title = "New algorithm for Boolean matching utilizing structural information",
abstract = "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.",
author = "Yusuke Matsunaga",
year = "1995",
month = "3",
language = "English",
volume = "E78-D",
pages = "219--223",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "3",

}

TY - JOUR

T1 - New algorithm for Boolean matching utilizing structural information

AU - Matsunaga, Yusuke

PY - 1995/3

Y1 - 1995/3

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029277598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029277598&partnerID=8YFLogxK

M3 - Article

VL - E78-D

SP - 219

EP - 223

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -