Two phase random number generator

• US 5,251,165 A
• Filed: 04/09/1992
• Issued: 10/05/1993
• Est. Priority Date: 04/09/1992
• Status: Expired due to Fees

• Current Assignee: James J. Colin III
• Original Assignee: James J. Colin III
• Inventors: James, J. Colin III
• Primary Examiner(s): Mai, Tan V.
• Application Number:
  US07/865,474
• Time in Patent Office: 544 Days
• Field of Search: 364/717, 364/717.5, 380/46
• US Class Current: 708/250
• CPC Class Codes: G06F 7/582 Pseudo-random number generators

Abstract

A random number generator is shown with a two phase operation, the two phases operating to increase the measured randomness of the numbers generated at very little additional cost. The first phase of operation uses conventional techniques to generate an intermediate random number. This intermediate random number is then used by the second phase to generate two potential final random numbers. One of these is picked to be the resultant random number based on whether a specified bit of the intermediate random number is set.

Claims

1. An apparatus for generating random numbers comprised of

first input register, said first input register specifying a random number seed,

a second input register, said second input register specifying a random number mask,

means to automatically control the number of random numbers to computer,

first means for generating a series of intermediate random numbers coupled to said control means and coupled to said input means, and

second means for generating final random numbers, coupled to said first generating means, each said final random number corresponding to and depending on a different intermediate random number.

2. An apparatus for generating random numbers as specified in claim 1 wherein said apparatus has a third input register, said third input register providing an address of an output array located in computer memory, means for storing said generated final random numbers in said output array utilizing said third input register.

3. An apparatus for generating random numbers as specified in claim 1 wherein said apparatus is attached to a general purpose computer by a bus.

4. An apparatus for generating a series of random numbers comprised of:

first means for generating a series of intermediate random numbers,

an intermediate register receiving each said intermediate random number from said first generating means,

second means for generating a series of final random numbers, coupled to said first generating means, each final random number corresponding to an intermediate random number stored in said intermediate register, and

the generation of each final random number utilizing the corresponding intermediate random number and a history of preceding intermediate random numbers.

5. An apparatus for generating a series of random numbers as described in claim 4 wherein said first generating means includes:

a first register for storing a binary number,

means for storing information representing the number of cycles of operation to be performed,

means for performing a cycle of operations the number of times represented by the information stored in said means for storing,

each said cycle having in the recited order;

means for shifting each bit of the binary number stored in said first register to the next higher order bit position such that the highest order bit is shifted out of said first register,

means for complementing selective predetermined bits of said binary number occupying said first register after each shifting operation, when the bit shifted out of said first register is a predetermined value, and

a second register for storing said bits shifted out of said first register.

6. An apparatus for generating a series of random numbers as described in claim 4 wherein said second generating means for generating each final random numbers includes:

two pointer registers for maintaining a plurality of pointers to a circular array located in computer memory,

means for decrementing the first said pointer register to traverse said array to the left to an extent determined by each said corresponding intermediate random number,

means for incrementing the second said pointer register to traverse said array to the right to an extent determined by each said corresponding intermediate random number,

means for automatically normalizing both said pointer registers to point within said circular array after the first said pointer register has been decremented and the second said pointer register has been incremented,

means for determining whether a specified bit in said intermediate random number is set or clear,

means of indexing said circular array with one of said point registers to determine the final random number that corresponds to said intermediate random number if said specified bit is determined to be set, and

means of indexing said circular array with the other said point register to determine the final random number that corresponds to said intermediate random number if said specified bit is determined to be clear.

7. An apparatus as described in claim 4 wherein said second means for generating each final random numbers includes:

two pointer registers for maintaining a plurality of pointers to a circular array located in computer memory,

means for incrementing said first pointer register to traverse said circular array by an amount determined by each said corresponding intermediate random number,

means for adding a specified amount to an amount determined by each corresponding intermediate random number,

means for incrementing said second pointer register to traverse said array by the amount calculated by said addition,

means for automatically normalizing both said pointer registers to point within said circular array after said two pointer registers have been incremented,

means for automatically determining whether a specified bit in said intermediate random number is set or clear,

first means for indexing said circular array, the amount said first indexing means is indexed depending on one of said pointer registers,

means for determining a first potential random number that corresponds to said intermediate random number, said means for determining a first potential random number utilizing said first indexing means,

second means for indexing said circular array, the amount said second indexing means is indexed depending on the other said pointer registers,

means for determining a second potential random number that corresponds to said intermediate random number, said means for determining a second potential random number depending on said second indexing means, and

means for selecting one said potential random number to be said final random number if said specified bit is set, and selecting the other potential random number to be said final random number if said specified bit is clear.

8. A method for generating a series of random numbers comprising the steps of:

generating a series of intermediate random numbers

storing said intermediate random numbers in an intermediate register and

generating a series of final random numbers,

each said final random number corresponding to one of said intermediate random numbers stored in said intermediate register, and

the generation of each said final random number depending on the corresponding intermediate random number stored in said intermediate register and a history of the intermediate random numbers preceding said corresponding intermediate random number in said series of intermediate random numbers.

9. A method for generating a series of random numbers comprising the steps of:

generating a series of intermediate random numbers, and

generating a series of final random numbers,

each said final random number corresponding to one of said intermediate random numbers, and

the generation of each said final random number depending on the corresponding intermediate random number and a history of the intermediate random numbers preceding said corresponding intermediate random number in said series of intermediate random numbers,

the generating of each said final random numbers including the steps of;

maintaining a first and a second pointer register, each said pointer register addressing locations within a circular array, and each said pointer register being incremented for each final random number,

incrementing said first pointer register to traverse said circular array to the left to an extent determined by said corresponding intermediate random number,

incrementing said second pointer register to traverse said circular array to the right to an extent determined by said corresponding intermediate random number,

normalizing both said pointer registers to address a location in said circular array,

determining a first potential random number by indexing said circular array by one of said pointer registers,

determining a second potential random number by indexing said circular array by the other of said pointer registers, and

selecting one of said potential random numbers to be said final random number if a specified bit in said intermediate random number is set, and to be the other said final random number if said bit is clear.

10. A method for generating a series of random numbers comprising the steps of:

generating a series of intermediate random numbers, and

generating a series of final random numbers,

each said final random number corresponding to one of said intermediate random numbers, and

the generation of each said final random number depending on the corresponding intermediate random number and a history of the intermediate random numbers preceding said corresponding intermediate random number in said series of intermediate random numbers,

the generating of each said final random numbers including the steps of;

maintaining a first and a second pointer register addressing locations within a circular array, each said pointer register being incremented in the same direction for each said final random number,

incrementing said first pointer register by an amount determined by said corresponding intermediate random number,

incrementing said second pointer register by the sum of a specified amount and an amount determined by said corresponding intermediate random number,

normalizing both said pointer registers to address a location in said circular array,

determining a first potential random number by indexing said circular array by one of said pointer registers,

determining a second potential random number by indexing said circular array by the other of said pointer registers, and

selecting one of said potential random numbers to be said final random number if a specified bit in said intermediate random number is set, and to be the other said final random number if said bit is clear.