Cooperative Wideband Spectrum Sensing Based on Joint Sparsity

COOPERATIVE WIDEBAND SPECTRUM SENSING BASED ON JOINT SPARSITY By Ghazaleh Jowkar, Master of Science A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science at Virginia Commonwealth University Virginia Commonwealth University 2017 Major Director: Dr. Ruixin Niu, Associate Professor of Department of Electrical and Computer Engineering In this thesis, the problem of wideband spectrum sensing in cognitive radio (CR) networks using sub-Nyquist sampling and sparse signal processing techniques is investigated. To mitigate multi-path fading, it is assumed that a group of spatially dispersed SUs collaborate for wideband spectrum sensing, to determine whether or not a channel is occupied by a primary user (PU). Due to the underutilization of the spectrum by the PUs, the spectrum matrix has only a small number of non-zero rows. In existing state-of-the-art approaches, the spectrum sensing problem was solved using the low-rank matrix completion technique involving matrix nuclear-norm minimization. Motivated by the fact that the spectrum matrix is not only low-rank, but also sparse, a spectrum sensing approach is proposed based on minimizing a mixed-norm of the spectrum matrix instead of low-rank matrix completion to promote the joint sparsity among the column vectors of the spectrum matrix. Simulation results are obtained, which demonstrate that the proposed mixed-norm minimization approach outperforms the low-rank matrix completion based approach, in terms of the PU detection performance. Further we used mixed-norm minimization model in multi time frame detection. Simulation results shows that increasing the number of time frames will increase the detection performance, however, by increasing the number of time frames after a number of times the performance decrease dramatically

Cyclostationarity Based Sonar Signal Processing

AbstractThis paper presents a reliable method for target vessel identification in passive sonar by exploiting the underlying periodicity of propeller noise signal, using the principles of cyclostationarity. In conventional signal processing methods, random signals are treated as statistically stationary and the parameters of the underlying physical mechanism that generates the signal would not vary in time. However, for most manmade signals, some parameters vary periodically with time and this requires that random signals be modeled as cyclostationary. In the field of sonar, the propeller noise signal generated by underwater vessels is cyclostationary. As a ship propagates in the sea, noise generated during the collapse of cavitation-induced bubbles are modulated by the rotating propeller shaft and this results in characteristic amplitude modulated random noise signal, which can be detected using passive sonar. Processing these signals, the number of blades and the shaft frequency of the propeller can be identified. In this work, cyclostationary processing technique is introduced for processing propeller noise signal and it is observed to provide better noise immunity. A detailed comparison with the conventional DEMON processing is also presented

Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation

We study the problem of single-channel source separation (SCSS), and focus on cyclostationary signals, which are particularly suitable in a variety of application domains. Unlike classical SCSS approaches, we consider a setting where only examples of the sources are available rather than their models, inspiring a data-driven approach. For source models with underlying cyclostationary Gaussian constituents, we establish a lower bound on the attainable mean squared error (MSE) for any separation method, model-based or data-driven. Our analysis further reveals the operation for optimal separation and the associated implementation challenges. As a computationally attractive alternative, we propose a deep learning approach using a U-Net architecture, which is competitive with the minimum MSE estimator. We demonstrate in simulation that, with suitable domain-informed architectural choices, our U-Net method can approach the optimal performance with substantially reduced computational burden

A Linear Subspace Approach to Burst Communication Signal Processing

This dissertation focuses on the topic of burst signal communications in a high interference environment. It derives new signal processing algorithms from a mathematical linear subspace approach instead of the common stationary or cyclostationary approach. The research developed new algorithms that have well-known optimality criteria associated with them. The investigation demonstrated a unique class of multisensor filters having a lower mean square error than all other known filters, a maximum likelihood time difference of arrival estimator that outperformed previously optimal estimators, and a signal presence detector having a selectivity unparalleled in burst interference environments. It was further shown that these improvements resulted in a greater ability to communicate, to locate electronic transmitters, and to mitigate the effects of a growing interference environment

Wideband cyclostationary spectrum sensing and characterization for cognitive radios

Motivated by the spectrum scarcity problem, Cognitive Radios (CRs) have been proposed as a solution to opportunistically communicate over unused spectrum licensed to Primary users (PUs). In this context, the unlicensed Secondary users (SUs) sense the spectrum to detect the presence or absence of PUs, and use the unoccupied bands without causing interference to PUs. CRs are equipped with capabilities such as, learning, adaptability, and recongurability, and are spectrum aware. Spectrum awareness comes from spectrum sensing, and it can be performed using different techniques