Random Number Generators
| dc.contributor.author | Sieben, John Thomas | |
| dc.date.accessioned | 2023-12-19T23:45:50Z | |
| dc.date.available | 2023-12-19T23:45:50Z | |
| dc.date.issued | 1993-05 | |
| dc.description.abstract | This paper is about pseudo-random number generators. In particular it is about pseudo-random number generators for the 16 bit computers. These machines include the IBM PC, XT, and AT. Thus this class comprises a large share of the PC market. The aim of the paper is to find a fast implementation of the prime modulus linear congruential style generator. The paper includes an historical introduction to the subject of random number generators and a discussion of the theoretical foundations for the prime modulus linear congruential generator. Sixteen bit arithmetic is a consequence of the goal of speed and much of the paper is devoted to schemes for dealing with partial results that exceed the available sixteen bits. This paper does not pretend to be the final word on pseudorandom number generators, its goals are much more modest. But within the chosen framework a fast and statistically sound generator is found. | |
| dc.description.department | Computer Science | |
| dc.format | Text | |
| dc.format.extent | 61 pages | |
| dc.format.medium | 1 file (.pdf) | |
| dc.identifier.citation | Sieben, J.T. (1993). Random number generators (Unpublished thesis). Southwest Texas State University, San Marcos, Texas. | |
| dc.identifier.uri | https://hdl.handle.net/10877/17808 | |
| dc.language.iso | en | |
| dc.subject | random number generators | |
| dc.subject | IBM microcomputers | |
| dc.title | Random Number Generators | |
| dc.type | Thesis | |
| thesis.degree.department | Computer Science | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | Southwest Texas State University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science |
Files
Original bundle
1 - 1 of 1