Approximate-optimal detector for chaos communication systems

Chung Ming Lau, Chi Kong Tse

Research output: Journal article publicationJournal articleAcademic researchpeer-review

11 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)1329-1335
Number of pages7
JournalInternational Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Volume13
Issue number5
DOIs
Publication statusPublished - 1 Jan 2003

Keywords

  • Approximate-optimal noncoherent detection
  • Chaos communications

ASJC Scopus subject areas

  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Approximate-optimal detector for chaos communication systems'. Together they form a unique fingerprint.

Cite this