Bi-Partition of Shared Binary Decision Diagrams

Search this Article

Author(s)

    • MATSUURA Munehiro
    • Department of Computer Science and Electronics, Kyushu Institute of Technology
    • SASAO Tsutomu
    • Department of Computer Science and Electronics, and Center for Microelectronic Systems, Kyushu Institute of Technology
    • BUTLER Jon T.
    • Department of Electrical and Computer Engineering, Naval Postgraduate School

Abstract

A shared binary decision diagram (SBDD) represents a multiple-output function, where nodes are shared among BDDs representing the various outputs. A partitioned SBDD consists of two or more SBDDs that share nodes. The separate SBDDs are optimized independently, often resulting in a reduction in the number of nodes over a single SBDD. We show a method for partitioning a single SBDD into two parts that reduces the node count. Among the benchmark functions tested, a node reduction of up to 23% is realized.

Journal

  • IEICE transactions on fundamentals of electronics, communications and computer sciences

    IEICE transactions on fundamentals of electronics, communications and computer sciences 85(12), 2693-2700, 2002-12-01

    The Institute of Electronics, Information and Communication Engineers

References:  23

Codes

  • NII Article ID (NAID)
    110003212440
  • NII NACSIS-CAT ID (NCID)
    AA10826239
  • Text Lang
    ENG
  • Article Type
    ART
  • ISSN
    09168508
  • Data Source
    CJP  NII-ELS 
Page Top