pith. sign in

arxiv: 1309.5802 · v2 · pith:3SGC4JODnew · submitted 2013-09-18 · 💻 cs.IT · cs.PF· math.IT

Lower Bound on the BER of a Decode-and-Forward Relay Network Under Chaos Shift Keying Communication System

classification 💻 cs.IT cs.PFmath.IT
keywords chaoticcomputationmodulationperformanceanalysisboundchaoscooperative
0
0 comments X p. Extension
pith:3SGC4JOD Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{3SGC4JOD}

Prints a linked pith:3SGC4JOD badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

This paper carries out the first-ever investigation of the analysis of a cooperative Decode-and-Forward (DF) relay network with Chaos Shift Keying (CSK) modulation. The performance analysis of DF-CSK in this paper takes into account the dynamical nature of chaotic signal, which is not similar to a conventional binary modulation performance computation methodology. The expression of a lower bound bit error rate (BER) is derived in order to investigate the performance of the cooperative system under independently and identically distributed (i.i.d.) Gaussian fading wireless environments. The effect of the non-periodic nature of chaotic sequence leading to a non constant bit energy of the considered modulation is also investigated. A computation approach of the BER expression based on the probability density function of the bit energy of the chaotic sequence, channel distribution, and number of relays is presented. Simulation results prove the accuracy of our BER computation methodology.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.