APPROXIMATE-OPTIMAL DETECTOR FOR CHAOS COMMUNICATION SYSTEMS

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

8 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)1329-1335
Journal / PublicationInternational Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Volume13
Issue number5
Publication statusPublished - May 2003
Externally publishedYes

Abstract

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.

Research Area(s)

  • Approximate-optimal noncoherent detection, Chaos communications