• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.264-267
• /
• 2008

Many researchers have studied synthesis method of 90/150 group CA. However, there is a lack of researches for synthesis method of 90/150 nongroup CA. In this paper we report some interesting properties of 90/150 multiple-attractor CA in which all of the cycles are of unit length. 90/150 multiple-attractor CA is a class of nongroup CA. And we propose a construction of 90/150 single-attractor CA. Also we construct 90/150 multiple-attractor CA derived from 90/150 single-attractor CA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.423-426
• /
• 2007

In this paper, we propose an algorithm for finding 90/150 Two Predecessor Nongroup Cellular Automata(TPNCA). Especially, we synthesize TPNCA for the minimal polynomial whose type is of the form xp(x) or x(x+1)p(x) using the proposed algorithm which is useful to study pseudorandom number generation, where p(x) is some primitive polynomial. Also we synthesize Two Predecessor Single Attractor CA and Two Predecessor Multiple Attractor CA which are useful to study hashing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1099-1104
• /
• 2009

Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. While studying the models of systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and becomes to difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we analyze the properties of GF($2^p$) multiplue attractor cellular automata(GF($2^p$) MACA) C and give a method of synthesis of C which is a special class of hierarchical cellular automata proposed as an alternative to solve the problem.