Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of several researchers over various backgrounds and fields for modeling different physical, natural as well as real-life phenomena. Classically, CAs are uniform. However, non-uniformity has also been introduced in update pattern, lattice structure, neighborhood dependency and local rule. In this survey, we tour to the various types of CAs introduced till date, the different characterization tools, the global behavior of CAs, like universality, reversibility, dynamics etc. Special attention is given to non-uniformity in CAs and especially to non-uniform elementary CAs, which have been very useful in solving several real-life problems.

A survey of cellular automata: types, dynamics, non-uniformity and applications

Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of several researchers over various backgrounds and fields for modelling different physical, natural as well as real-life phenomena. Classically, CAs are uniform. However, non-uniformity has also been introduced in update pattern, lattice structure, neighborhood dependency and local rule. In this survey, we tour to the various types of CAs introduced till date, the different characterization tools, the global behaviors of CAs, like universality, reversibility, dynamics etc. Special attention is given to non-uniformity in CAs and especially to non-uniform elementary CAs, which have been very useful in solving several real-life problems.

A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications

/pdf/construction-d-ensembles-de-points-basee-sur-des-recurrences-4pgpffw4by.pdf

Construction d'ensembles de points basee sur des recurrences lineaires dans un corps fini de caracteristique 2 pour la simulation Monte Carlo et l'integration quasi-Monte Carlo

This paper introduces the concept of hierarchical cellular automata (HCA). The theory of HCA is developed over the Galois extension field GF(2(pqr..)), where each cell of the CA can store and process a symbol in the extension field GF (2(pqr..)). The hierarchical field structure of GF(2(pqr..)) is employed for design of an HCA-based test pattern generator (HCATPG). The HCATPG is ideally suited for testing very large scale integration circuits specified in hierarchical structural description. Experimental results establish the fact that the HCATPG achieves higher fault coverage than that which could be achieved with any other test structures. The concept of percentile improvement in fault coverage is introduced to have a realistic assessment of fault coverage achieved with the proposed RCATPG.

Design of hierarchical cellular automata for on-chip test pattern generator

Image registration is a key component of spatial analyses that involve different data sets of the same area. Automatic approaches in this domain have witnessed the application of several intelligent methodologies over the past decade; however accuracy of these approaches have been limited due to the inability to properly model shape as well as contextual information. In this paper, we investigate the possibility of an evolutionary computing based framework towards automatic image registration. Cellular Neural Network has been found to be effective in improving feature matching as well as resampling stages of registration, and complexity of the approach has been considerably reduced using corset optimization. CNN-prolog based approach has been adopted to dynamically use spectral and spatial information for representing contextual knowledge. The salient features of this work are feature point optimisation, adaptive resampling and intelligent object modelling. Investigations over various satellite im...

http://cejsh.icm.edu.pl/cejsh/element/bwmeta1.element.oai-journals-pan-pl-98334/c/oai-journals-pan-pl-98334_full-text_art3.pdf

A CNN based hybrid approach towards automatic image registration

This paper sets a new direction for test solution of VLSI circuits. The solution is based on the theory of extension field-that is, extension of finite field commonly referred to as Galois field (GF). The GF(2) with the set {0,1} traditionally employed in the digital domain has been extended in the present work to GF(2/sup p/) with elements from the set {0,1,2,...,2/sup p-1/}. The conventional on-chip LFSR/cellular automata (CA) based test pattern generators built around GF(2) elements have been replaced with the cellular structure of CF(2/sup p/) CA. The inter-cell connections and the value of p of a regular, modular and cascadable structure of GF(2/sup p/) CA can be tuned to maximize the fault coverage in a CUT (circuit under test). Availability of RTL/functional description of the CUT leads to a better tuning. The fault coverage figures obtained with GF(2/sup p/) CA based test pattern generator on the benchmark circuits and a few commercial circuits can be found to be significantly better than the best results reported so far with LFSR, GLFSR or GF(2) CA. The small set of uncovered faults can be handled with the introduction of a limited number of observation and test points. Area overhead for CATPG can be significantly reduced through the scheme of folding introduced in this paper.

Theory and application of GF(2/sup p/) cellular automata as on-chip test pattern generator

This paper presents an efficient BIST solution for VLSI circuit testing based on GF(2/sup p/) CA (cellular automata on an extended Galois field). The novel architecture of GF(2/sup p/) CA permits the BIST structure to be highly customized to the circuit under test (CUT). A methodology has been proposed to optimize the design of GF(2/sup p/) CA structure to maximize the fault coverage in a given CUT. In addition, an innovative scheme based on logic folding is presented to reduce the BIST overhead and make it more effective for large circuits.

https://ieeexplore.ieee.org/iel5/7293/19719/00913326.pdf

GF(2/sup p/) cellular automata as a built in self test structure

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

C. Yang

Author Tools

Chat about Author

Papers

Theory and application of GF(2/sup p/) cellular automata as on-chip test pattern generator

GF(2/sup p/) cellular automata as a built in self test structure