The Graph Structure of the Generalized Discrete Arnold's Cat Map

Abstract

Chaotic dynamics is an important source for generating pseudorandom binary sequences (PRBS). Much efforts have been devoted to obtaining period distribution of the generalized discrete Arnold&#x0027;s Cat map in various domains using all kinds of theoretical methods, including Hensel&#x0027;s lifting approach. Diagonalizing the transform matrix of the map, this article gives the explicit formulation of any iteration of the generalized Cat map. Then, its real graph (cycle) structure in any binary arithmetic domain is disclosed. The subtle rules on how the cycles (itself and its distribution) change with the arithmetic precision <inline-formula><tex-math notation="LaTeX">$e$</tex-math><alternatives><mml:math><mml:mi>e</mml:mi></mml:math><inline-graphic xlink:href="li-ieq1-3051387.gif"/></alternatives></inline-formula> are elaborately investigated and proved. The regular and beautiful patterns of Cat map demonstrated in a computer adopting fixed-point arithmetics are rigorously proved and experimentally verified. The results can serve as a benchmark for studying the dynamics of the variants of the Cat map in any domain. In addition, the used methodology can be used to evaluate randomness of PRBS generated by iterating any other maps.