Search arXivSearch

arXiv · 1505.02851

Analysis of Network Coding Schemes for Differential Chaos Shift Keying Communication System

Abstract

In this paper we design network coding schemes for Differential Chaos Shift Keying (DCSK) modulation. In this work, non-coherent chaos-based communication system is used due to its simplicity and robustness to multipath propagation effects, while dispensing with any channel state information knowledge at the receiver. We propose a relay network using network coding and DCSK, where we first present a Physical layer Network Coding (PNC) scheme with two users, $\mathcal{A}$ and $\mathcal{B}$, sharing the same spreading code and bandwidth, while synchronously transmitting their signals to the relay node $\mathcal{R}$. We show that the main drawback of this design in multipath channels is the high level of interference in the resultant signal, which severely degrades the system performance. Hence, in order to address this problem, we propose two coding schemes, which separate the users' signals in the frequency or the time domains. We show also in this paper that the performance of the Analog Network Coding (ANC) with DCSK modulation suffers from the same interference problem as the PNC scheme. We present the analytical bit error rate performance for multipath Rayleigh fading channel for the different scenarios and we analyse these schemes in terms of complexity, throughput and link spectral efficiency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Georges Kaddoum, Mohammed El-Hajjar. 2015-05-12. Analysis of Network Coding Schemes for Differential Chaos Shift Keying Communication System. https://arxiv.org/abs/1505.02851

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT