https://issues.apache.org/ooo/show_bug.cgi?id=121421
--- Comment #17 from orcmid <[email protected]> --- (In reply to comment #15) > (In reply to comment #13) > > (In reply to comment #12) [ ... ] > > > The algorithm is rather old and thought for 16 bit architectures. There > > > has > > > been a revision in 2007 (which obviously didn't make it into Office > > > 2003). I > > > will update this soon. > > I noticed that too. The maximum periods of the individual IX, IY, and IZ > > series are terribly small. Do you have a reference on any analysis of the > > 2007 version and the rationale for the choice of its parameters? (In this > > case, watching out for multiplication range errors and %-buts will also be > > more important.) > > I found this on the net: > http://www.eurometros.org/file_download.php?file_key=247 > > However I am having two problems: > 1) seeding > 2) It's not working (?). That's a nice paper. I'll see if I can get it working. The explanation is pretty clear, and it identifies the parts of the original that seem pretty suspicious. There is good analysis of what the actual maximum periods are too. The adjustments for 32-bit arithmetic are important. It is also interesting about performance comparisons and the use to generate multiple long sequences that do not correlate. -- You are receiving this mail because: You are on the CC list for the bug. You are the assignee for the bug.
