Joint Minimization of Power and Area in Scan Testing by Scan Cell Reordering

  • Authors:
  • Shalini Ghosh;Sugato Basu;Nur A. Touba

  • Affiliations:
  • -;-;-

  • Venue:
  • ISVLSI '03 Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a echnique for re-ordering ofscan cells to minimize power dissipation that is alsocapable of reducing the area overhead of the circuitcompared to a random ordering of the scan cells. For agiven test set, our proposed greedy algorithm finds the(locally) optimal scan cell ordering for a given value of \lambda,which is a rade-off parameter hat can be used by hedesigner to specify the relative importance of areaoverhead minimization and power minimization. Thestrength of our algorithm lies in the fact that we use anovel dynamic minimum transition fill (MT-fill) techniqueto fill the unspecified bits in the test vector. Experimentsperformed on the ISCAS-89 benchmark suite show areduction in power (70%for s13207, \lambda = 500) as well asa reduction in layout area (6.72%for s13207, \lambda = 500).