The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Cellular automata-based pseudorandom number generators for built-in self-test
Abstract
A variation on a built-in self-test technique is presented that is based on a distributed pseudorandom number generator derived from a one-dimensional cellular automata (CA) array. The cellular automata-logic-block-observation circuits presented are expected to improve upon conventional design for testability circuitry such as built-in logic-block operation as a direct consequence of reduced cross correlation between the bit streams that are used as inputs to the logic unit under test. Certain types of circuit faults are undetectable using the correlated bit streams produced by a conventional linear-feedback-shift-register (LFSR). It is also noted that CA implementations exhibit data compression properties similar to those of the LFSR and that they display locality and topological regularity, which are important attributes for a very large-scale integration implementation. It is noted that some CAs may be able to generate weighted pseudorandom test patterns. It is also possible that some of the analysis of pseudorandom testing may be more directly applicable to CA-based pseudorandom testing than to LFSR-based schemes.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Introduction to V.L.S.I. Systems
Mead, C. (1981) · IEE Proceedings I Solid State and Electron Devices · doi:10.1049/ip-i-1.1981.0010 · Cited by 3,720
Statistical mechanics of cellular automata
Wolfram, S. (1983) · Reviews of Modern Physics · doi:10.1103/revmodphys.55.601 · Cited by 3,114
Golomb, S. W. (2017) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,180
Universality and complexity in cellular automata
Wolfram, S. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90245-8 · Cited by 1,914
Random sequence generation by cellular automata
Wolfram, S. (1986) · Advances in Applied Mathematics · doi:10.1016/0196-8858(86)90028-x · Cited by 494
Design for testability—A survey
Williams, T. W., & Parker, K. P. (1983) · Proceedings of the IEEE · doi:10.1109/proc.1983.12531 · Cited by 392
A very fast shift-register sequence random number generator
Kirkpatrick, S., & Stoll, E. P. (1981) · Journal of Computational Physics · doi:10.1016/0021-9991(81)90227-8 · Cited by 252
Group Properties of Cellular Automata and VLSI Applications
Pries, Thanailakis, & Card (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676709 · Cited by 160
Origins of randomness in physical systems
Wolfram, S. (1985) · Physical Review Letters · doi:10.1103/physrevlett.55.449 · Cited by 125
Test generation systems in Japan
Funatsu, S., Wakatsuki, N., & Arima, T. (1975) · ACM/IEEE Design Automation Conference (DAC) · doi:10.5555/800261.809058 · Cited by 89
Cited by
Parallel random number generation for VLSI systems using cellular automata
Hortensius, P. D., McLeod, R. D., & Card, H. C. (1989) · IEEE Transactions on Computers · doi:10.1109/12.35843 · Cited by 225
Self-citationModeling and simulation of oscillator-based random number generators
Petrie, C. S., & Connelly, J. A. (1996) · 1996 IEEE International Symposium on Circuits and Systems (ISCAS) · doi:10.1109/iscas.1996.541967 · Cited by 62
Metadata
- Authors
- Hortensius, P. D., McLeod, R. D., Pries, W., Miller, D. M., & Card, H. C.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 1989
- Volume
- 8
- Issue
- 8
- Pages
- 842-859
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2097890209
- Cited by
- 350
- References
- 11
- FWCI
- 8.76
- 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: Cellular automata-based pseudorandom number generators for built-in self-test. https://app.cochat.ai/papers/10.1109/43.31545
- The paper
- Hortensius, P. D., McLeod, R. D., Pries, W., Miller, D. M., & Card, H. C. (1989). Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. https://doi.org/10.1109/43.31545
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.