Search arXivSearch

arXiv · 1711.05417

On the Anti-Jamming Performance of the NR-DCSK System

Abstract

This paper investigates the anti-jamming performance of the NR-DCSK system. We consider several practical jamming environments including broad-band jamming (BBJ), partial-time jamming (PTJ), tone jamming (TJ) consisting of both single-tone and multi-tone, and sweep jamming (SWJ). We first analytically derived the bit error rates of the considered system under the BBJ and the PTJ environments in closed-form expressions. Our derived results show that the system performances under these two jamming environments are enhanced as $P$ increases, where $P$ is the parameter of the NR-DCSK modulation scheme denoting the number of times a chaotic sample is repeated. In addition, our results demonstrate that for the PTJ, the optimal value of the jamming factor is close to zero when the jamming power is small, however, it increases and approaches one as the jamming power enlarges. We then investigate the performance of the considered system under the TJ and the SWJ environments via Monte-Carlo simulations. Our simulations show that single-tone jamming causes a more significant performance degradation than that provided by multi-tone jamming counterparts. Moreover, we point out that the system performance is significantly degraded when the starting frequency of the sweep jammer is close to the carrier frequency of the transmitted chaotic signals, the sweep bandwidth is small, and the sweep time is half of the transmitted bit duration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Binh Van Nguyen, Hyoyoung Jung, Kiseon Kim. 2017-11-15. On the Anti-Jamming Performance of the NR-DCSK System. https://doi.org/10.1155/2018%2F7963641

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