Shared binary decision diagram with attributed edges for efficient Boolean function manipulation

  • Authors:
  • Shin-ichi Minato;Nagisa Ishiura;Shuzo Yajima

  • Affiliations:
  • Department of Information Science, Faculty of Engineering, Kyoto University, Kyoto, 606, Japan;Department of Information Science, Faculty of Engineering, Kyoto University, Kyoto, 606, Japan;Department of Information Science, Faculty of Engineering, Kyoto University, Kyoto, 606, Japan

  • Venue:
  • DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
  • Year:
  • 1991

Quantified Score

Hi-index 0.01

Visualization

Abstract

The efficiency of Boolean function manipulation depends on the form of representation of Boolean functions. Binary Decision Diagrams (BDD's) are graph representations proposed by Akers and Bryant. BDD's have some properties which can be used to enable efficient Boolean function manipulation.In this paper, we describe a technique of more efficient Boolean function manipulation that uses Shared Binary Decision Diagrams (SBDD's) with attributed edges. Our implements include an ordering algorithm of input variables and a method of handling don't care. We show experimental results produced by the implementation of the Boolean function manipulator.