285 research outputs found
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
Bayesian compressive sensing framework for spectrum reconstruction in Rayleigh fading channels
Compressive sensing (CS) is a novel digital signal processing technique that has found great interest in
many applications including communication theory and wireless communications. In wireless communications, CS
is particularly suitable for its application in the area of spectrum sensing for cognitive radios, where the complete
spectrum under observation, with many spectral holes, can be modeled as a sparse wide-band signal in the frequency
domain. Considering the initial works performed to exploit the benefits of Bayesian CS in spectrum sensing, the fading
characteristic of wireless communications has not been considered yet to a great extent, although it is an inherent feature
for all sorts of wireless communications and it must be considered for the design of any practically viable wireless system.
In this paper, we extend the Bayesian CS framework for the recovery of a sparse signal, whose nonzero coefficients follow
a Rayleigh distribution. It is then demonstrated via simulations that mean square error significantly improves when
appropriate prior distribution is used for the faded signal coefficients and thus, in turns, the spectrum reconstruction
improves. Different parameters of the system model, e.g., sparsity level and number of measurements, are then varied
to show the consistency of the results for different cases
Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
Spectrum sensing, which aims at detecting spectrum holes, is the precondition
for the implementation of cognitive radio (CR). Collaborative spectrum sensing
among the cognitive radio nodes is expected to improve the ability of checking
complete spectrum usage. Due to hardware limitations, each cognitive radio node
can only sense a relatively narrow band of radio spectrum. Consequently, the
available channel sensing information is far from being sufficient for
precisely recognizing the wide range of unoccupied channels. Aiming at breaking
this bottleneck, we propose to apply matrix completion and joint sparsity
recovery to reduce sensing and transmitting requirements and improve sensing
results. Specifically, equipped with a frequency selective filter, each
cognitive radio node senses linear combinations of multiple channel information
and reports them to the fusion center, where occupied channels are then decoded
from the reports by using novel matrix completion and joint sparsity recovery
algorithms. As a result, the number of reports sent from the CRs to the fusion
center is significantly reduced. We propose two decoding approaches, one based
on matrix completion and the other based on joint sparsity recovery, both of
which allow exact recovery from incomplete reports. The numerical results
validate the effectiveness and robustness of our approaches. In particular, in
small-scale networks, the matrix completion approach achieves exact channel
detection with a number of samples no more than 50% of the number of channels
in the network, while joint sparsity recovery achieves similar performance in
large-scale networks.Comment: 12 pages, 11 figure
Compressive and Noncompressive Power Spectral Density Estimation from Periodic Nonuniform Samples
This paper presents a novel power spectral density estimation technique for
band-limited, wide-sense stationary signals from sub-Nyquist sampled data. The
technique employs multi-coset sampling and incorporates the advantages of
compressed sensing (CS) when the power spectrum is sparse, but applies to
sparse and nonsparse power spectra alike. The estimates are consistent
piecewise constant approximations whose resolutions (width of the piecewise
constant segments) are controlled by the periodicity of the multi-coset
sampling. We show that compressive estimates exhibit better tradeoffs among the
estimator's resolution, system complexity, and average sampling rate compared
to their noncompressive counterparts. For suitable sampling patterns,
noncompressive estimates are obtained as least squares solutions. Because of
the non-negativity of power spectra, compressive estimates can be computed by
seeking non-negative least squares solutions (provided appropriate sampling
patterns exist) instead of using standard CS recovery algorithms. This
flexibility suggests a reduction in computational overhead for systems
estimating both sparse and nonsparse power spectra because one algorithm can be
used to compute both compressive and noncompressive estimates.Comment: 26 pages, single spaced, 9 figure
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
- …