Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1505.03700

Sensing of Unknown Signals over Weibull Fading Conditions

Paschalis C. Sofotasios·Mulugeta K. Fikadu·Khuong Ho-Van·Mikko Valkama
View original source ↗Read source document ↗Export metadata ↓

Abstract

Energy detection is a widely used method of spectrum sensing in cognitive radio and Radio Detection And Ranging (RADAR) systems. This paper is devoted to the analytical evaluation of the performance of an energy detector over Weibull fading channels. This is a flexible fading model that has been shown capable of providing accurate characterization of multipath fading in, e.g., typical cellular radio frequency range of 800${/}$900 MHz. A novel analytic expression for the corresponding average probability of detection is derived in a simple algebraic representation which renders it convenient to handle both analytically and numerically. As expected, the performance of the detector is highly dependent upon the severity of fading as even small variation of the fading parameters affect significantly the value of the average probability of detection. This appears to be particularly the case in severe fading conditions. The offered results are useful in evaluating the effect of multipath fading in energy detection-based cognitive radio communication systems and therefore they can be used in quantifying the associated trade-offs between sensing performance and energy efficiency in cognitive radio networks.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paschalis C. Sofotasios, Mulugeta K. Fikadu, Khuong Ho-Van, Mikko Valkama. 2015-05-14. Sensing of Unknown Signals over Weibull Fading Conditions. https://arxiv.org/abs/1505.03700

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↗