The better pseudo-random number generator derived from the library function rand() in C/C++
Author(s) -
Pushpam Kumar Sinha,
Sonali Sinha
Publication year - 2019
Publication title -
international journal of mathematical sciences and computing
Language(s) - English
Resource type - Journals
eISSN - 2310-9033
pISSN - 2310-9025
DOI - 10.5815/ijmsc.2019.04.02
Subject(s) - randomness , random number generation , random function , convolution random number generator , computer science , generator (circuit theory) , pseudorandom number generator , random permutation , randomness tests , random seed , random variate , set (abstract data type) , algorithm , mathematics , random variable , discrete mathematics , statistics , physics , power (physics) , quantum mechanics , symmetric group , programming language
We choose a better pseudo-random number generator from a list of eight pseudo-random number generators derived from the library function rand() in C/C++, including rand(); i.e. a random number generator which is more random than all the others in the list. rand() is a repeatable pseudo-random number generator. It is called pseudo because it uses a specific formulae to generate random numbers, i.e. to speak the numbers generated are not truly random in strict literal sense. There are available several tests of randomness, some are easy to pass and others are difficult to pass. However we do not subject the eight set of pseudo random numbers we generate in this work to any known tests of randomness available in literature. We use statistical technique to compare these eight set of random numbers. The statistical technique used is correlation coefficient.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom