Search space pruning techniques in ATPG for VLSI circuits

Authors:
Michael Dimopoulos;Panagiotis Linardis
Affiliations:
Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece
Venue:
ICC'05 Proceedings of the 9th International Conference on Circuits
Year:
2005

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
Two-level logic minimization: an overview

Integration, the VLSI Journal
Solving covering problems using LPR-based lower bounds

DAC '97 Proceedings of the 34th annual Design Automation Conference
New Static Compaction Techniques of Test Sequences for Sequential Circuits

EDTC '97 Proceedings of the 1997 European conference on Design and Test
20.3 A Test Pattern Generation Methodology for Low-Power Consumption

VTS '98 Proceedings of the 16th IEEE VLSI Test Symposium
Negative thinking in branch-and-bound: the case of unate covering

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Accelerating the compaction of test sequences in sequential circuits through problem size reduction

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper presents a, common, unified approach to solve either the test sequence compaction problem or the power minimization problem during circuit testing. This approach is based on an exact Branch and Bound algorithm that exploits information from the respective problems. In particular decision making during the Branch and Bound method follows some rules devised so as to avoid unnecessary choices and thus reducing the search space. Experimental results that are presented, comparing the proposed algorithm with other solvers from literature, show the effectiveness of the proposed method.