-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Use a smaller and faster random number generator.
The previous LFSR generator used a large table to be speedy. The replacement generator is the single stage generator (1) from section 5.4 of [HP2007], requires no tables or extra state. I've run the generator through Rob Brown's extended Dieharder test suite and it passes all but one self-proclaimed buggy test (-d2) and the 2D sphere minimum distance test (-d12). [HP2007] Hars L. and Petruska G., ``Pseudorandom Recursions: Small and Fast Pseurodandom Number Generators for Embedded Applications'', Hindawi Publishing Corporation EURASIP Journal on Embedded Systems Volume 2007, Article ID 98417, 13 pages doi:10.1155/2007/98417 http://www.hindawi.com/getarticle.aspx?doi=10.1155/2007/98417&e=cta
- Loading branch information
M Joonas Pihlaja
authored and
Chris Wilson
committed
Nov 16, 2008
1 parent
a4c5371
commit e44c1f2
Showing
1 changed file
with
11 additions
and
189 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters