• Produktbild: Equivalence Checking of Digital Circuits
  • Produktbild: Equivalence Checking of Digital Circuits

Equivalence Checking of Digital Circuits Fundamentals, Principles, Methods

Fr. 192.00

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.12.2010

Verlag

Springer Us

Seitenzahl

263

Maße (L/B/H)

23.5/15.5/1.6 cm

Gewicht

454 g

Auflage

Softcover reprint of the original 1st ed. 2004

Sprache

Englisch

ISBN

978-1-4419-5423-7

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.12.2010

Verlag

Springer Us

Seitenzahl

263

Maße (L/B/H)

23.5/15.5/1.6 cm

Gewicht

454 g

Auflage

Softcover reprint of the original 1st ed. 2004

Sprache

Englisch

ISBN

978-1-4419-5423-7

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Equivalence Checking of Digital Circuits
  • Produktbild: Equivalence Checking of Digital Circuits
  • Acknowledgements. 1: Introduction. 1. Tasks in verification processes. 2. Equivalence checking. 3. Structure of the book. 4. The audience. Part I: Fundamentals. 2: Preliminaries. 1. Basic notations. 2. Boolean algebra. 3. Boolean functions. 4. Pseudo-Boolean functions. 3: Representation of Functions. 1. Desirable properties of representations. 2. Traditional representations of Boolean functions. 3. Binary decision diagrams. 4. Representations of pseudo-Boolean functions. Part II: Equivalency Checking of Combinational Circuits. 4: Use of Canonical Representations. 1. Synthesizing ROBDDs and *BMDs. 2. Problems arising when using one of these methodologies. 5: SAT and ATPG Based Equivalence Checking. 1. SAT based equivalence checking. 2. ATPG based equivalence checking. 6: Exploiting Similarities. 1. The basic idea. 2. Partitioning the problem into a set of smaller and simpler equivalence checking problems. 3. Using internal equivalences to simplify large miters. 4. Finding internal equivalences. 7: Partial Implementations; Chr. Scholl, B. Becker. 1. Symbolic Z-simulation. 2. Symbolic Zi-simulation. 8: Permutation Independent Boolean Comparison. 1. The problem. 2. Signatures. 3. Examples of signatures. 4. Limits of signatures. 5. Special kinds of G-Symmetries. Part III: Equivalence Checking of Sequential Circuits. 9: Basic Definitions and Algorithms. 1. Finite State Machines and their representations. 2. Equivalence of Finite State Machines. 3. State space traversal. 10: Latch Correspondence Problem. 1. Problem description. 2. Signatures. Index.