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 79.
1. lappuse
... efficient covering method . With these new methods , exact solutions for functions with many inputs can be obtained in a time comparable to heuristic logic minimizers . The second part introduces basic operations used in heuristic logic ...
... efficient covering method . With these new methods , exact solutions for functions with many inputs can be obtained in a time comparable to heuristic logic minimizers . The second part introduces basic operations used in heuristic logic ...
6. lappuse
... efficient BDD / ZDD based algorithms to implicitly produce the cyclic core with a com- plexity independent from the actual size of the matrix . A full presentation of the transposition functions based reduction can be found in [ 20 , 21 ] ...
... efficient BDD / ZDD based algorithms to implicitly produce the cyclic core with a com- plexity independent from the actual size of the matrix . A full presentation of the transposition functions based reduction can be found in [ 20 , 21 ] ...
12. lappuse
... efficient BDD / ZDD based im- plicit algorithms . A full presentation can be found in [ 20 , 21 ] . 1.3 HEURISTIC LOGIC MINIMIZATION Although the classical Quine - McCluskey method has been dramatically im- proved with implicit ...
... efficient BDD / ZDD based im- plicit algorithms . A full presentation can be found in [ 20 , 21 ] . 1.3 HEURISTIC LOGIC MINIMIZATION Although the classical Quine - McCluskey method has been dramatically im- proved with implicit ...
22. lappuse
... efficient lower bound techniques during branch - and - bound , there are attempts at identifying class of functions ... efficiently . PRESTO [ 78 ] is a simple logic minimizer that uses only EXPAND and REDUCE of the output part . It uses ...
... efficient lower bound techniques during branch - and - bound , there are attempts at identifying class of functions ... efficiently . PRESTO [ 78 ] is a simple logic minimizer that uses only EXPAND and REDUCE of the output part . It uses ...
29. lappuse
... efficient and are widely used in commercial logic synthesis tools . Boolean methods , although much more powerful ... efficiency and makes them an attrac- tive alternative to algebraic methods . These three methods are key technologies ...
... efficient and are widely used in commercial logic synthesis tools . Boolean methods , although much more powerful ... efficiency and makes them an attrac- tive alternative to algebraic methods . These three methods are key technologies ...
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