2-by-n$n$ Hybrid Cellular Automata with Regular Configuration: Theory and Application

Authors:
Kevin Cattell;Shujian Zhang;Micaela Serra;Jon C. Muzio
Affiliations:
Hewlett-Packard, Rohnert Park, CA;Northern Telecom, Ottawa, Ont., Canada;Univ. of Victoria, Victoria, B.C., Canada;Univ. of Victoria, Victoria, B.C., Canada
Venue:
IEEE Transactions on Computers
Year:
1999

Citing 11
Cited 5

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Built-in test for VLSI: pseudorandom techniques

Built-in test for VLSI: pseudorandom techniques
Primitive polynomials of degree 301 through 500

Journal of Electronic Testing: Theory and Applications
A class of two-dimensional cellular automata and their applications in random pattern testing

Journal of Electronic Testing: Theory and Applications
Minimal cost one-dimensional linear hybrid cellular automata of degree through 500

Journal of Electronic Testing: Theory and Applications
Quantitative analysis for linear hybrid cellular automata and LFSR as built-in self-test generators for sequential faults

Journal of Electronic Testing: Theory and Applications
Logic Synthesis of 100-percent Testable Logic Networks

ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
BIST Generators for Sequential Faults

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Two-Pattern Test Capabilities of Autonomous TPG Circuits

Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
Characteristic polynomials of one-dimensional linear hybrid cellular automata

Characteristic polynomials of one-dimensional linear hybrid cellular automata
Synthesis of one-dimensional linear hybrid cellular automata

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata

IEEE Transactions on Computers
A 2-by-n Hybrid Cellular Automaton Implementation Using a Bio-Inspired FPGA

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Bio-inspired Applications of Connectionism-Part II
Synthesis of Pattern Generators Based on Cellular Automata with Phase Shifters

ITC '99 Proceedings of the 1999 IEEE International Test Conference
A unified method for phase shifter computation

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations

ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper introduces a new class of two-dimensional 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 two-dimensional cellular automata perform, on average, better than one-dimensional linear hybrid cellular automata, and much better than linear finite shift registers.