Paper Info
Title
Techniques Of Bdd/Zdd: Brief History And Recent Activity
Abstract
Discrete structures are foundational material for computer science and mathematics, which are related to set theory, symbolic logic, inductive proof, graph theory, combinatorics, probability theory, etc. Many problems solved by computers can be decomposed into discrete structures using simple primitive algebraic operations. It is very important to represent discrete structures compactly and to execute efficiently tasks such as equivalency/validity checking, analysis of models, and optimization. Recently, BDDs (Binary Decision Diagrams) and ZDDs (Zero-suppressed BDDs) have attracted a great deal of attention, because they efficiently represent and manipulate large-scale combinational logic data, which are the basic discrete structures in various fields of application. Although a quarter of a century has passed since Bryant's first idea, there are still a lot of interesting and exciting research topics related to BDD and ZDD. BDD/ZDD is based on in-memory data processing techniques, and it enjoys the advantage of using random access memory. Recent commodity PCs are equipped with gigabytes of main memory, and we can now solve large-scale problems which used to be impossible due to memory shortage. Thus, especially since 2000, the scope of BDD/ZDD methods has increased. This survey paper describes the history of, and recent research activity pertaining to, techniques related to BDD and ZDD.
Year
DOI
Venue
2013
10.1587/transinf.E96.D.1419
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
Keywords
Field
DocType
BDD, ZDD, decision diagram, discrete structure, algorithm, data structure
Graph theory,Set theory,Data structure,Computer science,Binary decision diagram,Theoretical computer science,Influence diagram,Mathematical logic,Algebraic operation,Random access
Journal
Volume
Issue
ISSN
E96D
7
1745-1361
Citations 
PageRank 
References 
11
0.67
34
Authors
2
Name
Order
Citations
PageRank
Shin-ichi Minato172584.72
Shin-ichi Minato272584.72