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

Analog‐to‐Digital Conversion for Cognitive Radio: Subsampling, Interleaving, and Compressive Sensing

This chapter explores different analog-to-digital conversion techniques that are suitable to be implemented in cognitive radio receivers. This chapter details the fundamentals, advantages, and drawbacks of three promising techniques: subsampling, interleaving, and compressive sensing. Due to their major maturity, subsampling- and interleaving-based systems are described in further detail, whereas compressive sensing-based systems are described as a complement of the previous techniques for underutilized spectrum applications. The feasibility of these techniques as part of software-defined radio, multistandard, and spectrum sensing receivers is demonstrated by proposing different architectures with reduced complexity at circuit level, depending on the application requirements. Additionally, the chapter proposes different solutions to integrate the advantages of these techniques in a unique analog-to-digital conversion process

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 of Multiband Spectrum towards Real-World Wideband Applications.

PhD Theses.Spectrum scarcity is a major challenge in wireless communication systems with their rapid evolutions towards more capacity and bandwidth. The fact that the real-world spectrum, as a nite resource, is sparsely utilized in certain bands spurs the proposal of spectrum sharing. In wideband scenarios, accurate real-time spectrum sensing, as an enabler of spectrum sharing, can become ine cient as it naturally requires the sampling rate of the analog-to-digital conversion to exceed the Nyquist rate, which is resourcecostly and energy-consuming. Compressive sensing techniques have been applied in wideband spectrum sensing to achieve sub-Nyquist-rate sampling of frequency sparse signals to alleviate such burdens. A major challenge of compressive spectrum sensing (CSS) is the complexity of the sparse recovery algorithm. Greedy algorithms achieve sparse recovery with low complexity but the required prior knowledge of the signal sparsity. A practical spectrum sparsity estimation scheme is proposed. Furthermore, the dimension of the sparse recovery problem is proposed to be reduced, which further reduces the complexity and achieves signal denoising that promotes recovery delity. The robust detection of incumbent radio is also a fundamental problem of CSS. To address the energy detection problem in CSS, the spectrum statistics of the recovered signals are investigated and a practical threshold adaption scheme for energy detection is proposed. Moreover, it is of particular interest to seek the challenges and opportunities to implement real-world CSS for systems with large bandwidth. Initial research on the practical issues towards the real-world realization of wideband CSS system based on the multicoset sampler architecture is presented. In all, this thesis provides insights into two critical challenges - low-complexity sparse recovery and robust energy detection - in the general CSS context, while also looks into some particular issues towards the real-world CSS implementation based on the i multicoset sampler

Wideband Super-resolution Imaging in Radio Interferometry via Low Rankness and Joint Average Sparsity Models (HyperSARA)

We propose a new approach within the versatile framework of convex optimization to solve the radio-interferometric wideband imaging problem. Our approach, dubbed HyperSARA, solves a sequence of weighted nuclear norm and l21 minimization problems promoting low rankness and joint average sparsity of the wideband model cube. On the one hand, enforcing low rankness enhances the overall resolution of the reconstructed model cube by exploiting the correlation between the different channels. On the other hand, promoting joint average sparsity improves the overall sensitivity by rejecting artefacts present on the different channels. An adaptive Preconditioned Primal-Dual algorithm is adopted to solve the minimization problem. The algorithmic structure is highly scalable to large data sets and allows for imaging in the presence of unknown noise levels and calibration errors. We showcase the superior performance of the proposed approach, reflected in high-resolution images on simulations and real VLA observations with respect to single channel imaging and the CLEAN-based wideband imaging algorithm in the WSCLEAN software. Our MATLAB code is available online on GITHUB

Assessment of sub-Nyquist deterministic and random data sampling techniques for operational modal analysis

This paper assesses numerically the potential of two different spectral estimation approaches supporting non-uniform in time data sampling at sub-Nyquist average rates (i.e., below the Nyquist frequency) to reduce data transmission payloads in wireless sensor networks (WSNs) for operational modal analysis (OMA) of civil engineering structures. This consideration relaxes transmission bandwidth constraints in WSNs and prolongs sensor battery life since wireless transmission is the most energy-hungry on-sensor operation. Both the approaches assume acquisition of sub-Nyquist structural response acceleration measurements and transmission to a base station without on-sensor processing. The response acceleration power spectral density matrix is estimated directly from the sub-Nyquist measurements and structural mode shapes are extracted using the frequency domain decomposition algorithm. The first approach relies on the compressive sensing (CS) theory to treat sub-Nyquist randomly sampled data assuming that the acceleration signals are sparse/compressible in the frequency domain (i.e., have a small number of Fourier coefficients with significant magnitude). The second approach is based on a power spectrum blind sampling (PSBS) technique considering periodic deterministic sub-Nyquist “multi-coset” sampling and treating the acceleration signals as wide-sense stationary stochastic processes without posing any sparsity conditions. The modal assurance criterion (MAC) is adopted to quantify the quality of mode shapes derived by the two approaches at different sub-Nyquist compression rates (CRs) using computer-generated signals of different sparsity and field-recorded stationary data pertaining to an overpass in Zurich, Switzerland. It is shown that for a given CR, the performance of the CS-based approach is detrimentally affected by signal sparsity, while the PSBS-based approach achieves MAC>0.96 independently of signal sparsity for CRs as low as 11% the Nyquist rate. It is concluded that the PSBS-based approach reduces effectively data transmission requirements in WSNs for OMA, without being limited by signal sparsity and without requiring a priori assumptions or knowledge of signal sparsity

Methods to reduce perturbation effects in compressive sampling

With compressive sampling (CS), few measurements or samples will be enough for signal reconstruction as long as the signal can be represented in a basis domain and the coefficients are sparse. Fortunately, many signals in nature can be expressed with sparse bases. However, there arise the CS problems of perturbations which can be broadly classified into additive and multiplicative. The additive perturbation such as additive white Gaussian noise (AWGN) inevitably incurs recovery noise in general, but can be more serious if CS is used. Signal power should be sufficiently large compared to the amount of the additive perturbation to apply CS. Simply increasing the signal power, however, may incur additional interference noise if there are multiple signal sources. Furthermore, another serious problems may arise when there exist multiplicative perturbations. Multiplicative perturbation may cause a mismatch between the assumed signal basis and that in the measurements, and as a result, signal-dependent noise is generated. Therefore, boosting of signal power will also increase the noise from the multiplicative perturbation. To use CS, the adverse effects from additive and multiplicative perturbations should be reduced. In this thesis, methods to alleviate the adverse effects from these perturbations are suggested. Firstly, diversified-CS (dCS) method is introduced as a remedy against the additive perturbation of CS. This method will cut down the noise of the recovered signal by extracting diversity gain from given measurements with virtual multiple branches of recovery. Diversity technique is commonly used in a wireless receiver to reduce noise by combining signals from multi-sensors. However, dCS method uses only a single sensor to extract the diversity gain by building virtual branches. This technique is also applied to the applications of spectrum sensing and spherical harmonics reconstruction to demonstrate the noise reduction. Furthermore, simulation results verify dCS method is effective in reducing the recovery noise. Secondly, an iterative basis refinement method is suggested for the reduction of the adverse effects from multiplicative perturbation. This method determines active bases (initially blindly), estimates the mismatch in the identified active bases, and adjusts the bases according to the perturbation. It is applied to the application of CS wireless receiver for the sparse signal acquisition and reconstruction, where the source of the multiplicative perturbation is the Doppler frequency offset introduced by a wireless fading channel. Simulation results corroborate the effectiveness of this algorithm in suppressing the adverse effects of multiplicative perturbations on signal recovery. Although the proposed methods in this thesis are mainly introduced to wireless signal applications, it has a potential to be used in other CS applications that suffer from additive and multiplicative perturbations