Compressive detection of sparse signals in additive white Gaussian noise without signal reconstruction
Introduction
Detection of a sparse signal in additive white Gaussian noise (AWGN) from a small number of compressive measurements without signal reconstruction is an interesting subject that has received recent consideration [3], [11], [16], [2], [17]. This interest arises from a desire to avoid the difficulties caused by reconstructing the original signal for detection. Note that by using compressed sensing, the data rate is greatly reduced, that is, the rate of measurements is much lower than the Nyquist rate. However, if for processing the measurements, one needs to reconstruct the original signal (i.e. reconstruct the Nyquist samples), then the data rate is again very high. In other words, compressed sensing will not be very useful if the Nyquist samples are needed again to be reconstructed in some part of the system, and it is desirable to do the required process (sparse signal detection and parameter estimation) directly based on compressed measurements [4].
To the best of our knowledge, this problem has not yet been modeled using the sparse signal as a random process with an appropriate a priori probability density function (PDF). In [3], [2], [17], the signal is not random and there is no specific property in the signal modeling to express its sparsity. Authors of [16] exploit sparsity by performing the detection for all possible support patterns with fixed size on average. Therefore, the degree of sparsity (or equivalently, the support size) must be known exactly and this is difficult in practice.
In some studies (e.g. [11], [16]), it is assumed that the random signal has a Gaussian PDF, which is not a suitable distribution for modeling sparsity. Here, in contrast to these works, a sparsity-enforcing a priori PDF is assumed for the signal, and a new detection algorithm along with a sparsity degree estimation is proposed.
The paper is organized as follows. In Section 2, the problem of detecting a sparse signal in AWGN is modeled mathematically and a solution is provided for this model. In fact, by using a random model for the sparse signal and assuming that the number of Nyquist samples is large, the distribution of the measurement vector when the signal exits, can be approximated by a Gaussian distribution. This is achieved by using the central limit theorem (CLT). Moreover, since the sparsity degree of the signal is unknown, it is needed to rely on a generalized likelihood ratio test (GLRT) approach. In Section 3, the relationship between the signal to noise ratio (SNR) at the input of the detector and the SNR of the presented detector statistic is studied for high input SNRs. In Section 4, the performance of the proposed estimator for the sparsity degree is investigated and it is shown that the estimator attains the Cramér–Rao lower bound (CRLB), that is, it is an efficient estimator. However, there is no guarantee that the estimated probability of activity is less than 1. Therefore, another estimator is proposed that is guaranteed to estimate this probability less than 1 but it does not attain the CRLB. Nevertheless, the variance of the estimator is close to the CRLB. Finally, Section 5 presents simulation results for detection of the sparse signal and estimation of the degree of sparsity.
Notations: For any vector , its transpose is . For any square matrix , its determinant is denoted by . The probability of an event A is represented by . The expectation and covariance matrix of a random vector are denoted by and , respectively. Moreover, stands for the M×M identity matrix.
Section snippets
Our problem modeling and solution
Detecting a sparse signal in AWGN is mathematically expressed as the hypothesis testing problemwhere is the measurements vector, is the compressed sensing measurement matrix where elements are drawn from a random Gaussian matrix with independent identically distributed (i.i.d.) elements having zero mean and unit variance (it should be noted that at the detector side, the matrix is randomly chosen and then kept fixed), and . Moreover, is the AWGN samples
The SNR of the presented detector
It seems that obtaining a closed form formula for the receiver operating characteristic (ROC) of the presented detector would be too tricky. This is mainly due to the presence of the natural logarithm term in (6). Therefore, as a measure of the detector performance, the relationship between the SNR at the input of the detector and the SNR at the threshold comparison is computed. The signal at the input of the detector is , in which is the signal term and is the noise term. Therefore
Performance evaluation of the sparsity degree estimator
From (3), the proposed estimator for the sparsity degree iswhere . Note that, if the following two parameters are defined as , and , it is clear that and hence, . Theorem 3 The proposed estimator (17) is unbiased and it attains the CRLB of the problem which equals . Proof See Appendix D.
From the above theorem, it is obvious that a small CRLB is obtained for large number
Results and simulations
In this section, seven simulations are conducted to experimentally evaluate the performance of the proposed algorithm for sparse signal detection and sparsity degree estimation. In all of these simulations, the following parameters are fixedIn what follows, for each ROC figure, the area under the curve (AUC) is given in a table (Tables 1–4). Moreover, by the compression ratio (CR) we mean the fraction .
Conclusion
In this paper, it has been shown that the detection of a sparse signal in AWGN and the estimation of its degree of sparsity can be accomplished using compressive measurements without signal reconstruction. In fact, performing the detection and estimation directly in the compressive space allows us to keep the rate of measurements low through all the parts of the digital processing system. Here, the proposed approach for deriving the detector and the estimators is related to the signal sparsity
Acknowledgments
The authors would like to thank anonymous reviewers for their comments and suggestions.
References (17)
- et al.
Bayesian signal detection with compressed measurements
Inf. Sci.
(2014) Bayesian deconvolution of Bernoulli–Gaussian processes
Signal Process.
(1993)- et al.
Sparse deconvolution using adaptive mixed-gaussian models
Signal Process.
(1996) - et al.
Measurement design for detecting sparse signals
Phys. Commun.
(2012) Convergence of Probability Measures
(2013)- et al.
Signal processing with compressive measurements
IEEE J. Sel. Top. Signal Process.
(2010) - et al.
Joint compressive single target detection and parameter estimation in radar without signal reconstruction
IET Radar Sonar Navig.
(2015) Fundamentals of Statistical Signal Processing: Estimation Theory
(1993)
Cited by (44)
Distributed detection of sparse signals with censoring sensors in clustered sensor networks
2022, Information FusionSparse signal detection without reconstruction based on compressive sensing
2019, Signal ProcessingCitation Excerpt :In addition, signal reconstruction algorithms need extra computational burden. Therefore, the problem of compressive detection without signal reconstruction is worth studying [19–36]. In [23–25], a compressive matched filter detection method is proposed based on the distribution of compressive measurements.
Particle swarm optimization performance for fitting of Lévy noise data
2019, Physica A: Statistical Mechanics and its ApplicationsCitation Excerpt :Environmental noise plays a non-negligible role in ecology [1], biology [2], chemistry [3], and physics [4]. Engineering noise affects such fields as signal processing [5], robotics [6], pattern recognition [7], metrology [8], and even financial analysis [9]. In recent decades, researchers focused on theoretical and experimental studies of Gaussian noise.
Distributed Quantized Detection of Sparse Signals Under Byzantine Attacks
2024, IEEE Transactions on Signal Processing