Binary Decision Diagrams and Applications for VLSI CAD

Binary Decision Diagrams and Applications for VLSI CAD

By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days
When will my order arrive?


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.
show more

Product details

  • Hardback | 142 pages
  • 162 x 236 x 20mm | 240.41g
  • Dordrecht, Netherlands
  • English
  • 1996 ed.
  • XVI, 142 p.
  • 0792396529
  • 9780792396529

Table of contents

Foreword. Preface. 1. Introduction. 2. Techniques of BDD manipulation. 3. Variable ordering for BDDs. 4. Representation of multi-valued functions. 5. Generation of cube sets from BDDs. 6. Zero-suppressed BDDs. 7. Multi-level logic synthesis using ZBDDs. 8. Implicit manipulation of polynomials based on ZBDDs. 9. Arithmetic Boolean expressions. 10. Conclusions. References. Index.
show more