|File Search||Catalog||Content Search|
The algorithm itself is described in Matsumoto's article published in ACM Transactions on Modelling and Computer Simulation, Volume 4, Issue 3, 1994, pages 254-266.
This algorithm is similar to the Mersenne Twister algorithm but uses a smaller array to hold state information (25 elements compared to MT's 624). Consequently, the period is much smaller - 2^800-1 versus MT's 2^19937-1. The period of ISAAC is 2^8295 values on average.
TT800(3pm) User Contributed Perl Documentation TT800(3pm) NAME Math::Random::TT800 - Matsumoto's TT800 Pseudorandom number generator DESCRIPTION This perl extension module implements M. Matsumoto's twisted generalized shift register generator called TT800 as described in his article published in ACM Transactions on Modelling and Computer Sim more»
libmath-random-tt800-perl (1.01-2+b2) sid; urgency=low * Binary-only non-maintainer upload for kfreebsd-i386; no source changes. * Rebuild against perl 5.14 -- kfreebsd-i386 Build Daemon (field) <email@example.com> Tue, 15 Nov 2011 05:58:53 +0000 libmath-random-tt800-perl (1.01-2) unstable; urgency=low * This package version fixes unclear licensing with some more»
Revision history for Perl extension Math::(Random)::TT800. 0.01 Sun Mar 30 11:26:24 1997 - original version; created by h2xs 1.16 1.00 Sun Mar 30 17:02:50 MET DST 1997 - finished version. 1.01 Wed Oct 23 17:36:34 CEST 2002 - renamed to Math::Random::TT800 - removed TT800.c vs. tt800.c clash - initial CPAN upload
Format-Specification: http://wiki.debian.org/Proposals/CopyrightFormat?action=recall&rev=196 Ups more»