Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1505.03097

Energy Detection of Unknown Signals over Cascaded Fading Channels

Paschalis C. Sofotasios·Lina Mohjazi·Sami Muhaidat·Mahmoud Al-Qutayri·George K. Karagiannidis
View original source ↗Read source document ↗Export metadata ↓

Abstract

Energy detection is a favorable mechanism in several applications relating to the identification of deterministic unknown signals such as in radar systems and cognitive radio communications. The present work quantifies the detrimental effects of cascaded multipath fading on energy detection and investigates the corresponding performance capability. A novel analytic solution is firstly derived for a generic integral that involves a product of the Meijer $G-$function, the Marcum $Q-$function and arbitrary power terms. This solution is subsequently employed in the derivation of an exact closed-form expression for the average probability of detection of unknown signals over $N$*Rayleigh channels. The offered results are also extended to the case of square-law selection, which is a relatively simple and effective diversity method. It is shown that the detection performance is considerably degraded by the number of cascaded channels and that these effects can be effectively mitigated by a non-substantial increase of diversity branches.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paschalis C. Sofotasios, Lina Mohjazi, Sami Muhaidat, Mahmoud Al-Qutayri, George K. Karagiannidis. 2015-05-12. Energy Detection of Unknown Signals over Cascaded Fading Channels. https://arxiv.org/abs/1505.03097

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↗