
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Kevin Cattell, Shujian Zhang, Micaela Serra, Jon C. Muzio, "2byn$n$ Hybrid Cellular Automata with Regular Configuration: Theory and Application," IEEE Transactions on Computers, vol. 48, no. 3, pp. 285295, March, 1999.  
BibTex  x  
@article{ 10.1109/12.754995, author = {Kevin Cattell and Shujian Zhang and Micaela Serra and Jon C. Muzio}, title = {2byn$n$ Hybrid Cellular Automata with Regular Configuration: Theory and Application}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {3}, issn = {00189340}, year = {1999}, pages = {285295}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.754995}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  2byn$n$ Hybrid Cellular Automata with Regular Configuration: Theory and Application IS  3 SN  00189340 SP285 EP295 EPD  285295 A1  Kevin Cattell, A1  Shujian Zhang, A1  Micaela Serra, A1  Jon C. Muzio, PY  1999 KW  Linear hybrid cellular automata KW  linear finite state machine KW  maximum length cycle KW  primitive polynomial. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—This paper introduces a new class of twodimensional linear cellular automata and derives a number of their properties. A recursive relation is proved which enables the characteristic polynomial to be efficiently calculated, and minimal cost, maximal length generators of this type are listed for sizes up to 500. A theoretical analysis of the two vector transition properties of the cellular automata is given and it is shown that, for testing sequential faults over a set of standard benchmarks, the twodimensional cellular automata perform, on average, better than onedimensional linear hybrid cellular automata, and much better than linear finite shift registers.
[1] P.H. Bardell, “Primitive Polynomials of Degree 301 through 500,” J. Electronic Testing: Theory and Applications, vol. 3, no. 2 pp. 175176, 1992.
[2] P.H. Bardell, W.H. McAnney, and J. Savir, BuiltIn Test for VLSI, John Wiley&Sons, New York, 1987.
[3] F. Brglez and H. Fujiwara, “A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in FORTRAN,” Proc. IEEE Int'l Symp. Circuits and Systems, pp. 663698, 1985.
[4] K. Cattell, “Characteristic Polynomials of OneDimensional Linear Hybrid Cellular Automata,” PhD dissertation, Dept. of Computer Science, Univ. of Victoria, Victoria, B.C., Canada, May 1995.
[5] K. Cattell and J.C. Muzio, "Synthesis of OneDimensional Linear Hybrid Cellular Automata," IEEE Trans. ComputerAided Design, vol. 15, pp. 325335, 1996.
[6] K. Cattell and S. Zhang, “Minimal Cost OneDimensional Linear Hybrid Cellular Automata of Degree through 500,” J. Electronic Testing: Theory and Applications, vol. 6, no. 2, pp. 255258, 1995.
[7] D.R. Chowdhury, I. Sengupta, and P.P. Chaudhuri, “A Class of TwoDimensional Cellular Automata and Their Applications in Random Pattern Testing,” J. Electronic Testing: Theory and Applications, Vol. 5, No. 1, Feb. 1994, pp. 6782.
[8] A.K. Das and P. Pal Chaudhuri, "Efficient Characterization of Cellular Automata," Proc. IEE (Part E), vol. 137, pp. 8187, Jan. 1990.
[9] K. Furuya and E.J. McCluskey,"TwoPattern Test Capabilities of Autonomous TPG Circuits," Proc. IEEE Int'l Test Conf., pp. 704711, Oct. 1991.
[10] E. Kontopidi and J.C. Muzio, “The Partitioning of Linear Registers for Testing Applications,” Microelectronics J., vol. 24, pp. 533546, 1993.
[11] R. Lidl and H. Niederreiter,An Introduction to Finite Fields and Their Applications.Cambridge: Cambridge Univ. Press, 1986.
[12] S. Nandi, B. Vamsi, S. Chakraborty,, and P.P. Chauduri, “Cellular Automata as a BIST Structure for Testing CMOS Circuits,” IEE Proc.—Computers and Digital Techniques, vol. 141, no. 1, pp. 4147, 1994.
[13] M. Serra and T. Slater, “A Lanczos Algorithm in a Finite Field and Its Application,” J. Combinatorial Mathematics and Combinatorial Computing, vol. 7, pp. 1132, 1990.
[14] M. Serra et al., "The Analysis of OneDimensional Linear Cellular Automata and Their Aliasing Properties," IEEE Trans. ComputerAided Design, vol. 9, no. 7, pp. 767778, July 1990.
[15] H.S. Stone,Discrete Mathematical Structures and Their Applications. Science Research Associates Inc., 1973.
[16] X. Sun, E. Kontopidi, M. Serra,, and J.C. Muzio, “The Concatenation and Partitioning of Linear Finite State Machines,” Int'l J. Electronics, vol. 78, no. 5, pp. 809839, 1995.
[17] G. Tromp and A.J. van de Goor, “Logic Synthesis of 100percent Testable Logic Networks,” Proc. IEEE Int'l Conf. Computer Design, pp. 428431, 1991.
[18] P.G. Tzionas, P.G. Tsalides,, and A. Thanailakis, “A New, Cellular AutomatonBased Nearest Neighbor Pattern Classifier and Its VLSI Implementation,” IEEE Trans. VLSI Systems, vol. 2, no. 3, pp. 343353, 1994.
[19] S. Zhang,R. Byrne, and D.M. Miller.,"BIST Generators for Sequential Faults," Proc. IEEE Int'l Conf. Computer Design, pp. 260263, 1992.
[20] S. Zhang, R. Byrne, J.C. Muzio, and D.M. Miller, "Why Cellular Automata Are Better than LFSRs as BuiltIn SelfTest Generators for SequentialType Faults," Proc. IEEE Int'l Symp. Circuits and Systems, vol. 1, pp. 6972, 1994.
[21] S. Zhang, R. Byrne, J.C. Muzio,, and D.M. Miller, “Quantitative Analysis for Linear Hybrid Cellular Automata and LFSR as BuiltIn SelfTest Generators for Sequential Faults,” J. Electronic Testing: Theory and Applications, vol. 7, no. 3, pp. 209221, 1995.
[22] S. Zhang, D.M. Miller,, and J.C. Muzio, “Determination of Minimal Cost OneDimensional Linear Hybrid Cellular Automata,” IEE Electronics Letters, vol. 27, no. 18, pp. 1,6251,627, 1991.