319 research outputs found
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
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
Sensing Throughput Tradeoff for Cognitive Radio Networks with Noise Variance Uncertainty
This paper proposes novel spectrum sensing algorithm, and examines the
sensing throughput tradeoff for cognitive radio (CR) networks under noise
variance uncertainty. It is assumed that there are one white sub-band, and one
target sub-band which is either white or non-white. Under this assumption,
first we propose a novel generalized energy detector (GED) for examining the
target sub-band by exploiting the noise information of the white sub-band,
then, we study the tradeoff between the sensing time and achievable throughput
of the CR network. To study this tradeoff, we consider the sensing time
optimization for maximizing the throughput of the CR network while
appropriately protecting the primary network. The sensing time is optimized by
utilizing the derived detection and false alarm probabilities of the GED. The
proposed GED does not suffer from signal to noise ratio (SNR) wall (i.e.,
robust against noise variance uncertainty) and outperforms the existing signal
detectors. Moreover, the relationship between the proposed GED and conventional
energy detector (CED) is quantified analytically. We show that the optimal
sensing times with perfect and imperfect noise variances are not the same. In
particular, when the frame duration is 2s, and SNR is -20dB, and each of the
bandwidths of the white and target sub-bands is 6MHz, the optimal sensing times
are 28.5ms and 50.6ms with perfect and imperfect noise variances, respectively.Comment: Accepted in CROWNCOM, June 2014, Oulu, Finlan
Compressive Identification of Active OFDM Subcarriers in Presence of Timing Offset
In this paper we study the problem of identifying active subcarriers in an
OFDM signal from compressive measurements sampled at sub-Nyquist rate. The
problem is of importance in Cognitive Radio systems when secondary users (SUs)
are looking for available spectrum opportunities to communicate over them while
sensing at Nyquist rate sampling can be costly or even impractical in case of
very wide bandwidth. We first study the effect of timing offset and derive the
necessary and sufficient conditions for signal recovery in the oracle-assisted
case when the true active sub-carriers are assumed known. Then we propose an
Orthogonal Matching Pursuit (OMP)-based joint sparse recovery method for
identifying active subcarriers when the timing offset is known. Finally we
extend the problem to the case of unknown timing offset and develop a joint
dictionary learning and sparse approximation algorithm, where in the dictionary
learning phase the timing offset is estimated and in the sparse approximation
phase active subcarriers are identified. The obtained results demonstrate that
active subcarrier identification can be carried out reliably, by using the
developed framework.Comment: To appear in the proceedings of the IEEE Global Communications
Conference (GLOBECOM) 201
Compressed sensing based cyclic feature spectrum sensing for cognitive radios
Spectrum sensing is currently one of the most challenging design problems in cognitive radio. A robust spectrum sensing technique is important in allowing implementation of a practical dynamic spectrum access in noisy and interference uncertain environments. In addition, it is desired to minimize the sensing time, while meeting the stringent cognitive radio application requirements. To cope with this challenge, cyclic spectrum sensing techniques have been proposed. However, such techniques require very high sampling rates in the wideband regime and thus are costly in hardware implementation and power consumption. In this thesis the concept of compressed sensing is applied to circumvent this problem by utilizing the sparsity of the two-dimensional cyclic spectrum. Compressive sampling is used to reduce the sampling rate and a recovery method is developed for re- constructing the sparse cyclic spectrum from the compressed samples. The reconstruction solution used, exploits the sparsity structure in the two-dimensional cyclic spectrum do-main which is different from conventional compressed sensing techniques for vector-form sparse signals. The entire wideband cyclic spectrum is reconstructed from sub-Nyquist-rate samples for simultaneous detection of multiple signal sources. After the cyclic spectrum recovery two methods are proposed to make spectral occupancy decisions from the recovered cyclic spectrum: a band-by-band multi-cycle detector which works for all modulation schemes, and a fast and simple thresholding method that works for Binary Phase Shift Keying (BPSK) signals only. In addition a method for recovering the power spectrum of stationary signals is developed as a special case. Simulation results demonstrate that the proposed spectrum sensing algorithms can significantly reduce sampling rate without sacrifcing performance. The robustness of the algorithms to the noise uncertainty of the wireless channel is also shown
- …