Test Scheduling and Scan-Chain Division Under Power Constraint
Tenth Asian Test Symposium (ATS 2001), Kyoto, Japan, November 19-21, 2001, pp. 259-264
ABSTRACT
An integrated technique for test scheduling and scan-chain division under power constraints is proposed in this paper. We demonstrate that optimal test time can be achieved for systems tested by an arbitrary number of tests per core using scan-chain division and we define an algorithm for it. The design of wrappers to allow different lengths of scan-chains per core is also outlined. We investigate the practical limitations of such wrapper design and make a worst case analysis that motivates our integrated test scheduling and scan-chain division algorithm. The efficiency and usefulness of our approach have been demonstrated with an industrial design.
| Related files: |
|---|
| ATS01.pdf | Adobe Acrobat portable document |
[LP01] Erik Larsson, Zebo Peng, "Test Scheduling and Scan-Chain Division Under Power Constraint", Tenth Asian Test Symposium (ATS 2001), Kyoto, Japan, November 19-21, 2001, pp. 259-264 |
|
