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

  • Xinghao Chen
  • Michael L. Bushnell

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

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Theory

    1. Front Matter
      Pages 1-1
    2. Xinghao Chen, Michael L. Bushnell
      Pages 3-9
    3. Xinghao Chen, Michael L. Bushnell
      Pages 11-23
    4. Xinghao Chen, Michael L. Bushnell
      Pages 25-34
  3. Applications

    1. Front Matter
      Pages 35-35
    2. Xinghao Chen, Michael L. Bushnell
      Pages 37-54
    3. Xinghao Chen, Michael L. Bushnell
      Pages 55-58
    4. Xinghao Chen, Michael L. Bushnell
      Pages 59-73
    5. Xinghao Chen, Michael L. Bushnell
      Pages 75-95
    6. Xinghao Chen, Michael L. Bushnell
      Pages 97-101
    7. Xinghao Chen, Michael L. Bushnell
      Pages 103-108
    8. Xinghao Chen, Michael L. Bushnell
      Pages 109-110
  4. Back Matter
    Pages 111-146

About this book

Introduction

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.

Keywords

algorithms circuit complexity computer computer-aided design (CAD) control logic optimization

Authors and affiliations

  • Xinghao Chen
    • 1
  • Michael L. Bushnell
    • 1
  1. 1.Rutgers UniversityUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4613-1329-8
  • Copyright Information Springer-Verlag US 1996
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8571-7
  • Online ISBN 978-1-4613-1329-8
  • Series Print ISSN 0929-1296
  • About this book
Industry Sectors
Pharma
Automotive
Biotechnology
Electronics
Telecommunications
Energy, Utilities & Environment
Aerospace