Random number generator
AssigneeInternational Business Machines Corporation
InventorEmanuel Gofman
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorEmanuel Gofman
Estimating the term…
A pseudo random number generator is provided which generates the next number in a pseudo-random sequence of numbers from a binary representation of an input number and a primitive root of a prime number P, where P has the form 2m-1, m being an integer. The binary representations of the current random number and the primitive root are multiplied to form a binary product. The binary number represented by bits 0 to m-1 of the product are added to the binary number represented by bits m to 2m-1 of the product to form a sum. The contents of bit m of the sum are then added to the sum, via the carry-in input of the adder. The next binary number in the sequence is represented by bits 0 to m-1 of the sum with the contents of bit m thereof so added. Particular applications include data processors having an imbedded multiply-add unit with reconfiguration resources to implement the invention.
An apparatus for generating in binary form a pseudo-random number from an input number and a primitive root of a prime number, comprising:
Random number generator for generating the next number in a pseudo-random sequence of numbers from a binary representation of an input number and a primitive root of a prime number P, where P=2.sup.m -1, where m is an integer, the primitive root being represented as a binary number, the random number generator comprising:
Method for generating the next number in a pseudo-random sequence of numbers from a binary representation of an input number and a primitive root of a prime number P, where P=2.sup.m -1, where m is an integer, the primitive root being represented as a binary number, the method comprising:
Dependencies are inferred from the claim text.