Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The reversibility issue of 1-dimensional asynchronous cellular automata (ACA) has been reported in [4]. The ACA rules are classified to synthesis reversible ACA. Characterization has been done to explore the update patterns of cells forming the reversible ACA. This work reports synthesis of reversible ACA for pattern generation, where specific Hamming distance between two consecutive ACA states of a cycle is maintained. A hardware realization of ACA is also reported that can effectively be utilized in VLSI circuit design, testing of asynchronous circuit, and Hamming code generation. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Das, S., Sarkar, A., & Sikdar, B. K. (2012). Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 643–652). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free