From 0a0e1b397353de3795ee8a3d84f1c61406adbb83 Mon Sep 17 00:00:00 2001 From: couturie Date: Wed, 20 Mar 2013 20:18:23 +0100 Subject: [PATCH] new --- BookGPU/Chapters/chapter18/ch18.tex | 9 +++++++-- 1 file changed, 7 insertions(+), 2 deletions(-) diff --git a/BookGPU/Chapters/chapter18/ch18.tex b/BookGPU/Chapters/chapter18/ch18.tex index fb3b560..7f77d59 100755 --- a/BookGPU/Chapters/chapter18/ch18.tex +++ b/BookGPU/Chapters/chapter18/ch18.tex @@ -492,10 +492,15 @@ These experiments allow us to conclude that it is possible to generate a very large quantity of pseudorandom numbers statistically perfect with the xor-like version. +\section{Summary} - - +In this chapter, a PRNG based on chaotic iterations is presented. It is proven to be +chaotic according to Devaney. Efficient implementations on GPU +using xor-like PRNGs as input generators have shown that a very large quantity +of pseudorandom numbers can be generated per second (about 20Gsamples/s on a Tesla C1060), and +that these proposed PRNGs succeed to pass the hardest battery in TestU01, namely +the BigCrush. -- 2.39.5