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.
This work is supported by AICTE Career Award fund (F.No. 1-51/RID/CA/29/2009-10), awarded to Sukanta Das.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. Journal of Computer and System Sciences 6, 448–464 (1972)
Das, S., Sikdar, B.K.: Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 68–77. Springer, Heidelberg (2006)
Lee, J., Peper, F., Adachi, S., Morita, K., Mashiko, S.: Reversible Computation in Asynchronous Cellular Automata. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 220–229. Springer, Heidelberg (2002)
Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Accepted in Complex Systems (2012)
Toffoli, T.: Computation and construction universality of reversible cellular automata. J. Comput. System Sci. 15, 213–231 (1977)
Wolfram, S.: Theory and applications of cellular automata. World Scientific, Singapore (1986) ISBN 9971-50-124-4 pbk
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, S., Sarkar, A., Sikdar, B.K. (2012). Synthesis of Reversible Asynchronous Cellular Automata for Pattern Generation with Specific Hamming Distance. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_66
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33349-1
Online ISBN: 978-3-642-33350-7
eBook Packages: Computer ScienceComputer Science (R0)