Skip to main content
Book cover

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

  • Book
  • © 1996

Overview

Part of the book series: Frontiers in Electronic Testing (FRET, volume 4)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Theory

  2. Applications

Keywords

About this book

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.

Authors and Affiliations

  • Rutgers University, USA

    Xinghao Chen, Michael L. Bushnell

Bibliographic Information

  • Book Title: Efficient Branch and Bound Search with Application to Computer-Aided Design

  • Authors: Xinghao Chen, Michael L. Bushnell

  • Series Title: Frontiers in Electronic Testing

  • DOI: https://doi.org/10.1007/978-1-4613-1329-8

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Kluwer Academic Publishers 1996

  • Hardcover ISBN: 978-0-7923-9673-4Published: 31 December 1995

  • Softcover ISBN: 978-1-4612-8571-7Published: 26 September 2011

  • eBook ISBN: 978-1-4613-1329-8Published: 06 December 2012

  • Series ISSN: 0929-1296

  • Edition Number: 1

  • Number of Pages: XIV, 146

  • Topics: Circuits and Systems, Electrical Engineering

Publish with us