Search arXivSearch

arXiv · 1707.00324

Efficient Spectrum Availability Information Recovery for Wideband DSA Networks: A Weighted Compressive Sampling Approach

Abstract

Compressive sampling has great potential for making wideband spectrum sensing possible at sub-Nyquist sampling rates. As a result, there have recently been research efforts that leverage compressive sampling to enable efficient wideband spectrum sensing. These efforts consider homogenous wideband spectrum, where all bands are assumed to have similar PU traffic characteristics. In practice, however, wideband spectrum is not homogeneous, in that different spectrum bands could present different PU occupancy patterns. In fact, the nature of spectrum assignment, in which applications of similar types are often assigned bands within the same block, dictates that wideband spectrum is indeed heterogeneous. In this paper, we consider heterogeneous wideband spectrum, and exploit its inherent, block-like structure to design efficient compressive spectrum sensing techniques that are well suited for heterogeneous wideband spectrum. We propose a weighted $\ell_1-$minimization sensing information recovery algorithm that achieves more stable recovery than that achieved by existing approaches while accounting for the variations of spectrum occupancy across both the time and frequency dimensions. In addition, we show that our proposed algorithm requires a lesser number of sensing measurements when compared to the state-of-the-art approaches.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bassem Khalfi, Bechir Hamdaoui, Mohsen Guizani, Nizar Zorba. 2017-07-20. Efficient Spectrum Availability Information Recovery for Wideband DSA Networks: A Weighted Compressive Sampling Approach. https://arxiv.org/abs/1707.00324

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