Reordering Algorithm for Minimizing Test Power in VLSI Circuits
Uložené v:
| Názov: | Reordering Algorithm for Minimizing Test Power in VLSI Circuits |
|---|---|
| Prispievatelia: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | http://www.engineeringletters.com/issues_v14/issue_1/EL_14_1_15.pdf. |
| Zbierka: | CiteSeerX |
| Predmety: | Index Terms — ATPG, Hamming Distance, Power Consumption, Reordering Algorithm, Switching Activity |
| Popis: | — Power consumption has become a crucial concern in Built In Self Test (BIST) due to the switching activity in the circuit under test(CUT). In this paper we present a novel method which aims at minimizing the total power consumption during testing. This is achieved by minimizing the switching activity in the circuit by reducing the Hamming Distance between successive test vectors. In this method the test vectors are reordered for minimum total hamming distance and the same vector set is used for testing. Experimental results with ISCAS benchmark circuits show that the switching activity can be reduced up to 21 % in comparison with conventional ATPG Algorithms like DEFGEN. The Switching activity is reduced significantly when compared with existing methods. |
| Druh dokumentu: | text |
| Popis súboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.7604; http://www.engineeringletters.com/issues_v14/issue_1/EL_14_1_15.pdf |
| Dostupnosť: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.7604 http://www.engineeringletters.com/issues_v14/issue_1/EL_14_1_15.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Prístupové číslo: | edsbas.E5C5CE14 |
| Databáza: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | — Power consumption has become a crucial concern in Built In Self Test (BIST) due to the switching activity in the circuit under test(CUT). In this paper we present a novel method which aims at minimizing the total power consumption during testing. This is achieved by minimizing the switching activity in the circuit by reducing the Hamming Distance between successive test vectors. In this method the test vectors are reordered for minimum total hamming distance and the same vector set is used for testing. Experimental results with ISCAS benchmark circuits show that the switching activity can be reduced up to 21 % in comparison with conventional ATPG Algorithms like DEFGEN. The Switching activity is reduced significantly when compared with existing methods. |
|---|