Cost Optimized Design Technique for Pseudo-Random Numbers in Cellular Automata

Mitra, Arnab; Kundu, Anirban
June 2012
International Journal of Advanced Information Technology;Jun2012, Vol. 2 Issue 3, p21
Academic Journal
In this research work, we have put an emphasis on the cost effective design approach for high quality pseudo-random numbers using one dimensional Cellular Automata (CA) over Maximum Length CA. This work focuses on different complexities e.g., space complexity, time complexity, design complexity and searching complexity for the generation of pseudo-random numbers in CA. The optimization procedure for these associated complexities is commonly referred as the cost effective generation approach for pseudorandom numbers. The mathematical approach for proposed methodology over the existing maximum length CA emphasizes on better flexibility to fault coverage. The randomness quality of the generated patterns for the proposed methodology has been verified using Diehard Tests which reflects that the randomness quality achieved for proposed methodology is equal to the quality of randomness of the patterns generated by the maximum length cellular automata. The cost effectiveness results a cheap hardware implementation for the concerned pseudo-random pattern generator. Short version of this paper has been published in [1].


Related Articles

  • Permutation and Complementary Algorithm to Generate Random Sequences for Binary Logic. Jie Wan; Zheng, Jeffrey Z. J. // International Journal of Communications, Network & System Scienc;May2011, Vol. 4 Issue 5, p345 

    Randomness number generation plays a key role in network, information security and IT applications. In this paper, a permutation and complementary algorithm is proposed to use vector complementary and permutation operations to extend n-variable Logic function space from 22n functions to 22n...

  • PERSPECTIVES FOR MONTE CARLO SIMULATIONS ON THE CNN UNIVERSAL MACHINE. ERCSEY-RAVASZ, M.; ROSKA, T.; NÉDA, Z. // International Journal of Modern Physics C: Computational Physics;Jun2006, Vol. 17 Issue 6, p909 

    Possibilities for performing stochastic simulations on the analog and fully parallelized Cellular Neural Network UniversalMachine (CNN-UM) are investigated. By using a chaotic cellular automaton perturbed with the natural noise of the CNN-UM chip, a realistic binary random number generator is...

  • Stochastic Portfolio Selection Using Breeding Swarm Optimization. Moradi, Shahab Mohammad; Khaloozadeh, Hamid; Forghani, Nosratollah // Journal of Applied Sciences;2008, Vol. 8 Issue 11, p2130 

    In this study, the portfolio selection problem is concerned, in case that expected return rates are stochastic variables and the breeding swarm algorithm is applied to solve this problem. The first, the stochastic portfolio model and reliable decision are presented. The second, the global...

  • Effects of Ramps in the Nagel-Schreckenberg Traffic Model. Huang, Ding-Wei // International Journal of Modern Physics C: Computational Physics;Jul2002, Vol. 13 Issue 6, p739 

    We study the effects of on-ramp and off-ramp to the traffic flow in a cellular automaton. The stochastic noise and the extended hopping are included. The phase diagram is obtained. Three distinct phases are observed. The density profiles are analyzed. In the maximum current phase, standing...

  • Bounds and Transformations for Discounted Finite Markov Decision Chains. Porteus, Evan L. // Operations Research;Jul/Aug75, Vol. 23 Issue 4, p761 

    This paper develops new improved bounds on the optimal return function in finite state and action, infinite horizon, discounted stationary Markov decision chains. The bounds are obtained by solving a single-constraint, bounded-variable linear program. They can be used for algorithmic termination...

  • Natural Evolution Strategies. Wierstra, Daan; Schaul, Tom; Glasmachers, Tobias; Yi Sun; Peters, Jan; Schmidhuber, Jürgen // Journal of Machine Learning Research;Mar2014, Vol. 15 Issue 3, p949 

    This paper presents Natural Evolution Strategies (NES), a recent family of black-box optimization algorithms that use the natural gradient to update a parameterized search distribution in the direction of higher expected fitness. We introduce a collection of techniques that address issues of...

  • The berth allocation problem with stochastic vessel handling times. Karafa, Jeffery; Golias, Mihalis; Ivey, Stephanie; Saharidis, Georgios; Leonardos, Nikolaos // International Journal of Advanced Manufacturing Technology;Mar2013, Vol. 65 Issue 1-4, p473 

    In this paper, the berth allocation problem with stochastic vessel handling times is formulated as a bi-objective problem. To solve the resulting problem, an evolutionary algorithm-based heuristic and a simulation-based Pareto front pruning algorithm is proposed. Computational examples show that...

  • Stochastic multi-objective optimization: a survey on non-scalarizing methods. Gutjahr, Walter; Pichler, Alois // Annals of Operations Research;Jan2016, Vol. 236 Issue 2, p475 

    Currently, stochastic optimization on the one hand and multi-objective optimization on the other hand are rich and well-established special fields of Operations Research. Much less developed, however, is their intersection: the analysis of decision problems involving multiple objectives and...

  • MEASURABLE SELECTION AND DYNAMIC PROGRAMMING. Evstigneev, I.V. // Mathematics of Operations Research;Aug76, Vol. 1 Issue 3, p267 

    A general multistage problem of stochastic optimization is studied. It is proved under some simple assumptions that the extremum in the problem is attained. The "Bellman functions" are constructed and a criterion of optimality in terms of these functions is given. The main tools used are...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics