Condensed Linear Feedback Shift Register (LFSR) Testing A Pseudoexhaustive Test Technique
IEEE Transactions on Computers - The MIT Press scientific computation series
An efficient on chip deterministic test pattern generation scheme
Microprocessing and Microprogramming
Cellular automata circuits for built-in self test
IBM Journal of Research and Development
Cellular Automata-Based Signature Analysis for Built-In Self-Test
IEEE Transactions on Computers
On characterization of cellular automata with matrix algebra
Information Sciences: an International Journal
Shift Register Sequences
Exhaustive Test Pattern Generation Using Cyclic Codes
IEEE Transactions on Computers
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
Analysis of Periodic and Intermediate Boundary 90/150 Cellular Automata
IEEE Transactions on Computers
CAA Decoder for Cellular Automata Based Byte Error Correcting Code
IEEE Transactions on Computers
Arithmetic Additive Generators of Pseudo-Exhaustive Test Patterns
IEEE Transactions on Computers
Cellular automata based synthesis of easily and fully testable FSMs
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Cellular-Automata-Array-Based Diagnosis of Board Level Faults
IEEE Transactions on Computers
Cellular Automata-Based Recursive Pseudoexhaustive Test Pattern Generator
IEEE Transactions on Computers
Von Neumann hybrid cellular automata for generating deterministic test sequences
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Concurrent Error Detection Using Monitoring Machines
IEEE Design & Test
CA-Based Byte Error-Correcting Code
IEEE Transactions on Computers
A Low-Cost High-Capacity Associative Memory Design Using Cellular Automata
IEEE Transactions on Computers
IEEE Transactions on Computers
Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q)
IEEE Transactions on Computers
Theory and applications of cellular automata for synthesis of easily testable combinational logic
ATS '95 Proceedings of the 4th Asian Test Symposium
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Board level fault diagnosis using cellular automata array
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
A VLSI architecture for cellular automata based parallel data compression
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
On Incorporation of BIST for the Synthesis of Easily and Fully Testable Controllers
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Design Of A Universal BIST (UBIST) Structure
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Comparative Study of CA-based PRPGs and LFSRs with Phase Shifters
VTS '99 Proceedings of the 1999 17TH IEEE VLSI Test Symposium
Synthesis of Pattern Generators Based on Cellular Automata with Phase Shifters
ITC '99 Proceedings of the 1999 IEEE International Test Conference
Analysis of complemented CA derived from linear hybrid group CA
Computers & Mathematics with Applications
Analysis of 90/150 Two Predecessor Nongroup Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Analysis of Linear Group GF(2p) Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Nonlinear Pseudorandom Sequences Based on 90/150 LHGCA
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Exploring Cycle Structures of Additive Cellular Automata
Fundamenta Informaticae - Membrane Computing
Analysis of hybrid group cellular automata
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Behaviors of single attractor cellular automata over galois field GF(2p)
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA
Mathematical and Computer Modelling: An International Journal
Exploring Cycle Structures of Additive Cellular Automata
Fundamenta Informaticae - Membrane Computing
| Hi-index | 15.02 |
A novel scheme for utilizing the regular structure of three neighborhood additive cellular automata (CAs) for pseudoexhaustive test pattern generation is introduced. The vector space generated by a CA can be decomposed into several cyclic subspaces. A cycle corresponding to an m-dimensional cyclic subspace has been shown to pseudoexhaustively test an n-input circuit (n