Transformation-based peak power reduction for test sequences

This paper describes a new algorithm for transforming an existing test sequence for sequential circuits into a cheaper one from the point of view of peak power consumption. The algorithm exploits both symbolic techniques (to identify sub-sequences performing a given state transition) and heuristic methods. Preliminary experimental results show that the algorithm is able to reduce the peak power consumption of ATPG-generated sequences by up to 54%, while the reduction of the fault coverage is limited to at most 1%.

[1]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[2]  Michael S. Hsiao,et al.  Sequential circuit test generation using dynamic state traversal , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[3]  Mark Horowitz,et al.  IRSIM: An Incremental MOS Switch-Level Simulator , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  Sandeep K. Gupta,et al.  ATPG for Heat Dissipation Minimization During Test Application , 1998, IEEE Trans. Computers.

[5]  Paolo Prinetto,et al.  A test pattern generation methodology for low power consumption , 1998, Proceedings. 16th IEEE VLSI Test Symposium (Cat. No.98TB100231).

[6]  Yervant Zorian,et al.  A distributed BIST control scheme for complex VLSI devices , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.