Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.13159

New Accurate Approximation for Average Error Probability Under $κ-μ$ Shadowed Fading Channel

Yassine Mouchtak·Faissal El Bouanani
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper proposes new accurate approximations for average error probability (AEP) of a communication system employing either $M$-phase-shift keying (PSK) or differential quaternary PSK with Gray coding (GC-DQPSK) modulation schemes over $κ-μ$ shadowed fading channel. Firstly, new accurate approximations of error probability (EP) of both modulation schemes are derived over additive white Gaussian noise (AWGN) channel. Leveraging the trapezoidal integral method, a tight approximate expression of symbol error probability for $M$-PSK modulation is presented, while new upper and lower bounds for Marcum $Q$-function of the first order (MQF), and subsequently those for bit error probability (BER) under DQPSK scheme, are proposed. Next, these bounds are linearly combined to propose a highly refined and accurate BER's approximation. The key idea manifested in the decrease property of modified Bessel function $I_{v}$, strongly related to MQF, with its argument $v$. Finally, theses approximations are used to tackle AEP's approximation under $κ-μ$ shadowed fading. Numerical results show the accuracy of the presented approximations compared to the exact ones.

Explore related subjects

cs.ITcs.PFmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yassine Mouchtak, Faissal El Bouanani. 2020-09-28. New Accurate Approximation for Average Error Probability Under $κ-μ$ Shadowed Fading Channel. https://arxiv.org/abs/2009.13159

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗