HCA101: A chaotic map based on cellular automata with binary synchronization properties

This paper reviews the properties of a novel chaotic map based on hybrid cellular automata (HCA101-map) and compares them against the widely known logistic map with finite precision implementation, from the perspective of their use as PN-sequences in communication systems. It turns out that our HCA-map is superior in any respect to the logistic map and in addition posses the binary synchronization property allowing to dramatically simplify acquisition circuits needed to reconstruct the phase of the PN-sequence in the receiver.