Paired Bernoulli Circular Spreading: Attaining the BER Lower Bound in a CSK Setting

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...

Full description

Saved in:
Bibliographic Details
Published inCircuits, systems, and signal processing Vol. 32; no. 1; pp. 143 - 166
Main Authors Papamarkou, T., Lawrance, A. J.
Format Journal Article
LanguageEnglish
Published Boston SP Birkhäuser Verlag Boston 01.02.2013
Springer Nature B.V
Subjects
Circuits
Circuits and Systems
Density
Electrical Engineering
Electronics and Microelectronics
Engineering
Error analysis
Instrumentation
Invariants
Lower bounds
Optimization
Signal,Image and Speech Processing
Signaling
Simulation
Spreading
Stochastic processes
Users
Optimal spreading
Bit error rate (BER)
CSK communications
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0278-081X
1531-5878
DOI:10.1007/s00034-012-9455-5