Modelling and Simulation in Engineering
Volume 2021 (2021), Article ID 5511486, 9 pages
https://doi.org/10.1155/2021/5511486

Research Article

Compressive Covariance Sensing-Based Power Spectrum Estimation of Real-Valued Signals Subject to Sub-Nyquist Sampling

Nuha A. S. Alwan

College of Engineering, University of Baghdad, Baghdad 10011, Iraq

Correspondence should be addressed to Nuha A. S. Alwan; nuha.alwan@coeng.uobaghdad.edu.iq

Received 5 January 2021; Revised 30 March 2021; Accepted 2 April 2021; Published 27 April 2021

Academic Editor: Angelos Markopoulos

Copyright © 2021 Nuha A. S. Alwan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

In this work, an estimate of the power spectrum of a real-valued wide-sense stationary autoregressive signal is computed from sub-Nyquist or compressed measurements in additive white Gaussian noise. The problem is formulated using the concepts of compressive covariance sensing and Blackman-Tukey nonparametric spectrum estimation. Only the second-order statistics of the original signal, rather than the signal itself, need to be recovered from the compressed signal. This is achieved by solving the resulting overdetermined system of equations by application of least squares, thereby circumventing the need for applying the complicated -minimization otherwise required for the reconstruction of the original signal. Moreover, the signal need not be spectrally sparse. A study of the performance of the power spectral estimator is conducted taking into account the properties of the different bases of the covariance subspace needed for compressive covariance sensing, as well as different linear sparse rulers by which compression is achieved. A method is proposed to benefit from the possible computational efficiency resulting from the use of the Fourier basis of the covariance subspace without considerably affecting the spectrum estimation performance.

1. Introduction

The efficiency of signal acquisition systems has been greatly improved by the introduction of the concept of compressive sensing (CS) [1]. CS is a technique that enables simultaneous acquisition and compression via sub-Nyquist signal sampling to reduce the costs of data sensing, communications, and storage. The original signal can be recovered by -minimization provided that the signal is spectrally sparse. Reconstruction of second-order statistics from the compressed measurements is possible without the need for the original signal reconstruction and without the condition of spectral sparsity. Such a technique is referred to as compressive covariance sensing (CCS) [2]. Structure information present in the statistical domain is captured during compression such as the common positive semidefinite Hermitian Toeplitz (HT) structure of the signal covariance matrix. This information enables the reconstruction of wide-sense stationary (WSS) signal statistics by CCS, and the technique has been extended to nonstationary signals as well using online CCS [3]. Compression is assumed to be performed using a linear sparse ruler (LSR) [2, 3] that enables subsequent recovery of the Toeplitz covariance matrix by sampling the delays at least once, and the development of the CCS problem leads to an overdetermined system of equations that can be solved by least squares to obtain the covariance values of the original signal.

Many signal processing methods and techniques only require knowledge of second-order statistics of a signal rather than the signal itself. Examples are power spectrum estimation [4], frequency estimation [5, 6], and direction-of-arrival estimation in array signal processing [7]. The power spectrum shows the distribution of signal power as a function of frequency. Power spectrum estimation has many practical applications such as in speech analysis where the estimated spectrum helps determine the formants of the vocal tract, in medical diagnosis and electroencephalography where the estimated spectrum helps in the study of sleep disorders for instance, and also in Doppler radar, seismology, and geophysics. In this work, power spectrum estimation is achieved based on CCS to compute or recover the autocorrelation function (simply referred to as covariance) of a zero-mean discrete-time signal from compressed measurements. Then, the fast Fourier transform (FFT) of the recovered covariance values is taken to find the power spectrum since the latter constitutes a Fourier transform pair with the signal autocorrelation. Recently, CCS has found application in wideband spectrum sensing for cognitive radio (CR) [4, 8–10]. In line with this CR direction, sensing of OFDM signals from sub-Nyquist samples has also been targeted [11]. In CR, the wideband spectrum with subbands is scanned in search of unused bands for transmission exploitation possibilities. Therefore, sensing the power spectrum of the entire frequency band is required. The present work shares many facets of this approach but is more generally directed towards power spectrum estimation of discrete-time signals in which the power spectral density (PSD) estimator is of the type of the standard periodogram and its modified variants [12]. This CCS-related problem can be formulated using covariance matching which, in essence, consists of the estimation of a linearly parameterized covariance matrix from compressed measurements [13, 14]; that is, the covariance matrix is assumed to be a linear combination of a set of HT matrices. The subspace spanned by these constituent matrices is referred to as the covariance subspace, and it captures the structural information needed for covariance reconstruction from the available compressed signal.

Without loss of generality, the signals considered in this paper are assumed to be real-valued. Two different bases for the covariance subspace are employed and tested through simulation to obtain the covariance values of the original signal, and subsequently, Blackman-Tukey spectral estimation is applied to find the power spectrum. Performance is measured in terms of normalized mean square spectrum estimation error. The advantages entailed by using any of the two bases are demonstrated regarding accuracy and computational complexity. A method is introduced that allows a reduction in computational complexity using the Fourier basis without considerably degrading the estimation accuracy. Further, to achieve the highest possible compression, a minimal sparse ruler is used for compression [2], and it is shown that two different minimal sparse rulers affect the CCS process differently albeit with the same compression ratio. A range of several compression ratios is also tested.

Recently, various covariance matrix estimation methods from compressed measurements have been introduced. In [15], an algorithm is proposed to recover covariance matrices of high-dimensional signals from random compressive projections based on the projection gradient method. Similarly, compressive projection principal component analysis (PCA) algorithm has been proposed in [16], and the works in [17, 18] analyzed the effect of introduced bias on covariance matrices by the projection matrix. The above-mentioned compression covariance matrix estimation methods were tested in applications such as hyperspectral imaging [15]. Extending these methods to the context of power spectrum estimation remains a topic for future research. However, it is expected that the present least squares CCS method is more compatible with power spectrum estimation, especially when using the Fourier basis of the covariance subspace which allows the deduction of signal spectral components midway through the computations, thereby reducing the computational burden. Another related work is the implementation of cooperative compressive power spectral estimation [19] exploiting channel diversity to account for received user signal fading in wireless sensor communications. Similar distributed processing methods for power spectral estimation can be found in [20]. The work in [21] proposes a sub-Nyquist wideband spectrum sensing method based on CCS for rapid wideband spectrum sensing that is suitable for fast spectral detection for CR. However, accurate power spectral density estimation is not the primary requirement in this course-grained sensing method.

To the best of the author’s knowledge, the most relevant work in the literature to the present work is the power spectrum estimation method presented in [4] in which an approach to the problem is similarly developed based on sub-Nyquist sampling with no requirement of sparsity constraints. The solution in [4] is found by solving a least squares problem and using an LSR for sampling to achieve two objectives. These are spectrum estimation and spectrum detection, where the latter is common in CR applications. The present work deals only with spectrum estimation and has the following contributions. First, the Blackman-Tukey approach of widowing the covariance is used to achieve more accurate spectrum estimation while implementing least squares CCS. Second, and most importantly, a CCS-related method referred to as the improved alpha-based method is devised whose performance in terms of mean squared estimation error approaches that of the original CCS method and has the advantage of reduced computational complexity.

In order to present the experimental methods used in power spectrum estimation based on CCS, the theory of least squares CCS is first explained.

2. Least Squares Compressed Covariance Sensing (LS-CCS)

In this work, the CCS problem is formulated to recover the covariance of a zero-mean real random signal vector from the vector which is a compressed version of according to

where is the compression or sampling matrix. Typically, and there may be several available realizations of . The compression ratio is given by . We consider sparse compression matrices with at most one nonzero entry, usually of unit value, in each row or column.

The covariance matrix of , containing the second-order statistics, is given by

It is assumed to be a linear combination of generally HT matrices that are elements of the set and can be written as

where are real scalars.

Since the elements of the vector are samples from a WSS process, the positive semidefinite HT structure of allows this compression. The subspace is called the covariance subspace and is a linearly independent set of HT matrices. The elements of constitute a basis for covariance such that the decomposition of Equation (3) is unique and a knowledge of the scalars leads to the determination of . The inequality must be met for to be linearly independent because are HT and are real.

The covariance matrix of the compressed vector is

Substituting Equations (1) and (2) in Equation (4) results in

where

This indicates that is a linear combination of the Hermitian (but not necessarily Toeplitz) matrices in the set .

If compression preserves all relevant information, then is linearly independent and can be found by applying Equation (6) then (5). Thereafter, can be found from Equation (3). However, if compression is strong, the linear independence of may be lost and the covariance of cannot be fully recovered. This method of finding is called covariance matching [13, 14], and it leads to an overdetermined system of equations (represented by Equation (5)) that can be solved by least squares. Since the matrices are , this system of equations has equations and only unknowns, where usually so that it is typically an overdetermined system of equations. The solution is mathematically proved in detail in [2] and by way of a clarifying example in [22]. A flowchart showing the algorithmic steps of the LS-CCS method in sequential order is demonstrated in Figure 1.

Figure 1: Flowchart of the LS-CCS algorithm.

The least squares solution for the estimate of , denoted by , as arrived at in [2], is

Equation (7) mathematically summarizes Figure 1, where the operator denotes the restacking of a vector into a square matrix, is the Kronecker product, and the dagger † denotes the pseudoinverse. The vector is the estimate of which is the vectorization (the reverse process of ) of the matrix , and the matrix has the vectors as its columns. The vectors are the vectorizations of the matrices .

Note that the solution of Equation (7) requires the estimation of the covariance of the compressed signal whose measurements are available. The effect of different estimation methods for the covariance of the compressed signal on the whole CCS process leading to the recovery of is investigated in [22].

2.1. Linear Sparse Ruler (LSR)

The function of the compression matrix in Equation (1) can be explained in terms of a linear sparse ruler. This is a classical problem in number theory. A length-( LSR is a set satisfying the condition that for all lag values between 0 and , there is at least one pair of elements in with the difference between the two elements equal to . It is called a minimal LSR if no other length- LSR has a smaller cardinality [2]. The LSR can be thought of as a ruler with missing marks, and the remaining marks allow all integer distances between 0 and to be measured. As defined before, the compression ratio is . To compare with the operation of the compression matrix , each of the rows of contains a “one” at one of the corresponding marks of the LSR and zeros elsewhere.

2.2. The Toeplitz Covariance Subspace

A Toeplitz matrix is constant along its diagonals. The Toeplitz subspace is the set of all HT matrices, and it is a subspace of over the real scalar field. Two bases will be considered for this subspace, denoted by the sets and [13]. These are given below.

where is the HT matrix with ones on the diagonals and and zeros elsewhere and is the HT matrix with the imaginary unit on the diagonal , the imaginary negative unit on the diagonal , and zeros elsewhere. This basis is called the standard basis.

The other important basis for this subspace is the Fourier basis:

where

Clearly, the number of elements in each of and is .

The following section presents the experimental methods for nonparametric power spectrum estimation based on CCS.

3. Experimental Methods

Nonparametric power spectrum estimation does not require a priori information of the signal model so that the spectral estimation is governed entirely by the observed data. The PSD is the discrete-time Fourier transform (DTFT) of the covariance of the zero-mean signal. The covariance sequence of the -element vector is the first column of the Toeplitz covariance matrix and is given by

To obtain an estimate of the above covariance sequence of the original signal from compressed measurements by applying LS-CCS, we need an estimate of the covariance of the compressed signal as in Equation (7). In [22], three methods of covariance estimation have been tested resulting in the unbiased covariance estimation method giving the best results. However, for spectrum estimation applications, we use the biased covariance estimation given by

where is the number of terms in the sum, is the lag, and .

The estimate of Equation (12), though biased, is preferred over other estimates because it is nonnegative definite in contrast to the unbiased covariance estimate [23, 24]. The original signal covariance estimates are based on the compressed signal covariance estimates through the CCS process. The FFT of the unbiased covariance estimates would exhibit negative values for some frequencies whereas a PSD should be positive for all frequencies. Thus, the unbiased covariance estimate is not related to any possible spectral estimate [24]. In any case, the covariance estimates of small lags are more reliable than those of large lags because the number of summed terms is smaller for the latter covariance values making them less accurate. The Blackman-Tukey method of nonparametric spectrum estimation windows the covariance such that the large-lag values are less weighted. This can be done by applying a Bartlett or triangular window to the CCS-estimated covariance values of the original signal. The Bartlett window is given by

The estimated PSD is found from the DTFT of the estimated covariance:

where is the Blackman-Tukey spectral estimate. In the present work, both the covariance values and the PSD are real and even functions of their respective arguments. Naturally, the window used such as the Bartlett window is also an even function of the lag.

In the simulations, the FFT is taken rather than the DTFT, and zero padding of the covariance values is applied to get a better plot when the FFT values are interpolated. Many realizations of the random signal vector are used to compute the power spectrum and an ensemble average is taken [12].

The above procedure of estimating from by CCS and then applying a Fourier transform is termed compressive power spectrum estimation [13]. A flowchart for the Blackman-Tukey version of this procedure is shown in Figure 2. Constraining the covariance matrix of the original signal to be, in general, HT and positive semidefinite means that the covariance subspace is the Toeplitz subspace. One can employ any of the two bases for this subspace that are explained in Section 2. However, the Fourier basis allows the real scalars to represent the power spectrum at frequencies in a straightforward manner. This Fourier transformation result becomes clear upon inspecting Equation (3) with given by Equation (10). This method will be called the alpha-based method of power spectrum estimation. In this case, there is no need to apply Equation (3) (Step 6 of Figure 1) to find the CCS-estimated covariance matrix from which to find the PSD, which would be the case if the standard basis was used. Thus, the alpha-based method would save multiplications. This computational advantage, however, comes at the expense of lowered performance. The reason is that there is no chance of decreasing the effect of erroneous high-lag covariance values if are taken directly to represent the spectral coefficients.

Figure 2: Flowchart of the CCS-based Blackman-Tukey power spectrum estimation.

In this work, a means to circumvent the lowered performance of the alpha-based method of spectrum estimation is proposed in order to benefit from the ensuing reduced computational complexity. The performance may be improved if the compressed signal estimated covariance is windowed by a Bartlett or triangular window before applying least squares. Figure 3 is a flowchart of the alpha-based and improved alpha-based power spectrum estimation methods. The efficacy of the proposed improved alpha-based method is demonstrated in the following section on results.

Figure 3: Flowchart of the alpha-based and improved alpha-based methods of power spectrum estimation using the Fourier basis for the Toeplitz subspace. The dashed boxes concern the proposed improved alpha-based method.

4. Simulation Results and Discussion

Simulations are carried out in MATLAB. A length-21 real-valued signal vector is taken from a first-order autoregressive random process with parameter -0.8. The autocorrelation function of the process would then be given by . To compress this vector, two length-20 minimal LSRs are first used with compression ratio . The two LSRs are represented by the sets and . Also tested is a third nonminimal LSR which has a higher compression ratio given by and is represented by the set . The compressed vector is made up generally of noisy observations. Zero-mean white Gaussian noise is added to the compressed measurements. The standard deviation (SD) of the added noise is calculated from the required signal-to-noise ratios using

LS-CCS is then applied to recover the original covariance and then compute the estimated power spectrum by applying a FFT operation. The biased method is used for estimating the covariance of the compressed signal, and the estimated original covariance values are windowed by a Bartlett window before computing the spectrum. The number of elements in both the -related covariance and power spectrum vectors is 41 or (). Both the standard and the Fourier bases of the Toeplitz covariance subspace are tested and found to yield identical results when the spectrum in both cases is computed from the estimated or recovered original covariance. The performance criterion for the spectrum estimator implemented is the normalized mean square spectrum error given by

where and are the true and estimated Blackman-Tukey length-41 power spectrum vectors, respectively.

All simulation results (Figures 4–9) were averaged over 20 realizations of the original AR random vector , and for each realization, the results were ensemble-averaged over 1000 runs to account for the noisy compressed observations. Figure 4 shows the NMSE vs. SNR when spectrum estimation is performed by LS-CCS with the three used LSRs. Although and are both minimal LSRs, clearly performs better. Due to the higher compression ratio and hence less compression of , this LSR gives the least NMSE.

Figure 4: Normalized mean square spectrum estimation error NMSE vs. SNR for different LSRs.

Figure 5: Normalized mean square spectrum estimation error NMSE vs. SNR for two methods using the Fourier basis: the alpha-based and the Blackman-Tukey estimation through LS-CCS, and for two different compression ratios: 8/21 () and 11/21 ().

Figure 6: Normalized mean square spectrum estimation error vs. SNR using the Fourier basis and both the simple and improved alpha-based methods, compression ratio is 8/21 ().

(a)

(b)

Figure 7: Normalized mean square spectrum estimation error NMSE vs. compression ratio () for the three methods using the Fourier basis: the alpha-based, the improved alpha-based, and the Blackman-Tukey estimation through LS-CCS.

Figure 8: Estimated power spectrum of the length-21 AR signal using both Nyquist rate and sub-Nyquist rate (). Smoothed spectrum is achieved by zero padding and interpolation. .

Figure 9: True and recovered covariance for the length-21 AR signal with and .

When the Fourier basis is used, the computed can be considered as the spectral components, which is the alpha-based method as discussed in Section 3. However, this results in suboptimal performance when compared with using to recover the covariance and then windowing and taking the FFT. If are taken directly to represent the spectral coefficients, there would be no chance of windowing the covariance values to improve the spectrum estimation. Figure 5 clarifies this issue of lowered performance of the alpha-based method compared to the original LS-CCS method. It is a plot of NMSE vs. SNR for both methods of spectrum estimation using the Fourier basis and for two different compression ratios. It is noticed that when compression is less, that is, a higher compression ratio, the difference between the two approaches to spectrum estimation decreases because, then, become a better representation of the spectral coefficients.

As discussed in Section 3 on experimental methods, the proposed improved alpha-based method is tested and found to give comparable results to the LS-CCS method in addition to its being more computationally efficient. The improved performance stems from windowing the compressed signal estimated covariance by using a Bartlett window as the flowchart of Figure 3 demonstrates. The results of this attempt are shown in Figure 6. It is a plot of NMSE vs. SNR using the Fourier basis and the alpha-based methods with a minimal LSR. The performance is significantly improved when the compressed signal estimated covariance is windowed. However, the method of recovering the original signal covariance is still better. The performance of the improved alpha-based method is expected to increase with higher compression ratios. Figure 7 is a plot of the NMSE vs. compression ratio for the three methods of Blackman-Tukey LS-CCS, the alpha-based method, and the improved alpha-based method all using the Fourier basis and for two noise scenarios: and . The five compression ratios considered in the figure are 8/21, 9/21, 13/21, 15/21, and 19/21. The LSR with ratio 8/21 is used, and then, the larger ratio cases are implemented by randomly adding marks to the LSR. This is the procedure followed in [4] to implement the larger compression ratios. It is clear from the figure that the improved alpha-based method performance compares very well with the original CCS method and guarantees a significant improvement over the simple alpha-based method. The slightly reduced performance of the new method compared to the original CCS method is counterbalanced by the gained advantage of lower computational complexity. As such, the devised method compares favorably with [4] while gaining the advantage of reduced computational burden.

Figure 8 shows the Blackman-Tukey estimated power spectrum from compressed measurements by LS-CCS using the Fourier basis and by original signal covariance recovery. The compression ratio is 11/21 employing the LSR and the SNR is 30 dB. The smooth spectrum is a result of zero padding by 60 zeros and then interpolating. Figure 9 shows the true and recovered original signal covariance values under these conditions.

5. Conclusion

Power spectrum estimation of an AR random signal is achieved from compressed measurements using LS-CCS to recover the signal covariance and compute the Blackman-Tukey spectral estimate. Different compression minimal LSRs with the same compression ratio do not necessarily perform similarly. Standard and Fourier bases of the covariance subspace yield identical performance. When the Fourier base is used, spectrum estimation from the recovered covariance values gave better (less) mean square spectrum estimation error than the alpha-based method at the expense of increased computational complexity. However, the present work proposes an improvement of the latter method by windowing the compressed-signal covariance estimate needed in the LS-CCS process. In terms of mean square spectrum estimation error, the proposed improved alpha-based method has close performance to the method of estimating the spectrum from recovered covariance by LS-CCS and with the additional advantage of reduced computational complexity.

Data Availability

The datasets used in this study are computer-generated. The computer simulation MATLAB code is available from the author on reasonable request.

Conflicts of Interest

The author declares no conflicts of interest in the publication of this paper.

References

E. J. Candes and M. B. Wakin, “An introduction to compressive sampling,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21–30, 2008.

D. Romero, D. D. Ariananda, Z. Tian, and G. Leus, “Compressive covariance sensing: structure-based compressive sensing beyond sparsity,” IEEE Signal Processing Magazine, vol. 33, no. 1, pp. 78–93, 2016.

C. Park and B. Lee, “Online compressive covariance sensing,” Signal Processing, vol. 162, pp. 1–9, 2019.

D. D. Ariananda and G. Leus, “Compressive wideband power spectrum estimation,” IEEE Transactions on Signal Processing, vol. 60, no. 9, pp. 4775–4789, 2012.

J. A. Tropp, J. N. Laska, M. F. Duarte, J. K. Romberg, and R. G. Baraniuk, “Beyond Nyquist: efficient sampling of sparse bandlimited signals,” IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 520–544, 2010.

P. P. Vaidyanathan and P. Pal, “Sparse sensing with co-prime samplers and arrays,” IEEE Transactions on Signal Processing, vol. 59, no. 2, pp. 573–586, 2011.

S. Shakeri, D. D. Ariananda, and G. Leus, “Direction of arrival estimation using sparse ruler array design,” in Proc. IEEE Int. Workshop on Signal Processing Advances in Wireless Communications, pp. 525–529, Cesme, Turkey, 2012.

C. P. Yen, Y. Tsai, and X. Wang, “Wideband spectrum sensing based on sub-Nyquist sampling,” IEEE Transactions on Signal Processing, vol. 61, no. 12, pp. 3028–3040, 2013.

D. Romero and G. Leus, “Wideband spectrum sensing from compressed measurements using spectral prior information,” IEEE Transactions on Signal Processing, vol. 61, no. 24, pp. 6232–6246, 2013.

M. A. Lexa, M. E. Davies, J. S. Thompson, and J. Nikolic, “Compressive power spectral density estimation,” in The 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3884–3887, Prague, Czech Republic, 2011.

S. A. Razavi, M. Valkama, and D. Cabric, “Covariance-based OFDM spectrum sensing with sub-Nyquist samples,” Signal Processing, vol. 109, pp. 261–268, 2015.

V. Ingle, S. Kogon, and D. Manolakis, Statistical and Adaptive Signal Processing, Artech, 2005.

D. Romero, R. Lopez-Valcarce, and G. Leus, “Compression limits for random vectors with linearly parameterized second-order statistics,” IEEE Transactions on Information Theory, vol. 61, no. 3, pp. 1410–1425, 2015.

B. Ottersten, P. Stoica, and R. Roy, “Covariance matching estimation techniques for array signal processing applications,” Digital Signal Processing, vol. 8, no. 3, pp. 185–210, 1998.

J. Monsalve, J. Ramirez, I. Esnaola, and H. Arguello, “Covariance estimation from compressive data partitions using a projected gradient-based algorithm,” 2021, arXiv preprint arXiv:2101.04027.

J. E. Fowler, “Compressive-projection principal component analysis,” IEEE Transactions on Image Processing, vol. 18, no. 10, pp. 2230–2242, 2009.

H. Qi and S. M. Hughes, “Invariance of principal components under low-dimensional random projection of the data,” in 2012 19th IEEE International Conference on Image Processing, pp. 937–940, Orlando, FL, USA, 2012.

F. Pourkamali-Anaraki, “Estimation of the sample covariance matrix from compressive measurements,” IET Signal Processing, vol. 10, no. 9, pp. 1089–1095, 2016.

D. D. Ariananda, D. Romero, and G. Leus, “Cooperative compressive power spectrum estimation,” in 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop (SAM), pp. 97–100, A Coruna, Spain, 2014.

F. Zeng, C. Li, and Z. Tian, “Distributed compressive spectrum sensing in cooperative multihop cognitive networks,” IEEE Journal of Selected Topics in Signal Processing, vol. 5, no. 1, pp. 37–48, 2011.

P. Feng, Y. Bai, Y. Gu, J. Huang, X. Wang, and C. Liu, “A rapid coarse-grained blind wideband spectrum sensing method for cognitive radio networks,” Computer Communications, vol. 166, pp. 234–243, 2021.

N. A. S. Alwan, “Investigation of the effect of different covariance estimation methods on the performance of least squares compressive covariance sensing,” Frontiers in Artificial Intelligence and Applications, vol. 332, pp. 363–373, 2020.

P. M. Djuric, S. M. Kay, K. M. Vijay, and B. W. Douglas, “Spectrum estimation and modeling,” in Digital Signal Processing Handbook, CRC Press LCC, 1999.

P. M. T. Broersen, Automatic Autocorrelation and Spectral Analysis, Springer-Verlag London Limited, 2006.