Analysis of the digital implementation of a chaotic deterministic-stochastic attractor

In this work the digital implementation of a chaotic system onto a Field Programmable Gate Array (FPGA), is analyzed. Any digital implementation requires the choice of an algorithm to discretize time and a representation standard to represent real numbers. Each choice modifies the stochasticity degree of the system and also defines a different amount of resources on the FPGA. The main contribution of this paper is to study this issue, by comparing different realizations of the same chaotic system. An optimum design methodology for applications in which the chaotic system is going to replace a stochastic system is also reported. This is the case with PRNGs. The stochasticity degree must be measured. In this paper we use the global indicator proposed by Marsaglia in his widely used DIEHARD tests-suite. Results are exemplified for the Lorenz chaotic oscillator but the same methodology may be used with other low dimensional chaotic systems.

[1]  Ljupco Kocarev,et al.  General approach for chaotic synchronization with applications to communication. , 1995, Physical review letters.

[2]  Hilda A. Larrondo,et al.  Zipping Characterization of Chaotic Sequences Used in Spread Spectrum Communication Systems , 2007 .

[3]  A. L. Ruhkin.  Testing Randomness: A Suite of Statistical Procedures , 2001 .

[4]  Ahmed Bouridane,et al.  An FPGA implementation of a Feed-Back Chaotic Synchronization for secure communications , 2010, 2010 7th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP 2010).

[5]  Stephan Mertens,et al.  Entropy of pseudo-random-number generators. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Viktor K. Prasanna,et al.  Analysis of high-performance floating-point arithmetic on FPGAs , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[7]  Hilda A. Larrondo,et al.  Versatile DSP-based chaotic communication system , 2001 .

[8]  O A Rosso,et al.  Quantifiers for randomness of chaotic pseudo-random number generators , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[9]  Ahmed Bouridane,et al.  FPGA implementation of new real-time image encryption based switching chaotic systems , 2009 .

[10]  L. Kocarev,et al.  Pseudorandom bits generated by chaotic maps , 2003 .

[11]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[12]  F Family,et al.  Disorder induced diffusive transport in ratchets. , 2000, Physical review letters.

[14]  Pierre L'Ecuyer,et al.  TestU01: A C library for empirical testing of random number generators , 2006, TOMS.

[15]  Ljupco Kocarev,et al.  Chaos-Based Cryptography - Theory, Algorithms and Applications , 2011, Chaos-Based Cryptography.

[16]  Joan Boyar,et al.  Inferring sequences produced by pseudo-random number generators , 1989, JACM.

[17]  A. Rukhin,et al.  Statistical Testing of Random Number Generators , 1999 .

[18]  Gianluca Mazzini,et al.  Performance of chaos-based asynchronous DS-CDMA with different pulse shapes , 2004, IEEE Communications Letters.

[19]  Ali Miri,et al.  Selected Areas in Cryptography, 14th International Workshop, SAC 2007, Ottawa, Canada, August 16-17, 2007, Revised Selected Papers , 2007, Selected Areas in Cryptography.

[20]  G. Marsaglia,et al.  A New Class of Random Number Generators , 1991 .

[21]  W. F. Wolff,et al.  Transients and asymptotics in granular phase space , 1986 .

[22]  Osvaldo A. Rosso,et al.  Random number generators and causality , 2006 .

[23]  Sergio Callegari,et al.  Chaos-based FM signals: application and implementation issues , 2003 .

[24]  Osvaldo A. Rosso,et al.  Randomizing nonlinear maps via symbolic dynamics , 2008 .