The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers
Abstract
We propose a new scheme for built-in test (BIT) that uses multiple-polynomial linear feedback shift registers (MP-LFSR's). The same MP-LFSR that generates random patterns to cover easy to test faults is loaded with seeds to generate deterministic vectors for difficult to test faults. The seeds are obtained by solving systems of linear equations involving the seed variables for the positions where the test cubes have specified values. We demonstrate that MP-LFSR's produce sequences with significantly reduced probability of linear dependence compared to single polynomial LFSR's. We present a general method to determine the probability of encoding as a function of the number of specified bits in the test cube, the length of the LFSR and the number of polynomials. Theoretical analysis and experiments show that the probability of encoding a test cube with s specified bits in an s-stage LFSR with 16 polynomials is 1-10/sup -6/. We then present the new BIT scheme that allows for an efficient encoding of the entire test set. Here the seeds are grouped according to the polynomial they use and an implicit polynomial identification reduces the number of extra bits per seed to one bit. The paper also shows methods of processing the entire test set consisting of test cubes with varied number of specified bits. Experimental results show the tradeoffs between test data storage and test application time while maintaining complete fault coverage.>
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
(1979) · Cited by 43,841
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
COMPACTEST: A METHOD TO GENERATE COMPACT TEST SETS FOR COMBINATIONAL CIRCUITS
Pomeranz, I., Reddy, L. N., & Reddy, S. M. (2005) · 1991, Proceedings. International Test Conference · doi:10.1109/test.1991.519510 · Cited by 261
Advanced automatic test pattern generation and redundancy identification techniques
Schulz, M. H., & Auth, E. (2003) · [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers · doi:10.1109/ftcs.1988.5293 · Cited by 176
An Efficient Bist Scheme Based On Reseeding Of Multiple Polynomial Linear Feedback Shift Registers
Venkataraman, S., Rajski, J., Hellebrand, S., & Tarnick, S. (2005) · International Conference on Computer Aided Design · doi:10.1109/iccad.1993.580117 · Cited by 98
Self-citationHardware-based weighted random pattern generation for boundary scan
Brglez, F., Gloster, C., & Kedem, G. (2003) · doi:10.1109/test.1989.82307 · Cited by 94
Cited by
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
Metadata
- Authors
- Hellebrand, S., Rajski, J., Tarnick, S., Venkataraman, S., & Courtois, B.
- Venue
- IEEE Transactions on Computers
- Published
- 1995
- Volume
- 44
- Issue
- 2
- Pages
- 223-233
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2138530143
- Cited by
- 408
- References
- 6
- FWCI
- 7.17
- 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: Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers. https://app.cochat.ai/papers/10.1109/12.364534
- The paper
- Hellebrand, S., Rajski, J., Tarnick, S., Venkataraman, S., & Courtois, B. (1995). Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers. IEEE Transactions on Computers. https://doi.org/10.1109/12.364534
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.