Approximate-optimal detector for chaos communication systems

Recently, an optimal noncoherent detection technique for chaos-shift-keying digital communication system has been proposed. The computational intensity required, however, increases exponentially with the spreading factor. In this Letter, we propose an approximate-optimal detection technique, whose computational effort increases only linearly with the spreading factor. In particular, we use the chaotic sequences generated by a skew tent map as an example to illustrate the approximate-optimal detection method. The bit error performance of the proposed detector is evaluated by computer simulations and the results are compared with those obtained using the optimal detector.