Hardware implementation of the Lehmer random number generator

A. P. Papliński, N. Bhattacharjee

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)93-95
Number of pages3
JournalIEE Proceedings: Computers and Digital Techniques
Volume143
Issue number1
DOIs
Publication statusPublished - 1 Jan 1996

Keywords

  • Lehman random number generator
  • Matrix

Cite this

Papliński, A. P. ; Bhattacharjee, N. / Hardware implementation of the Lehmer random number generator. In: IEE Proceedings: Computers and Digital Techniques. 1996 ; Vol. 143, No. 1. pp. 93-95.
@article{4e5e41d34d4c4264aa691f086f409bad,
title = "Hardware implementation of the Lehmer random number generator",
abstract = "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.",
keywords = "Lehman random number generator, Matrix",
author = "Papliński, {A. P.} and N. Bhattacharjee",
year = "1996",
month = "1",
day = "1",
doi = "10.1049/ip-cdt:19960100",
language = "English",
volume = "143",
pages = "93--95",
journal = "IEE Proceedings - Computers and Digital Techniques",
issn = "1350-2387",
publisher = "The Institution of Engineering and Technology",
number = "1",

}

Hardware implementation of the Lehmer random number generator. / Papliński, A. P.; Bhattacharjee, N.

In: IEE Proceedings: Computers and Digital Techniques, Vol. 143, No. 1, 01.01.1996, p. 93-95.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Hardware implementation of the Lehmer random number generator

AU - Papliński, A. P.

AU - Bhattacharjee, N.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

KW - Lehman random number generator

KW - Matrix

UR - http://www.scopus.com/inward/record.url?scp=0029732390&partnerID=8YFLogxK

U2 - 10.1049/ip-cdt:19960100

DO - 10.1049/ip-cdt:19960100

M3 - Article

VL - 143

SP - 93

EP - 95

JO - IEE Proceedings - Computers and Digital Techniques

JF - IEE Proceedings - Computers and Digital Techniques

SN - 1350-2387

IS - 1

ER -