Two aspects of optimum CSK communication: spreading and decoding

Abstract

This paper focuses on the optimization of performance of single-user chaos shift-keying (CSK). More efficient signal transmission is achieved in the coherent case by introducing the class of the so-called deformed circular maps for the generation of spreading. Also, the paired Bernoulli circular spreading (PBCS) is introduced as an optimal choice, which attains the lower bound of bit error rate (BER). As interest shifts to the non-coherent version of the system, attention moves to the receiver end. Maximum likelihood (ML) decoding is utilized serving as an improvement over the correlation decoder. To make the methodology numerically realizable, a Monte Carlo likelihood approach is employed.

Theodore Papamarkou

Professor in maths of data science

Knowing is not enough, one must compute.