Chaos Communication Performance: Theory and Computation

In this paper new and existing approaches are developed to compute the bit-error rate for chaos-based communication systems. The multi-user coherent antipodal chaos shift keying system is studied and evaluated in its coherent form, in the sense of perfect synchronisation between transmitted and rece...

Full description

Saved in:
Bibliographic Details
Published in:Circuits, systems, and signal processing systems, and signal processing, 2011-02, Vol.30 (1), p.185-208
Main Authors: Kaddoum, G., Lawrance, Anthony J., Chargé, P., Roviras, D.
Format: Article
Language:English
Subjects:
Approximation
Chaos theory
Circuits and Systems
Coherence
Computation
Computers
Electrical Engineering
Electronics and Microelectronics
Engineering
Error analysis
Gaussian
Instrumentation
Mathematical analysis
Mathematical models
Signal,Image and Speech Processing
Spreads
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper new and existing approaches are developed to compute the bit-error rate for chaos-based communication systems. The multi-user coherent antipodal chaos shift keying system is studied and evaluated in its coherent form, in the sense of perfect synchronisation between transmitted and received chaotic sequences. Transmission is through an additive white Gaussian noise channel. Four methods are interrelated in the paper, three approximate ones and an exact one. The least accurate but most well known is based on simple Gaussian approximation; this is generalised to better reveal its structure. Two accurate and computationally efficient approximate methods are based on conditional Gaussian approximation and the statistical distribution of the typically non-constant bit energy. The most insightful but computationally expensive one is based on exact theory and rests on explicit mathematical results for particular chaotic maps used to spread binary messages. Both upper and lower bounds to the bit-error rate are suggested. The relative advantages of the different approaches are illustrated with plots of bit-error rate against signal to noise ratio.
ISSN:0278-081X
1531-5878
DOI:10.1007/s00034-010-9217-1