This paper considers an extension to the standard framework of cellular automata which implements memory capabilities by featuring cells by elementary rules of its last three states. A study is made of the potential value of elementary cellular automata with elementary memory rules as random number generators. © 2008 World Scientific Publishing Company
International audienceGenerating multiple random numbers in a parallel fashion for scientific simula...
Elementary cellular automata (ECA) are linear arrays of finite-state machines (cells) which take bin...
2noCellular Automata (CA) have a long history being employed as pseudo-random number generators (PRN...
This paper considers an extension to the standard framework of cellular automata which implements me...
To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. ...
Memory is a ubiquitous phenomenon in biological systems, in which the present system state is not en...
Cellular computing represents a new paradigm for implementing high-speed massively parallel machines...
AbstractA 1-dimensional cellular automaton which generates random sequences is discussed. Each site ...
This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular au...
In this research work, we have put an emphasis on the cost effective design approach for high qualit...
International audienceThe study of cellular automata rules suitable for cryptographic applications i...
This paper presents a new approach to designing pseudorandom number generators based on cellular aut...
A novel Cellular Automata (CA) Controllable CA (CCA) is proposed in this paper. Further, CCA are ap...
A random cellular automaton is one in which a cell's behaviour is independent of its previous states...
In this paper we study a hardware efficient implementation of a uniform random number generator base...
International audienceGenerating multiple random numbers in a parallel fashion for scientific simula...
Elementary cellular automata (ECA) are linear arrays of finite-state machines (cells) which take bin...
2noCellular Automata (CA) have a long history being employed as pseudo-random number generators (PRN...
This paper considers an extension to the standard framework of cellular automata which implements me...
To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. ...
Memory is a ubiquitous phenomenon in biological systems, in which the present system state is not en...
Cellular computing represents a new paradigm for implementing high-speed massively parallel machines...
AbstractA 1-dimensional cellular automaton which generates random sequences is discussed. Each site ...
This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular au...
In this research work, we have put an emphasis on the cost effective design approach for high qualit...
International audienceThe study of cellular automata rules suitable for cryptographic applications i...
This paper presents a new approach to designing pseudorandom number generators based on cellular aut...
A novel Cellular Automata (CA) Controllable CA (CCA) is proposed in this paper. Further, CCA are ap...
A random cellular automaton is one in which a cell's behaviour is independent of its previous states...
In this paper we study a hardware efficient implementation of a uniform random number generator base...
International audienceGenerating multiple random numbers in a parallel fashion for scientific simula...
Elementary cellular automata (ECA) are linear arrays of finite-state machines (cells) which take bin...
2noCellular Automata (CA) have a long history being employed as pseudo-random number generators (PRN...
DOI
Add to ORKG