Sold Out
Book Categories |
Foreword | ||
Preface | ||
1 | Introduction | 3 |
2 | Justification Equivalence | 11 |
3 | Justification In Finite State Space | 25 |
4 | Sequential Circuit Test Generation | 37 |
5 | Fault Effects | 55 |
6 | The SEST Algorithm | 59 |
7 | Experimental Results | 75 |
8 | Redundancy Identification | 97 |
9 | Logic Verification | 103 |
10 | Conclusion | 109 |
11 | SEST User's Guide | 111 |
References | 125 | |
Index | 143 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionEfficient Branch and Bound Search with Application to Computer-Aided Design
X
This Item is in Your InventoryEfficient Branch and Bound Search with Application to Computer-Aided Design
X
You must be logged in to review the productsX
X
X
Add Efficient Branch and Bound Search with Application to Computer-Aided Design, Efficient Branch and Bound Search with Application to Computer-Aided Design describes an efficient branch-and-bound method for logic justification, which is fundamental to automatic test pattern generation (ATPG), redundancy identification, logic synthesi, Efficient Branch and Bound Search with Application to Computer-Aided Design to the inventory that you are selling on WonderClubX
X
Add Efficient Branch and Bound Search with Application to Computer-Aided Design, Efficient Branch and Bound Search with Application to Computer-Aided Design describes an efficient branch-and-bound method for logic justification, which is fundamental to automatic test pattern generation (ATPG), redundancy identification, logic synthesi, Efficient Branch and Bound Search with Application to Computer-Aided Design to your collection on WonderClub |