University of Cambridge > Talks.cam > Machine Learning @ CUED > Optimal Spreading Sequences for Chaos-Based Communication Systems; Using CSK as a Case Study

Optimal Spreading Sequences for Chaos-Based Communication Systems; Using CSK as a Case Study

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact David MacKay.

Some higher-order statistical dependency aspects of chaotic spreading sequences used in communication systems are presented. The autocorrelation function (ACF) of the mean-adjusted squares, termed the quadratic autocorrelation function, forms the building block of nonlinear dependence assessment of the family of spreading sequences under investigation. Explicit results are provided for the theoretical lower bound, the so-called Fréchet lower bound, of the quadratic ACF of that family.

The Paired Bernoulli Circular Spreading (PBCS), a method for producing a carrier signal which attains the Fréchet lower bound of -1, is introduced as an optimal spreading technique in terms of its resulting Bit Error Rate (BER).

A fundamental and simple chaos-based communication setting is employed throughout the analysis, namely the single-user coherent Chaos Shift Keying (CSK) system, with the prospect of extending the defined techniques under more complicated and applied communication schemes.

This talk is part of the Machine Learning @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity