𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Binary Decision Diagrams and Applications for VLSI CAD

✍ Scribed by Shin-ichi Minato (auth.)


Publisher
Springer US
Year
1996
Tongue
English
Leaves
150
Series
The Kluwer International Series in Engineering and Computer Science 342
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Symbolic Boolean manipulation using binary decision diagrams (BDDs) has been successfully applied to a wide variety of tasks, particularly in very large scale integration (VLSI) computer-aided design (CAD). The concept of decision graphs as an abstract representation of Boolean functions dates back to the early work by Lee and Akers. In the last ten years, BDDs have found widespread use as a concrete data structure for symbolic Boolean manipulation. With BDDs, functions can be constructed, manipulated, and compared by simple and efficient graph algorithms. Since Boolean functions can represent not just digital circuit functions, but also such mathematical domains as sets and relations, a wide variety of CAD problems can be solved using BDDs.
`Binary Decision Diagrams and Applications for VLSI CAD provides valuable information for both those who are new to BDDs as well as to long time aficionados.' -from the Foreword by Randal E. Bryant.
`Over the past ten years ... BDDs have attracted the attention of many researchers because of their suitability for representing Boolean functions. They are now widely used in many practical VLSI CAD systems. ... this book can serve as an introduction to BDD techniques and ... it presents several new ideas on BDDs and their applications. ... many computer scientists and engineers will be interested in this book since Boolean function manipulation is a fundamental technique not only in digital system design but also in exploring various problems in computer science.' - from the Preface by Shin-ichi Minato.

✦ Table of Contents


Front Matter....Pages i-xv
Introduction....Pages 1-5
Techniques of BDD Manipulation....Pages 7-24
Variable Ordering for BDDs....Pages 25-37
Representation of Multi-Valued Functions....Pages 39-47
Generation of Cube Sets from BDDs....Pages 49-60
Zero-Suppressed BDDs....Pages 61-80
Multi-Level Logic Synthesis Using ZBDDs....Pages 81-94
Implicit Manipulation of Polynomials Based on ZBDDs....Pages 95-107
Arithmetic Boolean Expressions....Pages 109-128
Conclusions....Pages 129-132
Back Matter....Pages 133-141

✦ Subjects


Circuits and Systems; Computer-Aided Engineering (CAD, CAE) and Design; Electrical Engineering


πŸ“œ SIMILAR VOLUMES


Branching Programs and Binary Decision D
✍ Ingo Wegener πŸ“‚ Library πŸ“… 1987 πŸ› Society for Industrial Mathematics 🌐 English

Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The

Binary Decision Diagrams and Extensions
✍ Amari, Suprasad V.; Xing, Liudong πŸ“‚ Library πŸ“… 2015 πŸ› Wiley-Blackwell 🌐 English

Recent advances in science and technology have made modern computing and engineering systems more powerful and sophisticated than ever. The increasing complexity and scale imply that system reliability problems not only continue to be a challenge but also require more efficient models and solutions.

Binary Decision Diagrams: Theory and Imp
✍ Rolf Drechsler, Bernd Becker (auth.) πŸ“‚ Library πŸ“… 1998 πŸ› Springer US 🌐 English

<p>For someone with a hammer the whole world looks like a nail. Within the last 10-13 years BinarΒ·y Decision Diagmms (BDDs) have become the state-of-the-art data structure in VLSI CAD for representation and maΒ­ nipulation of Boolean functions. Today, BDDs are widely used and in the meantime have als