Static test sequence compaction based on segment reordering and accelerated vector restoration

  • Authors:
  • Surendra Bommu;Srimat T. Chakradhar;Kiran B. Doreswamy

  • Affiliations:
  • -;-;-

  • Venue:
  • ITC '98 Proceedings of the 1998 IEEE International Test Conference
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

Abstract

Vector restoration based static compaction techniques [7]report significant compaction. In this paper we propose anew technique for static compaction which gives comparableor better compaction and runs 10 to 50 times fasterthan the fastest method proposed in [7]. The new techniquesolves the problem of compaction by dividing it intosmall subproblems (referred to as segments). The solutionsto these segments (or subproblems) are then dynamicallymerged providing excellent speed up without compromisingon compaction efficiency. Further speed up is achievedby compacting the individual segments using an acceleratedvector-restoration based compaction technique. If afault requires a sequence of length n to be detected, in ourapproach the number of vectors that need to be simulated forrestoring the sequence is O(n log2n), while the prevailingapproaches require simulation on O(n 2 ) vectors. Experimentalresults demonstrate substantial speedups comparedto the prevailing vector restoration based techniques, whilegiving comparable or better compaction. When comparedto the fastest method proposed in [7], our method was 5 to30 times faster on ISCAS circuits and 10 to 50 times fasteron real-life production circuits. For example, on one ofthe production circuits, our method gave 27 percent compactionin 188 seconds, while an improved version of thefastest method in [7] gave 25 percent compaction in 10200seconds. In addition, our method could successfully processlarge industrial designs which could not be completedby earlier techniques [7] in 2 CPU days.