36,690 research outputs found
Recommended from our members
Layered cellular automata for pseudorandom number generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set formed by the transformation matrix of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L=1,2,3,4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions and in place of the linear function used in the L-LCA. Linear complexity is significantly increased when or is used
Recommended from our members
Permutation and sampling with maximum length CA for pseudorandom number generation
In this paper, we study the effect of dynamic permutation and sampling on the randomness quality of sequences generated by cellular automata (CA). Dynamic permutation and sampling have not been explored in previous CA work and a suitable implementation is shown using a two CA model. Three different schemes that incorporate these two operations are suggested - Weighted Permutation Vector Sampling with Controlled Multiplexing, Weighted Permutation Vector Sampling with Irregular Decimation and Permutation Programmed CA Sampling. The experiment results show that the resulting sequences have varying degrees of improvement in DIEHARD results and linear complexity compared to the CA
A framework for generalized group testing with inhibitors and its potential application in neuroscience
The main goal of group testing with inhibitors (GTI) is to efficiently
identify a small number of defective items and inhibitor items in a large set
of items. A test on a subset of items is positive if the subset satisfies some
specific properties. Inhibitor items cancel the effects of defective items,
which often make the outcome of a test containing defective items negative.
Different GTI models can be formulated by considering how specific properties
have different cancellation effects. This work introduces generalized GTI
(GGTI) in which a new type of items is added, i.e., hybrid items. A hybrid item
plays the roles of both defectives items and inhibitor items. Since the number
of instances of GGTI is large (more than 7 million), we introduce a framework
for classifying all types of items non-adaptively, i.e., all tests are designed
in advance. We then explain how GGTI can be used to classify neurons in
neuroscience. Finally, we show how to realize our proposed scheme in practice
- …