IDENTIFIABILITY AND IDENTIFICATION OF CHAOTIC SYSTEMS BASED ON ADAPTIVE SYNCHRONIZATION

This paper deals with the problem of synchronization of chaotic system s when the driven (slave, receiver) system has the same structure as t he master (driving, emitter) system but its parameters are unknown. It is shown that the concept of synchronization provides an efficient wa y to find the unknown slave system parameters, Parameter mismatch betw een master and slave systems and high sensitivity of response to chang es of these parameters were so far considered as crucial for security issues, This paper shows evidence that this claimed advantage becomes in face a major drawback in chaos communication schemes since paramete rs can easily he found using adaptive synchronization and optimization tools. The general problem of identifiability of chaotic systems is d efined and discussed in the context of possibilities Far finding the u nknown chaotic receiver parameters, Several typical systems used in ex periments in chaos communication ape tested for identifiability showin g direct applications of the introduced concepts, In particular exampl es of the skew tent map, Henon map, Markov maps and Chua's circuit are considered in detail illustrating the problems of global and local id entifiability.