112 research outputs found
Total Variation Minimization Based Compressive Wideband Spectrum Sensing for Cognitive Radios
Wideband spectrum sensing is a critical component of a functioning cognitive
radio system. Its major challenge is the too high sampling rate requirement.
Compressive sensing (CS) promises to be able to deal with it. Nearly all the
current CS based compressive wideband spectrum sensing methods exploit only the
frequency sparsity to perform. Motivated by the achievement of a fast and
robust detection of the wideband spectrum change, total variation mnimization
is incorporated to exploit the temporal and frequency structure information to
enhance the sparse level. As a sparser vector is obtained, the spectrum sensing
period would be shorten and sensing accuracy would be enhanced. Both
theoretical evaluation and numerical experiments can demonstrate the
performance improvement.Comment: 20 pages, 5 figure
Enhanced Compressive Wideband Frequency Spectrum Sensing for Dynamic Spectrum Access
Wideband spectrum sensing detects the unused spectrum holes for dynamic
spectrum access (DSA). Too high sampling rate is the main problem. Compressive
sensing (CS) can reconstruct sparse signal with much fewer randomized samples
than Nyquist sampling with high probability. Since survey shows that the
monitored signal is sparse in frequency domain, CS can deal with the sampling
burden. Random samples can be obtained by the analog-to-information converter.
Signal recovery can be formulated as an L0 norm minimization and a linear
measurement fitting constraint. In DSA, the static spectrum allocation of
primary radios means the bounds between different types of primary radios are
known in advance. To incorporate this a priori information, we divide the whole
spectrum into subsections according to the spectrum allocation policy. In the
new optimization model, the minimization of the L2 norm of each subsection is
used to encourage the cluster distribution locally, while the L0 norm of the L2
norms is minimized to give sparse distribution globally. Because the L0/L2
optimization is not convex, an iteratively re-weighted L1/L2 optimization is
proposed to approximate it. Simulations demonstrate the proposed method
outperforms others in accuracy, denoising ability, etc.Comment: 23 pages, 6 figures, 4 table. arXiv admin note: substantial text
overlap with arXiv:1005.180
Compressive Spectrum Sensing for Cognitive Radio Networks
Spectrum sensing is the most important part in cognitive radios. Wideband spectrum sensing requires high speed and large data samples. It makes sampling process challenging and expensive. In this thesis, we propose wideband spectrum sensing for cognitive radio using compressive sensing to address challenges in sampling and data acquisition during spectrum sensing. Compressive sensing based spectrum sensing for a single network is extended to large frequency overlapping networks and joint reconstruction scheme is developed to enhance the performance at minimal cost. The joint sparsity in large networks is used to improve the compressive sensing reconstruction in large networks. Further, a novel compressive sensing method for binary signal is proposed. Unlike general compressive sensing solution based on optimization process, a simple, reliable and quick compressive sensing method for binary signal using bipartite graph, edge recovery and check-sum method is developed. The proposed models and methods have been verified, proved and compared with existing approaches through numerical analysis and simulations.School of Electrical & Computer Engineerin
Sub-Nyquist Wideband Spectrum Sensing and Sharing
PhDThe rising popularity of wireless services resulting in spectrum shortage has motivated
dynamic spectrum sharing to facilitate e cient usage of the underutilized spectrum.
Wideband spectrum sensing is a critical functionality to enable dynamic spectrum access
by enhancing the opportunities of exploring spectral holes, but entails a major implemen-
tation challenge in compact commodity radios that have limited energy and computation
capabilities. The sampling rates speci ed by the Shannon-Nyquist theorem impose great
challenges both on the acquisition hardware and the subsequent storage and digital sig-
nal processors. Sub-Nyquist sampling was thus motivated to sample wideband signals
at rates far lower than the Nyquist rate, while still retaining the essential information in
the underlying signals.
This thesis proposes several algorithms for invoking sub-Nyquist sampling in wideband
spectrum sensing. Speci cally, a sub-Nyquist wideband spectrum sensing algorithm is
proposed that achieves wideband sensing independent of signal sparsity without sampling
at full bandwidth by using the low-speed analog-to-digital converters based on sparse
Fast Fourier Transform. To lower signal spectrum sparsity while maintaining the channel
state information, the received signal is pre-processed through a proposed permutation
and ltering algorithm. Additionally, a low-complexity sub-Nyquist wideband spectrum
sensing scheme is proposed that locates occupied channels blindly by recovering the sig-
nal support, based on the jointly sparse nature of multiband signals. Exploiting the
common signal support shared among multiple secondary users, an e cient coopera-
tive spectrum sensing scheme is developed, in which the energy consumption on signal
acquisition, processing, and transmission is reduced with the detection performance guar-
antee. To further reduce the computation complexity of wideband spectrum sensing, a
hybrid framework of sub-Nyquist wideband spectrum sensing with geolocation database
is explored. Prior channel information from geolocation database is utilized in the sens-
ing process to reduce the processing requirements on the sensor nodes. The models of
the proposed algorithms are derived and veri ed by numerical analyses and tested on
both real-world and simulated TV white space signals
Compressive Spectrum Sensing Using Sampling-Controlled Block Orthogonal Matching Pursuit
This paper proposes two novel schemes of wideband compressive spectrum
sensing (CSS) via block orthogonal matching pursuit (BOMP) algorithm, for
achieving high sensing accuracy in real time. These schemes aim to reliably
recover the spectrum by adaptively adjusting the number of required
measurements without inducing unnecessary sampling redundancy. To this end, the
minimum number of required measurements for successful recovery is first
derived in terms of its probabilistic lower bound. Then, a CSS scheme is
proposed by tightening the derived lower bound, where the key is the design of
a nonlinear exponential indicator through a general-purpose sampling-controlled
algorithm (SCA). In particular, a sampling-controlled BOMP (SC-BOMP) is
developed through a holistic integration of the existing BOMP and the proposed
SCA. For fast implementation, a modified version of SC-BOMP is further
developed by exploring the block orthogonality in the form of sub-coherence of
measurement matrices, which allows more compressive sampling in terms of
smaller lower bound of the number of measurements. Such a fast SC-BOMP scheme
achieves a desired tradeoff between the complexity and the performance.
Simulations demonstrate that the two SC-BOMP schemes outperform the other
benchmark algorithms.Comment: 15 figures, accepted by IEEE Transactions on Communication
A Comparative Study Of Spectrum Sensing Methods For Cognitive Radio Systems
With the increase of portable devices utilization and ever-growing demand for greater data rates in wireless transmission, an increasing demand for spectrum channels was observed since last decade. Conventionally, licensed spectrum channels are assigned for comparatively long time spans to the license holders who may not over time continuously use these channels, which creates an under-utilized spectrum. The inefficient utilization of inadequate wireless spectrum resources has motivated researchers to look for advanced and innovative technologies that enable an efficient use of the spectrum resources in a smart and efficient manner.
The notion of Cognitive Radio technology was proposed to address the problem of spectrum inefficiency by using underutilized frequency bands in an opportunistic method. A cognitive radio system (CRS) is aware of its operational and geographical surroundings and is capable of dynamically and independently adjust its functioning. Thus, CRS functionality has to be addressed with smart sensing and intelligent decision making techniques. Therefore, spectrum sensing is one of the most essential CRS components. The few sensing techniques that have been proposed are complicated and come with the price of false detection under heavy noise and jamming scenarios. Other techniques that ensure better detection performance are very sophisticated and costly in terms of both processing and hardware.
The objective of the thesis is to study and understand the three of the most basic spectrum sensing techniques i.e. energy detection, correlation based sensing, and matched filter sensing. Simulation platforms were developed for each of the three methods using GNU radio and python interpreted language. The simulated performances of the three methods have been analyzed through several test matrices and also were compared to observe and understand the corresponding strengths and weaknesses. These simulation results provide the understanding and base for the hardware implementation of spectrum sensing techniques and work towards a combined sensing approach with improved sensing performance with less complexity
- …