JPS5840769B2 - random number generator - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a random number generator, which stores data for generating random numbers, performs a predetermined operation based on the data when a random number is required, generates a random number, and calculates the result of the operation. The present invention relates to a random number generator that holds data for the next random number generation.

The present invention will be described below with respect to a random number generation device that squares held data and holds the center of the result as data again, which is an optimal embodiment of the present invention.
It goes without saying that the present invention is not limited to those that perform such squaring operations, but is also generally applicable to those that perform predetermined operations on held data.

With the recent development of information processing devices, random numbers have become necessary for various purposes, maintenance, performance tests, and the like.

There are methods to obtain random numbers, such as using crystal oscillation or calculating pi, but these methods are difficult to construct, and the calculations are complicated to obtain an extremely large number of random numbers. There were drawbacks.

The most easily used random number is obtained as shown in FIG.

FIG. 1 is a conceptual diagram showing conventional random number generation.

In the figure, 1 is a random number generator, 2 is a random number, 3 is an initial value X (data for generating random numbers) stored in the random number generator 1, and 4 is a circuit for extracting a random number from the data X.

When obtaining a random number, a new X is obtained by performing some calculation on the data The number X is used as the initial value X for obtaining the next random number.

However, using such initial values has the advantage of being able to easily obtain random numbers, but if a large number of random numbers are used, the same X will appear as shown below.
cormorant.

Once the same X appears, the exact same calculation will be repeated, so it can no longer be called a random number.

Let us now assume that the data used to generate random numbers is X, and that it consists of n bits.

Data X for generating random numbers can only take a finite number of states.

Therefore, if random number generation is repeated sufficiently many times, the same state of X will appear.

Since the operation for updating the state of X is constant, once a previously appearing state of X is reproduced once, the sequence of states of X repeats thereafter.

The sequence of random numbers that will be created will also be repeated.

FIG. 2 is a diagram for explaining a conventional example.

In the figure, R1 represents a sequence of consecutively generated random numbers.

Represented as R2...Rk,..., the strings of data X for generating random numbers are Xl, X2... ......X
k, . . . is the result of applying operation g to Xk+lXk, and Rk is the result of applying operation f to Xk.

That is, data X is expressed in a finite number of bits.

If the number of bits is n, there are only 2n possible states of data X.

Therefore, when more than 2n random numbers are successively generated, the same state occurs two or more times in the sequence of X states.

Now, if the four items are the same, then the state of X is X11. X,,+i...X
The score was 12-1 all over again.

Therefore, the random number is also R11゜R11+1...R1
It becomes a repeat of 2-1.

Therefore, an object of the present invention is to provide a random number generator that does not cause repetition as described above even when a large number of random numbers are generated, and that can be realized with a simple circuit.

This purpose consists of a storage unit that stores data for creating random numbers, an arithmetic circuit unit that is connected to the storage unit and performs operations on the contents of the storage unit, and a part or all of the output of the arithmetic circuit unit. A random number generation device that stores in the storage section includes at least a time information means in which time information is stored, and performs a calculation on the contents of the storage section and stores the result in the storage section again. This is achieved by partially including arithmetic processing with the contents of the time series information means.

FIG. 3 is an embodiment of the present invention.

In the figure, 5 is a storage unit that stores data for obtaining random numbers of one word length.

A data register, 6 is a squaring circuit which is an arithmetic circuit that squares the contents of data register 5, 7 is an extraction circuit that extracts the central word length from the output of the squaring circuit, 8 is a time information and extraction circuit 9 is a time information means in which time information is stored; 9 is a time information means storing time information; 1 is an output register that holds the output of the Hz square circuit 6; 11 is a random number; Conversion circuits 1 and 2, which create a decimal number from the data X that is the basis of creation and output the 10's digit as a random number R, are arithmetic circuit units.

Next, the operation will be explained.

When a random number is required, the content X of the register 5 is squared by a squaring circuit 6, and the result is stored in an output register 10.

The central word length among them is outputted by the extraction circuit 7,
The output is given to exclusive OR circuit 8 together with the contents of time register 9.

The output of the exclusive OR circuit 8 is stored in the data register 5, and the contents of this data register 5 are converted by the conversion circuit 11.
It is converted into a decimal number, and the 10th place is output as a random number expressed in decimal number.

In the present invention, since time information is used to create data for generating random numbers, the repetition of random numbers due to repetition of the data as in the past is eliminated.

Furthermore, the above-mentioned time information exists in a normal information processing system, and there is no need to newly provide it.

Even if you add new hardware to obtain this time information, there is no need for accuracy in terms of time, so you can just use a counter that advances with a clock, and only a small amount of hardware is needed. .

Although the embodiment of the present invention has been explained using an example in which data is stored in a register to generate random numbers, one of the storage locations in the main memory device is used as the storage section, and the square circuit is normally used as a squaring circuit. Using the arithmetic circuit of the computer, it is performed logically (by control by a program, etc.) as an extraction circuit, and the time information is also stored in one storage location of the main memory.
Of course, a clock or the like installed outside may also be used.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 shows an overview of conventional random number generation, FIG. 2 shows a process of conventional random number generation, and FIG. 3 shows an embodiment of the present invention. In the figure, 5 is a register which is a storage section, 6 is a square circuit, 7 is an extraction circuit, 8 is an exclusive OR circuit, 9 is a time register for storing time information, an arithmetic circuit, and a circuit section. 12 is

Claims (1)

[Scope of Claims] 1. A storage section that stores data for creating random numbers, an arithmetic circuit section that is connected to the storage section and performs an operation on the contents of the storage section, and one of the outputs of the arithmetic circuit section. A random number generating device that stores part or all of the data in the storage unit is provided with at least time information means for displaying time information, performs an operation on the contents of the storage unit, and stores the result again in the storage unit. Random number generator 0 characterized in that a part of the process of storing the time information means includes arithmetic processing with the contents of the time information means 2 Exclusive logic of the contents of the time information means with respect to the contents of the storage section 2. The random number generation device according to claim 1, further comprising an exclusive OR circuit for performing a sum operation. 3 The arithmetic circuit section connected to the storage section includes a squaring circuit that squares the contents of the storage section, an extraction circuit that extracts a predetermined central length of the output of the squaring circuit, and an output of the extraction circuit. Claim 2, characterized by comprising an exclusive OR circuit that performs an exclusive OR operation with the contents of the time information means.
Random number generator as described in section.