Fr. 134.00

Efficient Branch and Bound Search with Application to Computer-Aided Design

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

Branch-and-bound search has been known for a long time and has been widely used in solving a variety of problems in computer-aided design (CAD) and many important optimization problems.
In many applications, the classic branch-and-bound search methods perform duplications of computations, or rely on the search decision trees which keep track of the branch-and-bound search processes. In CAD and many other technical fields, the computational cost of constructing branch-and-bound search decision trees in solving large scale problems is prohibitive and duplications of computations are intolerable. Efficient branch-and-bound methods are needed to deal with today's computational challenges. Efficient branch-and-bound methods must not duplicate computations.
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 synthesis, minimization, verification, and other problems in CAD. The method is called justification equivalence, based on the observation that justification processes may share identical subsequent search decision sequences. With justification equivalence, duplication of computations is avoided in the dynamic branch-and-bound search process without using search decision trees.
Efficient Branch and Bound Search with Application to Computer-Aided Design consists of two parts. The first part, containing the first three chapters, provides the theoretical work. The second part deals with applications, particularly ATPG for sequential circuits.
This book is particularly useful to readers who are interested in the design and test of digital circuits.

List of contents

I Theory.- 1 Introduction.- 2 Justification Equivalence.- 3 Justification in Finite State Space.- II Applications.- 4 Sequential Circuit Test Generation.- 5 Fault Effects.- 6 The Sest Algorithm.- 7 Experimental Results.- 8 Redundancy Identification.- 9 Logic Verification.- 10 Conclusion.- A Sest User's Guide.- A.1 Introduction.- A.2 Command Synopsis.- A.3 Options.- A.4 Inputs and Outputs.- A.5 Output Files.- A.6 Example.- A.7 Down-Loading SEST from the Disk.- A.8 Reporting Bugs.- A.9 Author.- References.

Product details

Authors Michael L Bushnell, Michael L. Bushnell, Xinghao Chen, Xinghao Che, Xinghao Chen, Xinghao Chen
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 25.07.2012
 
EAN 9781461285717
ISBN 978-1-4612-8571-7
No. of pages 146
Illustrations XIV, 146 p.
Series Frontiers in Electronic Testing
Frontiers in Electronic Testing
Subject Natural sciences, medicine, IT, technology > Technology > Electronics, electrical engineering, communications engineering

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.