Multiplicative linear congruential pseudorandom number generators are a popular choice for many software routines. The paper describes fast hardware implementation of the Lehmer generator which belongs to the above class. First, using the Sylvester resultant matrices it is shown that the algorithm to generate the next random number, which is based on multiplication modM, can be reduced to the problem of addition/subtraction of six appropriately rotated copies of the current random number. Secondly, addition/subtraction of six numbers modM can be performed by means of three carry-save adders, one carry-propagate subtracter, and one carry-propagate adder.
|Number of pages||3|
|Journal||IEE Proceedings - Computers and Digital Techniques|
|Publication status||Published - 1 Jan 1996|
- Lehman random number generator