Cellular automata-based pseudorandom number generators for built-in self-test
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 8 (8) , 842-859
- https://doi.org/10.1109/43.31545
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 schemesKeywords
This publication has 14 references indexed in Scilit:
- Hard mask fabrication for magnetic random access memory elements using focused ion beam assisted selective chemical vapor depositionJournal of Applied Physics, 2003
- (λT) Complexity Measures for VLSI Computations in Constant Chip AreaIEEE Transactions on Computers, 1987
- Random sequence generation by cellular automataAdvances in Applied Mathematics, 1986
- Origins of randomness in physical systemsPhysical Review Letters, 1985
- Built-In Self-Test TechniquesIEEE Design & Test of Computers, 1985
- Universality and complexity in cellular automataPhysica D: Nonlinear Phenomena, 1984
- Statistical mechanics of cellular automataReviews of Modern Physics, 1983
- Design for testability—A surveyProceedings of the IEEE, 1983
- The theory of signature testing for VLSIPublished by Association for Computing Machinery (ACM) ,1982
- A very fast shift-register sequence random number generatorJournal of Computational Physics, 1981