Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation
Issue No. 03 - March (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.210176
<p>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<or=m). Such a cycle is shown to supply a (m-1) bit exhaustive pattern including the all-zeros (m-1)-tuple. Schemes have been reported specifying how one or more subsets of (m-1) cell positions of an n-cell CA can be identified to generate exhaustive patterns in an m-dimensional cyclic subspace.</p>
additive cellular automata; pseudoexhaustive test pattern generation; vector space; cellular automata; logic testing.
P.P. Chaudhuri, A.K. Das, "Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation", IEEE Transactions on Computers, vol. 42, no. , pp. 340-352, March 1993, doi:10.1109/12.210176