Skip to main content

An Efficient Heuristic for Peak Capture Power Minimization During Scan-Based Test

Buy Article:

$107.14 + tax (Refund Policy)

IR-Drop induced timing failures during testing can be avoided by minimizing the peak capture-power. This paper models the Capture-Power minimization problem as an instance of the Bottleneck Traveling Salesman Path Problem (BTSPP). The solution for the BTSPP implies an ordering on the input test vectors, which when followed during testing minimizes the Peak Capture-Power. The paper also presents a methodology for estimating a lower bound on the peak capture-power. Applying the proposed technique on ITC'99 benchmarks yielded optimal (equal to the estimated lower bound) results for all circuits. Interestingly, the technique also significantly reduced the average power consumed during testing when compared with commercial state-of-the-art tools.

Keywords: BINARY SEARCH; BOTTLENECK BICONNECTED SPANNING SUB-GRAPH PROBLEM (BBSSP); BOTTLENECK TRAVELING SALESMAN PATH PROBLEM (BTSPP); DESIGN FOR TESTABILITY (DFT); PEAK CAPTURE-POWER; SCAN-BASED TESTING; TEST VECTOR ORDERING (TVO)

Document Type: Research Article

Publication date: 01 August 2013

More about this publication?
  • The electronic systems that can operate with very low power are of great technological interest. The growing research activity in the field of low power electronics requires a forum for rapid dissemination of important results: Journal of Low Power Electronics (JOLPE) is that international forum which offers scientists and engineers timely, peer-reviewed research in this field.
  • Editorial Board
  • Information for Authors
  • Subscribe to this Title
  • Terms & Conditions
  • Ingenta Connect is not responsible for the content or availability of external websites
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content