The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Reducing test application time for full scan embedded cores
Abstract
We propose a new design for testability technique, Parallel Serial Full Scan (PSFS), for reducing the test application time for full scan embedded cores. Test application time reduction is achieved by dividing the scan chain into multiple partitions and shifting in the same vector to each scan chain through a single scan in input. The experimental results for the ISCAS890 circuits showed that PSFS technique significantly reduces both the test application time and the amount of test data for full scan embedded cores.
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
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
Self-citationTest 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
PROOFS: a fast, memory-efficient sequential circuit fault simulator
Niermann, T. M., Cheng, W.-T., & Patel, J. H. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.124398 · Cited by 235
Self-citationNew techniques for deterministic test pattern generation
Hamzaoğlu, İ., & Patel, J. H. (2002) · IEEE VLSI Test Symposium (VTS) · doi:10.1109/vtest.1998.670910 · Cited by 90
Self-citationAn algorithm to reduce test application time in full scan designs
Lee, & Saluja (1992) · International Conference on Computer Aided Design · doi:10.1109/iccad.1992.279405 · Cited by 60
A methodology to design efficient BIST test pattern generators
Chen, C.-A., & Gupta, S. K. (2002) · IEEE International Test Conference (ITC) · doi:10.1109/test.1995.529913 · Cited by 49
A genetic approach to test application time reduction for full scan and partial scan circuits
Rudnick, E. M., & Patel, J. H. (2002) · International Conference on VLSI Design · doi:10.1109/icvd.1995.512126 · Cited by 23
Self-citationReconfiguration techniques for a single scan chain
Narayanan, S., & Breuer, M. A. (1995) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.387735 · Cited by 19
Cited by
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
Metadata
- Authors
- Hamzaoglu, I., & Patel, J. H.
- Venue
- Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352)
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 260-267
- OpenAlex
- W1763985980
- Cited by
- 335
- References
- 9
- FWCI
- 32.54
- 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
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.