| 摘要 |
PROBLEM TO BE SOLVED: To generate a random number by generating a random progression at all times. SOLUTION: An appropriate initial value xn is substituted to a Bernoulli's map 11 and xn+1 is calculated by using both equations; xn+1 =2xn and xn+1 =2xn -1. The value of xn+1 is defined as '0' in a section [0, 1/2] and '1' in the section [1/2, 1], and the progressions '0' and '1' are generated in a 0/1 conversion part 12. A set of initially generated (e) pieces of the progressions are arranged from left to right and inputted to a shift register 13 in the order of generation. Since the progression inputted to the shift register 13 is a binary number, the binary number is converted to a decimal number in a decimal number conversion part 14 and a first random number is obtained. Thereafter, the generated value of '0' or '1' is added to a right side for the random number, right shifting is performed every time addition is performed, the (e) pieces of the progressions are taken out and the random number is generated. Since the value of the random number obtained in such a manner becomes a non- negative integer whose maximum value is 2<e> , (mod m) is taken, in order to obtain the random number of a positive integer less than an optional positive integer (m). |
