Nazanin Moarefi - Young Researchers Club, Islamic Azad University, Doroud Branch, Doroud, Iran Ali Yarahmadi - Faculty of Engineering-Department of Computer, Islamic Azad University, Boroujerd Branch, Boroujerd, Iran
A cellular automaton is a calculation method which strongly needs high-speed processing of data. In cellular automata, a very large volume of data must be processed in a short time, so that the results of cellular automata can be used. Different methods can be used to implement cellular automata, among which the implementation of cellular automata on serial bases is one of the simplest ones. Two types of implementing cellular automata on a serial base were studied in this paper. In a method of implementation, the whole cells of automata the use the same rule; and in another method, the rule related to cells is different depending on the location. Then, the speed of implementation of the two methods is compared: it was shown that the speed of operations in the serial implementation is independent of cellular automata rule.
Nazanin Moarefi, Ali Yarahmadi, The Implementation of Cellular Automata with Non-identical Rule on Serial Base, Journal of Mathematics and Computer Science, 4 (2012), no. 2, 264--269
Moarefi Nazanin, Yarahmadi Ali, The Implementation of Cellular Automata with Non-identical Rule on Serial Base. J Math Comput SCI-JM. (2012); 4(2):264--269
Moarefi, Nazanin, Yarahmadi, Ali. "The Implementation of Cellular Automata with Non-identical Rule on Serial Base." Journal of Mathematics and Computer Science, 4, no. 2 (2012): 264--269
