Logic Synthesis and VerificationSoha Hassoun, Tsutomu Sasao Springer Science & Business Media, 2012. gada 6. dec. - 454 lappuses Research and development of logic synthesis and verification have matured considerably over the past two decades. Many commercial products are available, and they have been critical in harnessing advances in fabrication technology to produce today's plethora of electronic components. While this maturity is assuring, the advances in fabrication continue to seemingly present unwieldy challenges. Logic Synthesis and Verification provides a state-of-the-art view of logic synthesis and verification. It consists of fifteen chapters, each focusing on a distinct aspect. Each chapter presents key developments, outlines future challenges, and lists essential references. Two unique features of this book are technical strength and comprehensiveness. The book chapters are written by twenty-eight recognized leaders in the field and reviewed by equally qualified experts. The topics collectively span the field. Logic Synthesis and Verification fills a current gap in the existing CAD literature. Each chapter contains essential information to study a topic at a great depth, and to understand further developments in the field. The book is intended for seniors, graduate students, researchers, and developers of related Computer-Aided Design (CAD) tools. From the foreword: "The commercial success of logic synthesis and verification is due in large part to the ideas of many of the authors of this book. Their innovative work contributed to design automation tools that permanently changed the course of electronic design." by Aart J. de Geus, Chairman and CEO, Synopsys, Inc. |
No grāmatas satura
1.–5. rezultāts no 82.
. lappuse
... section ; Nina Yevtushenko ( Tomsk State University , Russia ) thor- oughly reviewed the state - based section . Chapter 10 : Peter Beerel ( University of Southern California ) , and Jordi Cortadella ( Technical University of Catalonia ...
... section ; Nina Yevtushenko ( Tomsk State University , Russia ) thor- oughly reviewed the state - based section . Chapter 10 : Peter Beerel ( University of Southern California ) , and Jordi Cortadella ( Technical University of Catalonia ...
. lappuse
... Section 10.3 . Chapter 11 : Masahiro Fujita ( University of Tokyo ) , Ken McMillan ( Ca- dence ) , Shin - Ichi Minato ( NTT Network Innovation Labs ) , and Tsutomu Sasao ( Kyushu Institute of Technology , Japan ) . Chapter 12 : Kwang ...
... Section 10.3 . Chapter 11 : Masahiro Fujita ( University of Tokyo ) , Ken McMillan ( Ca- dence ) , Shin - Ichi Minato ( NTT Network Innovation Labs ) , and Tsutomu Sasao ( Kyushu Institute of Technology , Japan ) . Chapter 12 : Kwang ...
2. lappuse
... Section 1.2 presents some aspects of exact minimization . Section 1.3 discusses heuristic minimization . 1.2 EXACT LOGIC MINIMIZATION A product p is an implicant of f iff p ≤ f1 . It is a prime implicant ( PI ) iff there is no other ...
... Section 1.2 presents some aspects of exact minimization . Section 1.3 discusses heuristic minimization . 1.2 EXACT LOGIC MINIMIZATION A product p is an implicant of f iff p ≤ f1 . It is a prime implicant ( PI ) iff there is no other ...
3. lappuse
... section . 1.2.1 PRIME IMPLICANT COMPUTATION - Most of the techniques [ 3 , 37 , 63 , 64 , 6 , 46 , 60 , 76 , 77 , 80 ] used to compute explicitly all prime implicants of a Boolean function are incremental improve- ments over Quine's ...
... section . 1.2.1 PRIME IMPLICANT COMPUTATION - Most of the techniques [ 3 , 37 , 63 , 64 , 6 , 46 , 60 , 76 , 77 , 80 ] used to compute explicitly all prime implicants of a Boolean function are incremental improve- ments over Quine's ...
4. lappuse
... section presents methods to reduce the complexity of covering prob- lem . 1.2.2.1 PARTITIONING If the rows and the columns of a covering matrix can be permuted to yield a covering matrix that is partitioned in diagonal blocks B as ...
... section presents methods to reduce the complexity of covering prob- lem . 1.2.2.1 PARTITIONING If the rows and the columns of a covering matrix can be permuted to yield a covering matrix that is partitioned in diagonal blocks B as ...
Saturs
29 | |
Chapter 3 | 64 |
Chapter 4 | 89 |
Chapter 5 | 115 |
Chapter 6 | 141 |
Chapter 7 | 166 |
Chapter 8 | 197 |
Chapter 9 | 225 |
Chapter 10 | 254 |
Chapter 11 | 285 |
Chapter 12 | 309 |
Chapter 13 | 342 |
Chapter 14 | 373 |
Chapter 15 | 403 |
Appendices | 435 |
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
algebraic algorithm applied assignment asynchronous circuits ATPG backtrack binary binary decision diagrams Boolean function Brayton buffering capacitance cells chapter clause clock combinational Computer Science Computer-Aided Design Conf Conference on Computer-Aided constraints cost covering cube cutpoints decision diagrams decomposition delay model Design Automation Conference efficient encoding equivalence checking example false path fanin fanout finite state machines flexibility formal verification global graph hazard-free heuristic IEEE Trans IEEE Transactions implementation iterative latch literals load logic functions logic minimization logic optimization logic synthesis machine match methods minimum multi-level logic multiple-valued functions multiple-valued logic netlist node OBDD operation partition placement problem Proc propagation reachable reduced representation represented resizing retiming routing Sangiovanni-Vincentelli sequential shown in Figure signal solution specific SPFD static timing analysis structure switching techniques technology mapping tion transformations transition tree two-level variable verification VLSI wire