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

摘要

In this research work, we have put an emphasis on the cost effective design approach for high qualitypseudo-random numbers using one dimensional Cellular Automata (CA) overMaximum LengthCA.Thiswork focuses on different complexities e.g., space complexity, time complexity, design complexity andsearching complexity for the generation of pseudo-random numbers in CA. The optimization procedure forthese associated complexities is commonly referred as the cost effective generation approachfor pseudo-random numbers. The mathematical approach for proposed methodology over the existing maximum lengthCA emphasizes on better flexibility to fault coverage. The randomness quality of the generated patterns forthe proposed methodology has been verified using Diehard Tests which reflects that the randomness qualityachieved for proposed methodology is equal to the quality of randomness of the patterns generated by themaximum length cellular automata. The cost effectiveness results a cheap hardwareimplementation for theconcerned pseudo-random pattern generator.Short version of this paper has been published in [1].