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

Proposal for a digital pseudorandom number generator

Proposal for a digital pseudorandom number generator

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

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

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:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

A digital hardware implementation of a linear congruential sequence generator using shift and add techniques of multiplication is described. The sequence is of long period, low serial correlation and is rectangularly distributed. The method has certain advantages over conventional feedback shift register techniques.

Inspec keywords: binary sequences; random number generation; combinatorial circuits; bit-slice computers

Other keywords: bit-slice computers; shift add multiplication; digital hardware implementation; long period; digital pseudorandom number generator; low serial correlation; advantages; linear congruential sequence generator; rectangularly distributed

Subjects: Other special applications of computing; Combinatorial switching theory; Logic circuits; Mainframes and minicomputers

References

    1. 1)
      • M.G. Kendall , A. Stuart . (1968) The advanced theory of statistics—Vol. 3.
    2. 2)
      • M.G. Hartley . (1975) , Digital simulation methods.
    3. 3)
      • D.E. Knuth . (1971) The art of computer programming—Vol. 2.
    4. 4)
      • K.D. Tocher . (1963) , The art of simulation.
    5. 5)
      • F. MacWilliams , N. Sloane . Pseudo-random sequences and arrays. Proc. IEEE , 1715 - 1729
    6. 6)
      • H. Pangratz , H. Weinrichter . Pseudo-random number generator based on binary and quinary maximal length sequences. IEEE Trans. , 637 - 642
    7. 7)
      • Lehmer, D.H.: `Mathematical methods in large-scale computing units', Proc. 2nd annual symposium on large-scale digital computing machinery, 1951, Harvard University Press, , p. 141–145.
    8. 8)
      • D.E. Knuth . (1981) , The art of computer programming.
    9. 9)
      • R.R. Coveyou , R.D. Macpherson . Fourier analysis of uniform random number generators. J. Assoc. Comput. Mach. , 1 , 100 - 119
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19840302
Loading

Related content

content/journals/10.1049/el_19840302
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address