Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270)
DOI: 10.1109/test.1998.743186
|View full text |Cite
|
Sign up to set email alerts
|

Test vector decompression via cyclical scan chains and its application to testing core-based designs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
137
0

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 224 publications
(137 citation statements)
references
References 18 publications
0
137
0
Order By: Relevance
“…They described a BIST scheme for non-scan circuits based on statistical coding using comma codes (very similar to Huffman codes) and run-length coding. A scheme for compression/decompression of test data using cyclical scan chains is described in [16]. It uses careful ordering of the test set and formation of cyclical scan chains to achieve compression with run-length codes.…”
Section: Related Workmentioning
confidence: 99%
“…They described a BIST scheme for non-scan circuits based on statistical coding using comma codes (very similar to Huffman codes) and run-length coding. A scheme for compression/decompression of test data using cyclical scan chains is described in [16]. It uses careful ordering of the test set and formation of cyclical scan chains to achieve compression with run-length codes.…”
Section: Related Workmentioning
confidence: 99%
“…Most use special decompression hardware on the chip [2,3,9,10,12,16]. In this paper, we focus on software-based test data compression techniques that are applicable to deterministic test vectors since the test vectors for a core in a SoC are usually precomputed by the vendor.…”
Section: Introductionmentioning
confidence: 99%
“…A promising approach for reducing test data volume for SOCs is based on data compression techniques [2,3]. In this approach, the precomputed test set Test data can be more efficiently compressed by exploiting the fact that the number of bits changing between successive patterns in a test sequence is generally very small.…”
Section: Introductionmentioning
confidence: 99%
“…In this approach, the precomputed test set Test data can be more efficiently compressed by exploiting the fact that the number of bits changing between successive patterns in a test sequence is generally very small. This observation was used in [3], where a "difference vector" sequence ference vectors and based on cyclical scan registers (CSRs) is sketched in Figure 1. A drawback of the compression method described in [3] is that it relies on variable-to-fixedlength codes, which are less efficient than more general variable-to-variable-length codes [5,6].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation