Sciweavers

CEC
2005
IEEE

Dynamic power minimization during combinational circuit testing as a traveling salesman problem

14 years 5 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume significant dynamic power during testing because of enhanced switching activity in the internal nodes. Our work focuses on the fact that power minimization is a Traveling Salesman Problem (TSP). We explore application of local search and genetic algorithms to test set reordering and perform a quantitative comparison to previously used deterministic techniques. We also consider reduction of the original test set as a dual-objective optimization problem, where switching activity and fault coverage are the two objective functions.
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where CEC
Authors Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley, Yashwant K. Malaiya
Comments (0)