Synchronizing a Chaotic Coder in the Presence of Noise: Evolution of a Set-membership Algorithm Toward a Genetic Algorithm

Using chaotic codes in transmission systems presents many advantages, especially in terms of security, multi-path propagations and multiple accesses. Nevertheless, the main problem of communication with chaos is the design of an experimental and real time synchronization decoder between transmitter and receiver. Even if set-membership algorithm are efficient in real time synchronization of chaotic discrete generators in the presence of noise, these algorithms require a large memory resource. In this paper, we propose an evolution of set-membership algorithm toward genetic algorithm to be implemented into electronic programmable device. The advantage of genetic algorithm compared with set-membership algorithm is that they require a fixed size of memory.