BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Optimal Spreading Sequences for Chaos-Based Communication Systems\
 ; Using CSK as a Case Study - Theodore Papamarkou\, University of Warwick
DTSTART:20071003T130000Z
DTEND:20071003T140000Z
UID:TALK8324@talks.cam.ac.uk
CONTACT:David MacKay
DESCRIPTION:Some higher-order statistical dependency aspects of chaotic sp
 reading sequences used in communication systems are presented. The autocor
 relation function (ACF) of the mean-adjusted squares\, termed the quadrati
 c autocorrelation function\, forms the building block of nonlinear depende
 nce assessment of the family of spreading sequences under investigation. E
 xplicit results are provided for the theoretical lower bound\, the so-call
 ed Fréchet lower bound\, of the quadratic ACF of that family.\n\nThe Pair
 ed 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)
 .\n\nA fundamental and simple chaos-based communication setting is employe
 d throughout the analysis\, namely the single-user coherent Chaos Shift Ke
 ying (CSK) system\, with the prospect of extending the defined techniques 
 under more complicated and applied communication schemes.
LOCATION:LR5\, Engineering\, Department of.
END:VEVENT
END:VCALENDAR