论文信息 - An efficient and accurate method for computing the invariant measure of piecewise affine chaotic maps

An efficient and accurate method for computing the invariant measure of piecewise affine chaotic maps

In this paper an efficient and accurate method for computing the invariant measure of piecewise affine chaotic maps is proposed. As an application example, the method is used to evaluate for a chaos-based true random bit generator the robustness of the entropy with respect to small map parameters variations.

[1] M. Mackey,et al. Chaos, Fractals, and Noise: Stochastic Aspects of Dynamics , 1998 .

[2] Sergio Callegari,et al. Statistical modeling of discrete-time chaotic processes-basic finite-dimensional tools and applications , 2002, Proc. IEEE.

[3] G. Mazzini,et al. Statistical modeling of discrete-time chaotic processes-basic finite-dimensional tools and applications , 2002, The IEEE International Symposium on Circuits and Systems, 2003. Tutorial Guide: ISCAS 2003..

[4] O. Junge,et al. On the Approximation of Complicated Dynamical Behavior , 1999 .

[5] Massimo Alioto,et al. A feedback strategy to improve the entropy of a chaos-based random bit generator , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6] R. Stephenson. A and V , 1962, The British journal of ophthalmology.

[7] Sergio Callegari,et al. First direct implementation of a true random source on programmable hardware , 2005, Int. J. Circuit Theory Appl..

[8] Tohru Kohda. Information sources using chaotic dynamics , 2001 .

[9] Abraham Boyarsky,et al. Laws of chaos , 1997 .

[10] J. Rogers. Chaos , 1876 .

[11] M. Dellnitz,et al. An adaptive method for the approximation of the generalized cell mapping , 1997 .

[12] Michael C. Mackey,et al. Chaos, Fractals, and Noise , 1994 .