The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An efficient test vector compression scheme using selective huffman coding
Abstract
This paper presents a compression/decompression scheme based on selective Huffman coding for reducing the amount of test data that must be stored on a tester and transferred to each core in a system-on-a-chip (SOC) during manufacturing test. The test data bandwidth between the tester and the SOC is a bottleneck that can result in long test times when testing complex SOCs that contain many cores. In the proposed scheme, the test vectors for the SOC are stored in compressed form in the tester memory and transferred to the chip where they are decompressed and applied to the cores. A small amount of on-chip circuitry is used to decompress the test vectors. Given the set of test vectors for a core, a modified Huffman code is carefully selected so that it satisfies certain properties. These properties guarantee that the codewords can be decoded by a simple pipelined decoder (placed at the serial input of the core's scan chain) that requires very small area. Results indicate that the proposed scheme can provide test data compression nearly equal to that of an optimum Huffman code with much less area overhead for the decoder.
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
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
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
Test set compaction algorithms for combinational circuits
Hamzaoglu, I., & Patel, J. H. (1998) · Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design - ICCAD '98 · doi:10.1145/288548.288615 · Cited by 432
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
Test vector decompression via cyclical scan chains and its application to testing core-based designs
Jas, A., & Touba, N. A. (2002) · Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270) · doi:10.1109/test.1998.743186 · Cited by 275
Self-citationTest vector encoding using partial LFSR reseeding
Krishna, C. V., Jas, A., & Touba, N. A. (2002) · Proceedings International Test Conference 2001 (Cat. No.01CH37260) · doi:10.1109/test.2001.966711 · Cited by 230
Self-citationTailoring ATPG for embedded testing
Dorsch, R. G., & Wunderlich, H.-J. (2002) · IEEE International Test Conference (ITC) · doi:10.1109/test.2001.966671 · Cited by 70
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
Rxiensing scan chains for test pattern decompression
Dorsch, R. G., & Wunderlich, H.-J. (2005) · IEEE European Test Symposium (ETS) · doi:10.1109/etw.2001.946677 · Cited by 26
Reusing Scan Chains for Test Pattern Decompression
Dorsch, R. G., & Wunderlich, H.-J. (2002) · Journal of Electronic Testing · doi:10.1023/a:1014968930415 · Cited by 24
Metadata
- Authors
- Jas, A., Ghosh-Dastidar, J., Ng, M.-E., & Touba, N. A.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2003-06
- Volume
- 22
- Issue
- 6
- Pages
- 797-806
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2105028194
- Cited by
- 277
- References
- 10
- FWCI
- 23.44
- Type
- journal article
- 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: An efficient test vector compression scheme using selective huffman coding. https://app.cochat.ai/papers/10.1109/tcad.2003.811452
- The paper
- Jas, A., Ghosh-Dastidar, J., Ng, M.-E., & Touba, N. A. (2003). An efficient test vector compression scheme using selective huffman coding. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. https://doi.org/10.1109/tcad.2003.811452
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.