Matched filter detection with dynamic threshold for cognitive radio networks

Fatima Salahdine; Naima Kaabouch; Hassan El Ghazi

doi:10.1109/wincom.2015.7381345

Home/Archive/arXiv

arXiv · 1609.08398

Matched filter detection with dynamic threshold for cognitive radio networks

Fatima Salahdine·Naima Kaabouch·Hassan El Ghazi

View original source ↗Read source document ↗Export metadata ↓

Abstract

-In cognitive radio networks, spectrum sensing aims to detect the unused spectrum channels in order to use the radio spectrum more efficiently. Various methods have been proposed in the past, such as energy, feature detection, and matched filter. These methods are characterized by a sensing threshold, which plays an important role in the sensing performance. Most of the existing techniques used a static threshold. However, the noise is random, and, thus the threshold should be dynamic. In this paper, we suggest an approach with an estimated and dynamic sensing threshold to increase the efficiency of the sensing detection. The matched filter method with dynamic threshold is simulated and its results are compared to those of other existing techniques. Keywords-cognitive radio networks; spectrum sensing; energy detection; matched filter detection; autocorrelation based sensing; estimated dynamic threshold

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Fatima Salahdine, Naima Kaabouch, Hassan El Ghazi. 2016-09-27. Matched filter detection with dynamic threshold for cognitive radio networks. https://doi.org/10.1109/wincom.2015.7381345

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↗