Logic Synthesis and Verification Algorithms:
In the last decade logic synthesis has gained widepsread acceptance by designers. Formal verification is now advancing along the same path. Computer aided design tools for logic synthesis and verification have become the primary instrument for coping with the ever increasing complexity of designs, a...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Boston, MA
Springer US
1996
|
Schlagworte: | |
Online-Zugang: | BTU01 Volltext |
Zusammenfassung: | In the last decade logic synthesis has gained widepsread acceptance by designers. Formal verification is now advancing along the same path. Computer aided design tools for logic synthesis and verification have become the primary instrument for coping with the ever increasing complexity of designs, and ever more stringent time-to-market constraints. Effective design must be based on thorough understanding of the capabilities, limitations, and algorithmic principles employed by these tools. In this book we provide a foundation for such understanding. Logic Synthesis and Verification Algorithms blends mathematical foundations and algorithmic developments with circuit design issues. Each new technique is presented in the context of its application to design. Through the study of optimal two-level and multilevel combinational circuit design, the reader is introduced to basic concepts, such as Boolean algebras, local search, and algebraic factorization. Similarly, through the study of optimal sequential circuit design, the reader is introduced to graph algorithms, finite state systems, and language theory. Throughout the book, recurrent themes such as branch and bound, dynamic programming, and symbolic implicit enumeration are used to establish optimal design principles. Circuit designers and CAD tool developers alike will find Logic Synthesis and Verification Algorithms useful as an introductory and reference text. The rich collection of examples and solved problems make this book ideal for self study. Because of its careful balance of theory and application, Logic Synthesis and Verification Algorithms will serve well as a textbook for upper division and first year graduate students in electrical and computer engineering |
Beschreibung: | 1 Online-Ressource (XXXII, 564 p) |
ISBN: | 9780387310053 |
DOI: | 10.1007/0-387-31005-3 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV045186523 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 180912s1996 |||| o||u| ||||||eng d | ||
020 | |a 9780387310053 |9 978-0-387-31005-3 | ||
024 | 7 | |a 10.1007/0-387-31005-3 |2 doi | |
035 | |a (ZDB-2-ENG)978-0-387-31005-3 | ||
035 | |a (OCoLC)1053827221 | ||
035 | |a (DE-599)BVBBV045186523 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-634 | ||
082 | 0 | |a 621.3815 |2 23 | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a ZN 4904 |0 (DE-625)157419: |2 rvk | ||
084 | |a ZN 4930 |0 (DE-625)157422: |2 rvk | ||
100 | 1 | |a Hachtel, Gary D. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Logic Synthesis and Verification Algorithms |c by Gary D. Hachtel, Fabio Somenzi |
264 | 1 | |a Boston, MA |b Springer US |c 1996 | |
300 | |a 1 Online-Ressource (XXXII, 564 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
520 | |a In the last decade logic synthesis has gained widepsread acceptance by designers. Formal verification is now advancing along the same path. Computer aided design tools for logic synthesis and verification have become the primary instrument for coping with the ever increasing complexity of designs, and ever more stringent time-to-market constraints. Effective design must be based on thorough understanding of the capabilities, limitations, and algorithmic principles employed by these tools. In this book we provide a foundation for such understanding. Logic Synthesis and Verification Algorithms blends mathematical foundations and algorithmic developments with circuit design issues. Each new technique is presented in the context of its application to design. Through the study of optimal two-level and multilevel combinational circuit design, the reader is introduced to basic concepts, such as Boolean algebras, local search, and algebraic factorization. Similarly, through the study of optimal sequential circuit design, the reader is introduced to graph algorithms, finite state systems, and language theory. Throughout the book, recurrent themes such as branch and bound, dynamic programming, and symbolic implicit enumeration are used to establish optimal design principles. Circuit designers and CAD tool developers alike will find Logic Synthesis and Verification Algorithms useful as an introductory and reference text. The rich collection of examples and solved problems make this book ideal for self study. Because of its careful balance of theory and application, Logic Synthesis and Verification Algorithms will serve well as a textbook for upper division and first year graduate students in electrical and computer engineering | ||
650 | 4 | |a Engineering | |
650 | 4 | |a Circuits and Systems | |
650 | 4 | |a Theory of Computation | |
650 | 4 | |a Computer-Aided Engineering (CAD, CAE) and Design | |
650 | 4 | |a Electrical Engineering | |
650 | 4 | |a Discrete Mathematics in Computer Science | |
650 | 4 | |a Computing Methodologies | |
650 | 4 | |a Engineering | |
650 | 4 | |a Computers | |
650 | 4 | |a Computer science / Mathematics | |
650 | 4 | |a Computer-aided engineering | |
650 | 4 | |a Electrical engineering | |
650 | 4 | |a Electronic circuits | |
650 | 0 | 7 | |a Logischer Entwurf |0 (DE-588)4168051-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Logiksynthese |0 (DE-588)4348178-4 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Logischer Entwurf |0 (DE-588)4168051-0 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Logiksynthese |0 (DE-588)4348178-4 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
700 | 1 | |a Somenzi, Fabio |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780387310046 |
856 | 4 | 0 | |u https://doi.org/10.1007/0-387-31005-3 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-2-ENG | ||
940 | 1 | |q ZDB-2-ENG_Archiv | |
999 | |a oai:aleph.bib-bvb.de:BVB01-030575700 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1007/0-387-31005-3 |l BTU01 |p ZDB-2-ENG |q ZDB-2-ENG_Archiv |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804178877607575552 |
---|---|
any_adam_object | |
author | Hachtel, Gary D. Somenzi, Fabio |
author_facet | Hachtel, Gary D. Somenzi, Fabio |
author_role | aut aut |
author_sort | Hachtel, Gary D. |
author_variant | g d h gd gdh f s fs |
building | Verbundindex |
bvnumber | BV045186523 |
classification_rvk | ST 134 ZN 4904 ZN 4930 |
collection | ZDB-2-ENG |
ctrlnum | (ZDB-2-ENG)978-0-387-31005-3 (OCoLC)1053827221 (DE-599)BVBBV045186523 |
dewey-full | 621.3815 |
dewey-hundreds | 600 - Technology (Applied sciences) |
dewey-ones | 621 - Applied physics |
dewey-raw | 621.3815 |
dewey-search | 621.3815 |
dewey-sort | 3621.3815 |
dewey-tens | 620 - Engineering and allied operations |
discipline | Informatik Elektrotechnik / Elektronik / Nachrichtentechnik |
doi_str_mv | 10.1007/0-387-31005-3 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04139nmm a2200661zc 4500</leader><controlfield tag="001">BV045186523</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180912s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387310053</subfield><subfield code="9">978-0-387-31005-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/0-387-31005-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-ENG)978-0-387-31005-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1053827221</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045186523</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.3815</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 4904</subfield><subfield code="0">(DE-625)157419:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 4930</subfield><subfield code="0">(DE-625)157422:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hachtel, Gary D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logic Synthesis and Verification Algorithms</subfield><subfield code="c">by Gary D. Hachtel, Fabio Somenzi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXXII, 564 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In the last decade logic synthesis has gained widepsread acceptance by designers. Formal verification is now advancing along the same path. Computer aided design tools for logic synthesis and verification have become the primary instrument for coping with the ever increasing complexity of designs, and ever more stringent time-to-market constraints. Effective design must be based on thorough understanding of the capabilities, limitations, and algorithmic principles employed by these tools. In this book we provide a foundation for such understanding. Logic Synthesis and Verification Algorithms blends mathematical foundations and algorithmic developments with circuit design issues. Each new technique is presented in the context of its application to design. Through the study of optimal two-level and multilevel combinational circuit design, the reader is introduced to basic concepts, such as Boolean algebras, local search, and algebraic factorization. Similarly, through the study of optimal sequential circuit design, the reader is introduced to graph algorithms, finite state systems, and language theory. Throughout the book, recurrent themes such as branch and bound, dynamic programming, and symbolic implicit enumeration are used to establish optimal design principles. Circuit designers and CAD tool developers alike will find Logic Synthesis and Verification Algorithms useful as an introductory and reference text. The rich collection of examples and solved problems make this book ideal for self study. Because of its careful balance of theory and application, Logic Synthesis and Verification Algorithms will serve well as a textbook for upper division and first year graduate students in electrical and computer engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Circuits and Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer-Aided Engineering (CAD, CAE) and Design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computing Methodologies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer-aided engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic circuits</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logischer Entwurf</subfield><subfield code="0">(DE-588)4168051-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logiksynthese</subfield><subfield code="0">(DE-588)4348178-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Logischer Entwurf</subfield><subfield code="0">(DE-588)4168051-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Logiksynthese</subfield><subfield code="0">(DE-588)4348178-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Somenzi, Fabio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780387310046</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/0-387-31005-3</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-ENG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-ENG_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030575700</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/0-387-31005-3</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="q">ZDB-2-ENG_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV045186523 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T08:10:57Z |
institution | BVB |
isbn | 9780387310053 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030575700 |
oclc_num | 1053827221 |
open_access_boolean | |
owner | DE-634 |
owner_facet | DE-634 |
physical | 1 Online-Ressource (XXXII, 564 p) |
psigel | ZDB-2-ENG ZDB-2-ENG_Archiv ZDB-2-ENG ZDB-2-ENG_Archiv |
publishDate | 1996 |
publishDateSearch | 1996 |
publishDateSort | 1996 |
publisher | Springer US |
record_format | marc |
spelling | Hachtel, Gary D. Verfasser aut Logic Synthesis and Verification Algorithms by Gary D. Hachtel, Fabio Somenzi Boston, MA Springer US 1996 1 Online-Ressource (XXXII, 564 p) txt rdacontent c rdamedia cr rdacarrier In the last decade logic synthesis has gained widepsread acceptance by designers. Formal verification is now advancing along the same path. Computer aided design tools for logic synthesis and verification have become the primary instrument for coping with the ever increasing complexity of designs, and ever more stringent time-to-market constraints. Effective design must be based on thorough understanding of the capabilities, limitations, and algorithmic principles employed by these tools. In this book we provide a foundation for such understanding. Logic Synthesis and Verification Algorithms blends mathematical foundations and algorithmic developments with circuit design issues. Each new technique is presented in the context of its application to design. Through the study of optimal two-level and multilevel combinational circuit design, the reader is introduced to basic concepts, such as Boolean algebras, local search, and algebraic factorization. Similarly, through the study of optimal sequential circuit design, the reader is introduced to graph algorithms, finite state systems, and language theory. Throughout the book, recurrent themes such as branch and bound, dynamic programming, and symbolic implicit enumeration are used to establish optimal design principles. Circuit designers and CAD tool developers alike will find Logic Synthesis and Verification Algorithms useful as an introductory and reference text. The rich collection of examples and solved problems make this book ideal for self study. Because of its careful balance of theory and application, Logic Synthesis and Verification Algorithms will serve well as a textbook for upper division and first year graduate students in electrical and computer engineering Engineering Circuits and Systems Theory of Computation Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Discrete Mathematics in Computer Science Computing Methodologies Computers Computer science / Mathematics Computer-aided engineering Electrical engineering Electronic circuits Logischer Entwurf (DE-588)4168051-0 gnd rswk-swf Logiksynthese (DE-588)4348178-4 gnd rswk-swf Logischer Entwurf (DE-588)4168051-0 s 1\p DE-604 Logiksynthese (DE-588)4348178-4 s 2\p DE-604 Somenzi, Fabio aut Erscheint auch als Druck-Ausgabe 9780387310046 https://doi.org/10.1007/0-387-31005-3 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Hachtel, Gary D. Somenzi, Fabio Logic Synthesis and Verification Algorithms Engineering Circuits and Systems Theory of Computation Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Discrete Mathematics in Computer Science Computing Methodologies Computers Computer science / Mathematics Computer-aided engineering Electrical engineering Electronic circuits Logischer Entwurf (DE-588)4168051-0 gnd Logiksynthese (DE-588)4348178-4 gnd |
subject_GND | (DE-588)4168051-0 (DE-588)4348178-4 |
title | Logic Synthesis and Verification Algorithms |
title_auth | Logic Synthesis and Verification Algorithms |
title_exact_search | Logic Synthesis and Verification Algorithms |
title_full | Logic Synthesis and Verification Algorithms by Gary D. Hachtel, Fabio Somenzi |
title_fullStr | Logic Synthesis and Verification Algorithms by Gary D. Hachtel, Fabio Somenzi |
title_full_unstemmed | Logic Synthesis and Verification Algorithms by Gary D. Hachtel, Fabio Somenzi |
title_short | Logic Synthesis and Verification Algorithms |
title_sort | logic synthesis and verification algorithms |
topic | Engineering Circuits and Systems Theory of Computation Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Discrete Mathematics in Computer Science Computing Methodologies Computers Computer science / Mathematics Computer-aided engineering Electrical engineering Electronic circuits Logischer Entwurf (DE-588)4168051-0 gnd Logiksynthese (DE-588)4348178-4 gnd |
topic_facet | Engineering Circuits and Systems Theory of Computation Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Discrete Mathematics in Computer Science Computing Methodologies Computers Computer science / Mathematics Computer-aided engineering Electrical engineering Electronic circuits Logischer Entwurf Logiksynthese |
url | https://doi.org/10.1007/0-387-31005-3 |
work_keys_str_mv | AT hachtelgaryd logicsynthesisandverificationalgorithms AT somenzifabio logicsynthesisandverificationalgorithms |