X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/blobdiff_plain/cc4c6aa868df1972b090ffcce36c865b8bf53644..850c033d45e9af70be22cb2e0c76a9de99d23c17:/prng_gpu.tex?ds=sidebyside

diff --git a/prng_gpu.tex b/prng_gpu.tex
index bc40b2d..966dbaa 100644
--- a/prng_gpu.tex
+++ b/prng_gpu.tex
@@ -1111,20 +1111,20 @@ new be simply called CIPRNG, or ``the proposed PRNG'', if this statement does no
 raise ambiguity.
 \end{color}
 
-\subsection{Efficient PRNG based on Chaotic Iterations}
+\subsection{Efficient Implementation of a PRNG based on Chaotic Iterations}
 \label{sec:efficient PRNG}
-
-Based on the proof presented in the previous section, it is now possible to 
-improve the speed of the generator formerly presented in~\cite{bgw09:ip,guyeux10}. 
-The first idea is to consider
-that the provided strategy is a pseudorandom Boolean vector obtained by a
-given PRNG.
-An iteration of the system is simply the bitwise exclusive or between
-the last computed state and the current strategy.
-Topological properties of disorder exhibited by chaotic 
-iterations can be inherited by the inputted generator, we hope by doing so to 
-obtain some statistical improvements while preserving speed.
-
+%
+%Based on the proof presented in the previous section, it is now possible to 
+%improve the speed of the generator formerly presented in~\cite{bgw09:ip,guyeux10}. 
+%The first idea is to consider
+%that the provided strategy is a pseudorandom Boolean vector obtained by a
+%given PRNG.
+%An iteration of the system is simply the bitwise exclusive or between
+%the last computed state and the current strategy.
+%Topological properties of disorder exhibited by chaotic 
+%iterations can be inherited by the inputted generator, we hope by doing so to 
+%obtain some statistical improvements while preserving speed.
+%
 %%RAPH : j'ai virÃ© tout ca
 %% Let us give an example using 16-bits numbers, to clearly understand how the bitwise xor operations
 %% are
