Loading...
Applications of zero-suppressed decision diagrams /
A zero-suppressed decision diagram (ZDD) is a data structure to represent objects that typically contain many zeros. Applications include combinatorial problems, such as graphs, circuits, faults, and data mining. This book consists of four chapters on the applications of ZDDs. The first chapter by A...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
San Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) :
Morgan & Claypool,
2015.
|
| Series: | Synthesis digital library of engineering and computer science.
Synthesis lectures on digital circuits and systems ; # 45. |
| Subjects: | |
| Online Access: | Abstract with links to full text |
| LEADER | 06690nam a2200769 i 4500 | ||
|---|---|---|---|
| 001 | 201411DCS045 | ||
| 005 | 20160320103535.0 | ||
| 006 | m eo d | ||
| 007 | cr cn |||m|||a | ||
| 008 | 141223s2015 caua foab 001 0 eng d | ||
| 020 | |a 9781627056502 |q ebook | ||
| 020 | |z 9781627056496 |q print | ||
| 024 | 7 | |a 10.2200/S00612ED1V01Y201411DCS045 |2 doi | |
| 035 | |a (CaBNVSL)swl00404487 | ||
| 035 | |a (OCoLC)898746939 | ||
| 040 | |a CaBNVSL |b eng |e rda |c CaBNVSL |d CaBNVSL | ||
| 050 | 4 | |a T57.95 |b .S272 2015 | |
| 082 | 0 | 4 | |a 003 |2 23 |
| 100 | 1 | |a Sasao, Tsutomu, |d 1950-, |e author. | |
| 245 | 1 | 0 | |a Applications of zero-suppressed decision diagrams / |c Tsutomu Sasao, Jon T. Butler. |
| 264 | 1 | |a San Rafael, California (1537 Fourth Street, San Rafael, CA 94901 USA) : |b Morgan & Claypool, |c 2015. | |
| 300 | |a 1 PDF (xvii, 105 pages) : |b illustrations. | ||
| 336 | |a text |2 rdacontent | ||
| 337 | |a electronic |2 isbdmedia | ||
| 338 | |a online resource |2 rdacarrier | ||
| 490 | 1 | |a Synthesis lectures on digital circuits and systems, |x 1932-3174 ; |v # 45 | |
| 500 | |a Part of: Synthesis digital library of engineering and computer science. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a 1. Introduction to zero-suppressed decision diagrams / Alan Mishchenko -- Chapter summary -- 1.1 Introduction -- 1.2 Definitions -- 1.2.1 BDD and ZDD reduction rules -- 1.3 Comparing BDDs and ZDDs -- 1.3.1 Boolean functions -- 1.3.2 Sets of subsets -- 1.3.3 Cube covers -- 1.4 Basic ZDD procedures -- 1.4.1 Procedures working with functions -- 1.4.2 Procedures working with covers -- 1.4.3 Generic structure of a recursive ZDD procedure -- 1.5 Manipulation of sets -- 1.5.1 A case study of the CUDD source code -- 1.6 Manipulation of cube covers -- 1.7 Mixed ZDD/BDD applications -- 1.7.1 Computation of the set of all primes -- 1.7.2 Computation of an irredundant SOP -- 1.8 A list of published ZDD applications -- 1.9 Conclusions -- 1.10 Acknowledgements -- 1.11 Appendix A -- 1.12 Appendix B -- 1.13 Exercises -- References -- | |
| 505 | 8 | |a 2. Efficient generation of prime implicants and irredundant sum-of-products expressions / Tsutomu Sasao -- Chapter summary -- 2.1 Logical expressions -- 2.2 Monotone and unate functions -- 2.3 Prime implicants -- 2.4 Generation of all the prime implicants -- 2.5 Generation of irredundant sum-of-products expressions -- 2.6 Morreale's algorithm -- 2.7 Conclusion and comments -- 2.8 Exercises -- References -- | |
| 505 | 8 | |a 3. The power of enumeration-BDD/ZDD-based algorithms for tackling combinatorial explosion / Shin-ichi Minato -- Chapter summary -- 3.1 Introduction -- 3.2 BDDs/ZDDs and graph enumeration -- 3.3 Frontier-based method -- 3.3.1 Knuth's SimPath algorithm -- 3.3.2 Frontier-based method for various problems -- 3.3.3 Recent topics on the path enumeration problem -- 3.4 Conclusion -- 3.5 Exercises -- References -- | |
| 505 | 8 | |a 4. Regular expression matching using zero-suppressed decision diagrams / Shinobu Nagayama -- Chapter summary -- 4.1 Introduction -- 4.2 Preliminaries -- 4.2.1 Regular expressions and finite automaton -- 4.2.2 Binary decision diagrams -- 4.3 BDDs and ZDDs for NFAs -- 4.3.1 Representations of NFAs using BDDs -- 4.3.2 Representations of NFAs using ZDDs -- 4.4 Matching method using BDDs and ZDDs -- 4.4.1 Regular expression matching method using BDDs [39] -- 4.4.2 Regular expression matching method using ZDDs -- 4.5 Experimental results -- 4.5.1 Comparison of the number of nodes -- 4.5.2 Comparison of computation time -- 4.6 Conclusion and comments -- AcknowledgmentS -- 4.7 Exercises -- References -- | |
| 505 | 8 | |a A. Solutions -- Authors' and editors' biographies -- Index. | |
| 506 | |a Abstract freely available; full-text restricted to subscribers or individual document purchasers. | ||
| 510 | 0 | |a Compendex | |
| 510 | 0 | |a Google book search | |
| 510 | 0 | |a Google scholar | |
| 510 | 0 | |a INSPEC | |
| 520 | 3 | |a A zero-suppressed decision diagram (ZDD) is a data structure to represent objects that typically contain many zeros. Applications include combinatorial problems, such as graphs, circuits, faults, and data mining. This book consists of four chapters on the applications of ZDDs. The first chapter by Alan Mishchenko introduces the ZDD. It compares ZDDs to BDDs, showing why a more compact representation is usually achieved in a ZDD. The focus is on sets of subsets and on sum-of-products (SOP) expressions. Methods to generate all the prime implicants (PIs), and to generate irredundant SOPs are shown. A list of papers on the applications of ZDDs is also presented. In the appendix, ZDD procedures in the CUDD package are described. The second chapter by Tsutomu Sasao shows methods to generate PIs and irredundant SOPs using a divide and conquer method. This chapter helps the reader to understand the methods presented in the first chapter. The third chapter by Shin-Ichi Minato introduces the "frontier-based" method that efficiently enumerates certain subsets of a graph. The final chapter by Shinobu Nagayama shows a method to match strings of characters. This is important in routers, for example, where one must match the address information of an internet packet to the proper output port. It shows that ZDDs are more compact than BDDs in solving this important problem. Each chapter contains exercises, and the appendix contains their solutions. | |
| 530 | |a Also available in print. | ||
| 538 | |a Mode of access: World Wide Web. | ||
| 538 | |a System requirements: Adobe Acrobat Reader. | ||
| 588 | |a Title from PDF title page (viewed on December 23, 2014). | ||
| 650 | 0 | |a Decision logic tables |x Mathematics. | |
| 650 | 0 | |a Graphic methods. | |
| 650 | 0 | |a State-space methods. | |
| 653 | |a binary decision diagram | ||
| 653 | |a CUDD package | ||
| 653 | |a data-structure | ||
| 653 | |a frontier-based method | ||
| 653 | |a graph enumeration | ||
| 653 | |a intrusion detection | ||
| 653 | |a logic function | ||
| 653 | |a non-deterministic automata | ||
| 653 | |a one-hot code | ||
| 653 | |a prime implicant | ||
| 653 | |a regular expression matching | ||
| 653 | |a sum-of-products expression | ||
| 653 | |a zero-suppressed decision diagram | ||
| 700 | 1 | |a Butler, Jon T., |e author. | |
| 776 | 0 | 8 | |i Print version: |z 9781627056496 |
| 830 | 0 | |a Synthesis digital library of engineering and computer science. | |
| 830 | 0 | |a Synthesis lectures on digital circuits and systems ; |v # 45. |x 1932-3174 | |
| 856 | 4 | 8 | |3 Abstract with links to full text |u http://dx.doi.org/10.2200/S00612ED1V01Y201411DCS045 |
| 942 | |c EB | ||
| 999 | |c 81101 |d 81101 | ||
| 952 | |0 0 |1 0 |4 0 |7 0 |9 73121 |a MGUL |b MGUL |d 2016-03-20 |l 0 |r 2016-03-20 |w 2016-03-20 |y EB | ||