000 04304nam a22005655i 4500
001 978-3-031-79870-2
003 DE-He213
005 20240730164200.0
007 cr nn 008mamaa
008 220601s2015 sz | s |||| 0|eng d
020 _a9783031798702
_9978-3-031-79870-2
024 7 _a10.1007/978-3-031-79870-2
_2doi
050 4 _aT1-995
072 7 _aTBC
_2bicssc
072 7 _aTEC000000
_2bisacsh
072 7 _aTBC
_2thema
082 0 4 _a620
_223
100 1 _aButler, Jon T.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982652
245 1 0 _aApplications of Zero-Suppressed Decision Diagrams
_h[electronic resource] /
_cby Jon T. Butler, Tsutomu Sasao.
250 _a1st ed. 2015.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXVIII, 106 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Digital Circuits & Systems,
_x1932-3174
505 0 _aPreface -- Acknowledgments -- Introduction to Zero-Suppressed Decision Diagrams -- Efficient Generation of Prime Implicants and Irredundant Sum-of-Products Expressions -- The Power of Enumeration--BDD/ZDD-Based Algorithms for Tackling Combinatorial Explosion -- Regular Expression Matching Using Zero-Suppressed Decision Diagrams -- Authors' and Editors' Biographies -- Index .
520 _aA 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 proprer 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. Table of Contents: Preface / Acknowledgments / Introduction to Zero-Suppressed Decision Diagrams / Efficient Generation of Prime Implicants and Irredundant Sum-of-Products Expressions / The Power of Enumeration--BDD/ZDD-Based Algorithms for Tackling Combinatorial Explosion / Regular Expression Matching Using Zero-Suppressed Decision Diagrams / Authors' and Editors' Biographies / Index.
650 0 _aEngineering.
_99405
650 0 _aElectronic circuits.
_919581
650 0 _aControl engineering.
_931970
650 0 _aRobotics.
_92393
650 0 _aAutomation.
_92392
650 0 _aComputers.
_98172
650 1 4 _aTechnology and Engineering.
_982654
650 2 4 _aElectronic Circuits and Systems.
_982657
650 2 4 _aControl, Robotics, Automation.
_931971
650 2 4 _aComputer Hardware.
_933420
700 1 _aSasao, Tsutomu.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982659
710 2 _aSpringerLink (Online service)
_982662
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031798696
776 0 8 _iPrinted edition:
_z9783031798719
830 0 _aSynthesis Lectures on Digital Circuits & Systems,
_x1932-3174
_982663
856 4 0 _uhttps://doi.org/10.1007/978-3-031-79870-2
912 _aZDB-2-SXSC
942 _cEBK
999 _c85388
_d85388