Paired Bernoulli circular spreading: attaining the BER lower bound in a CSK setting

Abstract

This paper is concerned with the Paired Bernoulli Circular Spreading (PBCS), a way of generating optimal spreading for the single-user coherent chaos shift-keying (CSK) system. PBCS is optimal spreading in the sense that it attains the Bit Error Rate (BER) lower bound of the system, therefore it has a potential engineering impact on the choice of signal carrier in CSK communications. PBCS optimality is justified theoretically and is further demonstrated through BER simulations. The statistical properties of PBCS are of interest too, as it is an invariant stochastic process with a mixed joint density which allows to sample infinitely many points from a circle.

Publication
In Circuits, Systems, and Signal Processing
Theodore Papamarkou
Reader in maths of data science

My research interests span probabilistic machine learning.