Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Simple but effective modification to a multiplicative congruential random-number generator

Simple but effective modification to a multiplicative congruential random-number generator

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A popular form of random-number generator uses the recurrence sk = (ASk−1 mod 2e with A and s0 odd to produce a pseudo-random sequence of integers in the range 0 to 2e − 1. We give a simple modification which increases the guaranteed period by an enormous factor with only a small computational overhead. The recurrence is changed to sk = (Ask−1 + Skn mod 2e where n is such that xn + x + 1 is a primitive binary polynomial. The period is increased from 2e−2 to (2n−1)2e−1. The overhead is an extra addition and the inclusion of a circular buffer of length n.

References

    1. 1)
      • M. Ward . The arithmetical theory of linear recurring series. Transactions of the American Mathematical Society , 600 - 628
    2. 2)
      • , NAG Ltd, Wilkinson House, Jordan Hill Road Oxford, United Kingdom, OX2 8DR, : `NAG', 1988, Vol. 6, Routine G05CAF.
    3. 3)
      • N. Zierler , J. Brillhart . On primitive trinomials (mod 2). Information and Control , 541 - 554
    4. 4)
      • R. Lidl , H. Niederreiter . (1983) , Finite fields.
    5. 5)
      • D.E. Knuth . (1981) , The art of computer programming, Vol 2: Semi-numerical algorithms.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1991.0016
Loading

Related content

content/journals/10.1049/ip-e.1991.0016
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address