Zero-suppressed BDDs and their applications

• Minato, Shin-ichi

抄録

In many real-life problems, we are often faced with manipulating sets of combinations. In this article, we study a special type of ordered binary decision diagram (OBDD), called zero-suppressed BDDs (ZBDDs). This data structure represents sets of combinations more efficiently than using original OBDDs. We discuss the basic data structures and algorithms for manipulating ZBDDs in contrast with the original OBDDs. We also present some practical applications of ZBDDs, such as solving combinatorial problems with unate cube set algebra, logic synthesis methods, Petri net processing, etc. We show that a ZBDD is a useful option in OBDD techniques, suitable for a part of the practical applications.

収録刊行物

• International Journal on Software Tools for Technology Transfer

  International Journal on Software Tools for Technology Transfer 3 (2), 156-170, 2001-05

  Springer Berlin / Heidelberg

キーワード

• BDD
• ZBDD
• Boolean function
• VLSI CAD
• Combinatorial problem

詳細情報

• CRID: 1050564288934807808
• NII論文ID: 120000964862
• ISSN: 14332787
• ISSN: 14332779
• HANDLE: 2115/16895
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • CiNii Articles