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 69.
. lappuse
... tion . It consists of fifteen chapters , each focusing on a distinct aspect . Each chapter presents key developments , outlines future challenges , and lists essen- tial references . Two unique features of this book are technical ...
... tion . It consists of fifteen chapters , each focusing on a distinct aspect . Each chapter presents key developments , outlines future challenges , and lists essen- tial references . Two unique features of this book are technical ...
1. lappuse
... tion , and the second part treats heuristic minimization . The Quine - McCluskey procedure is the classic textbook method used to derive exact minimum two - level logic circuits . However , it is limited to func- tions up to about 15 ...
... tion , and the second part treats heuristic minimization . The Quine - McCluskey procedure is the classic textbook method used to derive exact minimum two - level logic circuits . However , it is limited to func- tions up to about 15 ...
2. lappuse
... tion of 24+ X2 X3 + X1X4 + 234 . It has five PIs , as shown in the columns . EPIs are the columns covering the unique " 1 " occurring in some row . For in- stance , x23 is essential because it is the only prime that covers the minterm ...
... tion of 24+ X2 X3 + X1X4 + 234 . It has five PIs , as shown in the columns . EPIs are the columns covering the unique " 1 " occurring in some row . For in- stance , x23 is essential because it is the only prime that covers the minterm ...
4. lappuse
... tion , they can be removed from the covering matrix as well as the rows they cover [ 59 ] . For instance consider the left - hand side covering matrix of Fig . 1.2 . The only element that covers x6 is y5 , so y5 is essential . Column ys ...
... tion , they can be removed from the covering matrix as well as the rows they cover [ 59 ] . For instance consider the left - hand side covering matrix of Fig . 1.2 . The only element that covers x6 is y5 , so y5 is essential . Column ys ...
8. lappuse
... tion of the original problem is the minimum of both of the minimum solutions of the two subproblems . If we know a lower bound of the minimum solution of a subproblem yielded at some point of the branching algorithm , we can prune the ...
... tion of the original problem is the minimum of both of the minimum solutions of the two subproblems . If we know a lower bound of the minimum solution of a subproblem yielded at some point of the branching algorithm , we can prune the ...
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