Matrix analysis
Group Properties of Cellular Automata and VLSI Applications
IEEE Transactions on Computers
Parallel Random Number Generation for VLSI Systems Using Cellular Automata
IEEE Transactions on Computers
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
IEEE Transactions on Computers
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Analysis of hybrid group cellular automata
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Behaviors of single attractor cellular automata over galois field GF(2p)
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
New Synthesis of One-Dimensional 90/150 Linear Hybrid Group Cellular Automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Many researchers have been 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 propose an algorithm for finding 90/150 Two Predecessor Cellular Automata. Using the proposed algorithm we analyze 90/150 two predecessor CA. Especially, we analyze 90/150 TPSACA and TPMACA which are useful to study hashing. Also we analyze two types of 90/150 two predecessor CA. One is two predecessor CA for the minimal polynomial whose type is of the form xp(x) which is useful to study two predecessor CA whose depth is 1. Another is two predecessor CA for the minimal polynomial whose type is of the form x(x+ 1) p(x) which is useful to study pseudorandom number generation based on 90/150 two predecessor CA, where p(x) is some primitive polynomial.