Year: 2005
Type: conference-paper
Abstract: Test data compression has become increasingly popular for distributing test complexity between automatic test equipment and on-chip structures. We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on evolutionary algorithms. In contrast to existing code-based methods, we allow unspecified values in matching vectors, which allows encoding of arbitrary test sets using a relatively small number of codewords. Experimental results for both stuck-at and path delay fault test sets for ISCAS circuits demonstrate an improvement compared to existing techniques.
Authors: I. Polian, A. Czutro, B. Becker
Institution: University of Freiburg
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2095685963
