Abstract
The cellular automata (CA) have found its application in diverse fields. But in order to utilize the whole state space of a maximum length CA one has to run 2n− 1 clock cycles. Using the closure property of a group CA this paper shows how to reach a state which is far from the initial state using very few cycles. It also develops two algorithms to utilize the whole state space of CA using very few cycles. Using these algorithms it creates n ×n pseudo-random boolean mappings having very good statistical properties.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chaudhury, P.P., Chowdhury, D.R., Nandi, S., Chattopadhay, S.: Additive Cellular Automata Theory and Application, vol. 1. IEEE Computer Society Press, Los Alamitos
NIST Statistical Test Suit, http://csrc.nist.gov/rng/
Serra, M., Slater, T., Muzio, J.C., Miller, D.M.: Analysis of One Dimensional Cellular Automata and their Aliasing Probabilities. IEEE Trans. on CAD 9(7), 767–778 (1990)
Tomassini, M., Sipper, M., Perrenoud, M.: On the Generation of High-Quality Random Numbers by Two-dimensional Cellular Automata. IEEE Trans. on Computers 49(10), 1146–1151 (2000)
Nandi, S., et al.: Analysis of Periodic and Intermediate Boundary 90/150 Cellular Automata. IEEE Trans. on Computers 45(1), 1–12 (1996)
Hortencius, P.D., McLeod, R.D., Pries, W., Miller, D.M., Card, H.C.: Cellular Automata based Pseudo-random Number Generators for Built-in Self-Test. IEEE Trans. on CAD 8(8), 842–859 (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, S., Chowdhury, D.R. (2008). An Efficient n ×n Boolean Mapping Using Additive Cellular Automata. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-79992-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79991-7
Online ISBN: 978-3-540-79992-4
eBook Packages: Computer ScienceComputer Science (R0)