The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Test vector decompression via cyclical scan chains and its application to testing core-based designs
Abstract
A novel test vector compression/decompression technique is proposed for reducing the amount of test data that must be stored on a tester and transferred to each core when testing a core-based design. A small amount of on-chip circuitry is used to reduce both the test storage and test time required for testing a core-based design. The fully specified test vectors provided by the core vendor are stored in compressed form in the tester memory and transferred to the chip where they are decompressed and applied to the core (the compression is lossless). Instead of having to transfer each entire test vector from the tester to the core, a smaller amount of compressed data is transferred instead. This reduces the amount of test data that must be stored on the tester and hence reduces the total amount of test time required for transferring the data with a given test data bandwidth.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Combinational profiles of sequential benchmark circuits
Brglez, F., Bryan, D., & Kozminski, K. (2003) · IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.1989.100747 · Cited by 2,095
A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN
Brglez, F. (1985) · Cited by 1,273
Hellebrand, S., Rajski, J., Tarnick, S., Venkataraman, S., & Courtois, B. (1995) · IEEE Transactions on Computers · doi:10.1109/12.364534 · Cited by 408
COMPACTEST: a method to generate compact test sets for combinational circuits
Pomeranz, I., Reddy, L. N., & Reddy, S. M. (1993) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.238040 · Cited by 213
Pattern Generation for a Deterministic BIST Scheme
Hellebrand, S., Reeb, B., Tarnick, S., & Wunderlich, H.-J. (n.d.) · Cited by 124
Pattern generation for a deterministic BIST scheme
Hellebrand, S., Reeb, B., Tarnick, S., & Wunderlich, H.-J. (2002) · International Conference on Computer Aided Design · doi:10.1109/iccad.1995.479997 · Cited by 106
Built-in self testing of sequential circuits using precomputed test sets
Iyengar, V., Chakrabarty, K., & Murray, B. T. (2002) · IEEE VLSI Test Symposium (VTS) · doi:10.1109/vtest.1998.670900 · Cited by 66
Cost-effective generation of minimal test sets for stuck-at faults in combinational logic circuits
Kajihara, S., Pomeranz, I., Kinoshita, K., & Reddy, S. M. (1993) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/157485.164617 · Cited by 47
Deterministic pattern generation for weighted random pattern testing
Reeb, B., & Wunderlich, H.-J. (1996) · doi:10.5555/787259.787640 · Cited by 39
Deterministic pattern generation for weighted random pattern testing
Reeb, B., & Wunderlich, H.-J. (2002) · European Design and Test Conference · doi:10.1109/edtc.1996.494124 · Cited by 36
Cited by
Reducing test application time for full scan embedded cores
Hamzaoglu, I., & Patel, J. H. (2003) · Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352) · doi:10.1109/ftcs.1999.781060 · Cited by 335
An efficient test vector compression scheme using selective huffman coding
Jas, A., Ghosh-Dastidar, J., Ng, M.-E., & Touba, N. A. (2003) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2003.811452 · Cited by 277
Self-citation
Metadata
- Authors
- Jas, A., & Touba, N. A.
- Venue
- Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270)
- Publisher
- Int. Test Conference
- Published
- 2002-11-27
- Pages
- 458-464
- ISSN
- 1089-3539 (ISSN-L)
- OpenAlex
- W2107800433
- Cited by
- 275
- References
- 11
- FWCI
- 27.76
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Test vector decompression via cyclical scan chains and its application to testing core-based designs. https://app.cochat.ai/papers/10.1109/test.1998.743186
- The paper
- Jas, A., & Touba, N. A. (2002). Test vector decompression via cyclical scan chains and its application to testing core-based designs. Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270). https://doi.org/10.1109/test.1998.743186
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.