155 research outputs found
Compressive Spectrum Sensing in Cognitive IoT
PhDWith the rising of new paradigms in wireless communications such as Internet of things
(IoT), current static frequency allocation policy faces a primary challenge of spectrum
scarcity, and thus encourages the IoT devices to have cognitive capabilities to access
the underutilised spectrum in the temporal and spatial dimensions. Wideband spectrum
sensing is one of the key functions to enable dynamic spectrum access, but entails a
major implementation challenge in terms of sampling rate and computation cost since
the sampling rate of analog-to-digital converters (ADCs) should be higher than twice of
the spectrum bandwidth based on the Nyquist-Shannon sampling theorem. By exploiting
the sparse nature of wideband spectrum, sub-Nyquist sampling and sparse signal recovery
have shown potential capabilities in handling these problems, which are directly related
to compressive sensing (CS) from the viewpoint of its origin.
To invoke sub-Nyquist wideband spectrum sensing in IoT, blind signal acquisition with
low-complexity sparse recovery is desirable on compact IoT devices. Moreover, with
cooperation among distributed IoT devices, the complexity of sampling and reconstruc-
tion can be further reduced with performance guarantee. Specifically, an adaptively-
regularized iterative reweighted least squares (AR-IRLS) reconstruction algorithm is
proposed to speed up the convergence of reconstruction with less number of iterations.
Furthermore, a low-complexity compressive spectrum sensing algorithm is proposed to
reduce computation complexity in each iteration of IRLS-based reconstruction algorithm,
from cubic time to linear time. Besides, to transfer computation burden from the IoT
devices to the core network, a joint iterative reweighted sparse recovery scheme with
geo-location database is proposed to adopt the occupied channel information from geo-
location database to reduce the complexity in the signal reconstruction. Since numerous
IoT devices access or release the spectrum randomly, the sparsity levels of wideband spec-trum signals are varying and unknown. A blind CS-based sensing algorithm is proposed
to enable the local secondary users (SUs) to adaptively adjust the sensing time or sam-
pling rate without knowledge of spectral sparsity. Apart from the signal reconstruction
at the back-end, a distributed sub-Nyquist sensing scheme is proposed by utilizing the
surrounding IoT devices to jointly sample the spectrum based on the multi-coset sam-
pling theory, in which only the minimum number of low-rate ADCs on the IoT devices
are required to form coset samplers without the prior knowledge of the number of occu-
pied channels and signal-to-noise ratios. The models of the proposed algorithms are
derived and verified by numerical analyses and tested on both real-world and simulated
TV white space signals
Recommended from our members
A Cognitive Radio Compressive Sensing Framework
With the proliferation of wireless devices and services, allied with further significant predicted growth, there is an ever increasing demand for higher transmission rates. This is especially challenging given the limited availability of radio spectrum, and is further exacerbated by a rigid licensing regulatory regime. Spectrum however, is largely underutilized and this has prompted regulators to promote the concept of opportunistic spectrum access. This allows unlicensed secondary users to use bands which are licensed to primary users, but are currently unoccupied, so leading to more efficient spectrum utilization.
A potentially attractive solution to this spectrum underutilisation problem is cognitive radio (CR) technology, which enables the identification and usage of vacant bands by continuously sensing the radio environment, though CR enforces stringent timing requirements and high sampling rates. Compressive sensing (CS) has emerged as a novel sampling paradigm, which provides the theoretical basis to resolve some of these issues, especially for signals exhibiting sparsity in some domain. For CR-related signals however, existing CS architectures such as the random demodulator and compressive multiplexer have limitations in regard to the signal types used, spectrum estimation methods applied, spectral band classification and a dependence on Fourier domain based sparsity.
This thesis presents a new generic CS framework which addresses these issues by specifically embracing three original scientific contributions: i) seamless embedding of the concept of precolouring into existing CS architectures to enhance signal sparsity for CR-related digital modulation schemes; ii) integration of the multitaper spectral estimator to improve sparsity in CR narrowband modulation schemes; and iii) exploiting sparsity in an alternative, non-Fourier (Walsh-Hadamard) domain to expand the applicable CR-related modulation schemes.
Critical analysis reveals the new CS framework provides a consistently superior and robust solution for the recovery of an extensive set of currently employed CR-type signals encountered in wireless communication standards. Significantly, the generic and portable nature of the framework affords the opportunity for further extensions into other CS architectures and sparsity domains
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 Sensing Over TV White Space in Wideband Cognitive Radio
PhDSpectrum scarcity is an important challenge faced by high-speed wireless communications.
Meanwhile, caused by current spectrum assignment policy, a large portion of
spectrum is underutilized. Motivated by this, cognitive radio (CR) has emerged as one
of the most promising candidate solutions to improve spectrum utilization, by allowing
secondary users (SUs) to opportunistically access the temporarily unused spectrum,
without introducing harmful interference to primary users. Moreover, opening of TV
white space (TVWS) gives us the con dence to enable CR for TVWS spectrum. A crucial
requirement in CR networks (CRNs) is wideband spectrum sensing, in which SUs
should detect spectral opportunities across a wide frequency range. However, wideband
spectrum sensing could lead to una ordably high sampling rates at energy-constrained
SUs. Compressive sensing (CS) was developed to overcome this issue, which enables
sub-Nyquist sampling by exploiting sparse property. As the spectrum utilization is low,
spectral signals exhibit a natural sparsity in frequency domain, which motivates the
promising application of CS in wideband CRNs.
This thesis proposes several e ective algorithms for invoking CS in wideband CRNs.
Speci cally, a robust compressive spectrum sensing algorithm is proposed for reducing
computational complexity of signal recovery. Additionally, a low-complexity algorithm is
designed, in which original signals are recovered with fewer measurements, as geolocation
database is invoked to provide prior information. Moreover, security enhancement issue
of CRNs is addressed by proposing a malicious user detection algorithm, in which data
corrupted by malicious users are removed during the process of matrix completion (MC).
One key spotlight feature of this thesis is that both real-world signals and simulated
signals over TVWS are invoked for evaluating network performance. Besides invoking
CS and MC to reduce energy consumption, each SU is supposed to harvest energy from radio frequency. The proposed algorithm is capable of o ering higher throughput by
performing signal recovery at a remote fusion center
Compressive Sensing and Recovery of Structured Sparse Signals
In the recent years, numerous disciplines including telecommunications, medical imaging, computational biology, and neuroscience benefited from increasing applications of high dimensional datasets. This calls for efficient ways of data capturing and data processing. Compressive sensing (CS), which is introduced as an efficient sampling (data capturing) method, is addressing this need. It is well-known that the signals, which belong to an ambient high-dimensional space, have much smaller dimensionality in an appropriate domain. CS taps into this principle and dramatically reduces the number of samples that is required to be captured to avoid any distortion in the information content of the data. This reduction in the required number of samples enables many new applications that were previously infeasible using classical sampling techniques. Most CS-based approaches take advantage of the inherent low-dimensionality in many datasets. They try to determine a sparse representation of the data, in an appropriately chosen basis using only a few significant elements. These approaches make no extra assumptions regarding possible relationships among the significant elements of that basis. In this dissertation, different ways of incorporating the knowledge about such relationships are integrated into the data sampling and the processing schemes. We first consider the recovery of temporally correlated sparse signals and show that using the time correlation model. The recovery performance can be significantly improved. Next, we modify the sampling process of sparse signals to incorporate the signal structure in a more efficient way. In the image processing application, we show that exploiting the structure information in both signal sampling and signal recovery improves the efficiency of the algorithm. In addition, we show that region-of-interest information can be included in the CS sampling and recovery steps to provide a much better quality for the region-of-interest area compared the rest of the image or video. In spectrum sensing applications, CS can dramatically improve the sensing efficiency by facilitating the coordination among spectrum sensors. A cluster-based spectrum sensing with coordination among spectrum sensors is proposed for geographically disperse cognitive radio networks. Further, CS has been exploited in this problem for simultaneous sensing and localization. Having access to this information dramatically facilitates the implementation of advanced communication technologies as required by 5G communication networks
Sensor Signal and Information Processing II
In the current age of information explosion, newly invented technological sensors and software are now tightly integrated with our everyday lives. Many sensor processing algorithms have incorporated some forms of computational intelligence as part of their core framework in problem solving. These algorithms have the capacity to generalize and discover knowledge for themselves and learn new information whenever unseen data are captured. The primary aim of sensor processing is to develop techniques to interpret, understand, and act on information contained in the data. The interest of this book is in developing intelligent signal processing in order to pave the way for smart sensors. This involves mathematical advancement of nonlinear signal processing theory and its applications that extend far beyond traditional techniques. It bridges the boundary between theory and application, developing novel theoretically inspired methodologies targeting both longstanding and emergent signal processing applications. The topic ranges from phishing detection to integration of terrestrial laser scanning, and from fault diagnosis to bio-inspiring filtering. The book will appeal to established practitioners, along with researchers and students in the emerging field of smart sensors processing
- …