Journal of Electrical and Computer Engineering

Volume 2013 (2013), Article ID 245867, 12 pages

http://dx.doi.org/10.1155/2013/245867

Research Article

Bayesian Compressive Sensing as Applied to Directions-of-Arrival Estimation in Planar Arrays

Matteo Carlin, Paolo Rocca, Giacomo Oliveri, and Andrea Massa

ELEDIA Research Center @ DISI, University of Trento, Via Sommarive 5, 38123 Trento, Italy

Received 19 May 2013; Accepted 19 June 2013

Academic Editor: Sandra Costanzo

Copyright © 2013 Matteo Carlin et al. 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.

The Bayesian compressive sensing (BCS) is applied to estimate the directions of arrival (DoAs) of narrow-band electromagnetic signals impinging on planar antenna arrangements. Starting from the measurement of the voltages induced at the output of the array elements, the performance of the BCS-based approach is evaluated when data are acquired at a single time instant and at consecutive time instants, respectively. Different signal configurations, planar array geometries, and noise conditions are taken into account, as well.

1. Introduction

In the last few years, we assisted to an extraordinary and still growing development and use of compressive sensing (CS)-based methods [1] in a wide number of applicative contexts such as communications [2], biomedicine [3], radar [4], and microwave imaging [5, 6]. CS has proven to be a very effective resolution tool when the relationship between the problem data and the unknowns is linear, and these latter are sparse (or they can be sparsified) with respect to some representation bases.

In this paper, a probabilistic version of the CS, namely, the Bayesian compressive sensing (BCS) [7], is used for estimating the directions of arrival (DoAs) of electromagnetic signals impinging on an array of sensors in a planar arrangement. Since the DoAs of the incoming signals are few with respect to the whole set of angular directions, they can be modeled as a sparse vector. Accordingly, the estimation problem at hand can be reformulated as the retrieval of such a sparse signal vector whose nonnull entries are related to the unknown angular directions of the signals.

Compared to the state-of-the-art estimation methods (e.g., the multiple signal classification (MUSIC) [8], the signal parameters via rotational invariance technique (ESPRIT) [9], the maximum likelihood (ML) DoAs estimators [10], and the class of techniques based on learning-by-examples (LBE) strategies [11–13]), CS-based approaches have shown several interesting advantages. Likewise LBE-based methods, the computationally expensive calculation of the covariance matrix is not necessary since the voltages measured at the output of the array elements can be directly processed. CS-based methods turn out to be fast and also work with single time-instant (snapshot) data acquisitions. Moreover, unlike MUSIC and ESPRIT that require the incoherence of the impinging signals and a set of measurements larger than the number of signals, careful DoA estimates can be yielded also when the number of arriving signals is greater than the array sensors as well as in the presence of highly correlated sources.

Within the class of CS-based approaches, deterministic strategies recover the signal vector by enforcing the sparsity constraints through the-norm, while the-norm is adopted to quantify the mismatch between measured and estimated data as shown in [14] for the localization of narrowband sources when using a circular array. Hybrid-norm and-norm formulations have been considered [15, 16], as well. Other CS-based methods have been proposed [17–19] also dealing with the DoAs estimation of correlated sources [20]. Unfortunately, common formulations of the CS (i.e., based on deterministic strategies) require a minimum number of measurements equal to twice the number of impinging signals to satisfy the necessary condition for the well posedness of the problem (i.e., the restricted isometry property of the sapling matrix). To overcome such an issue, probabilistic CS-based approaches have been taken into account [21–23] as the one considered in this work.

The outline of the paper is as follows. The DoAs estimation problem, its sparse reformulation, and the BCS-based DoAs estimation approach are presented in Section 2. A selected set of representative numerical results is reported in Section 3 to discuss, in a comparative fashion, the performance of the single and multiple snapshot implementations of the two-dimensional extension of the BCS method [24] for different array architectures. Eventually, some conclusions are drawn (Section 4).

2. Mathematical Formulation

Let us consider a planar antenna array made ofisotropic sensors located on theplane. An unknown set ofsignals, is supposed to impinge on the array from the unknown directions,, beingand. Such signals are modeled as narrowband electromagnetic plane waves (i.e.,,) at the carrier frequency, with () being theth wave vector having amplitude, for all , whereis the free space wavelength.

By modelling the background noise as an additive Gaussian process with zero mean and variance, the phasor voltage measured at theth element is equal to

whereis the measurement time-instant/snapshot andis the noise sample at the same instant. Moreover,

is the open circuit voltage induced by theth impinging wave at theth planar array element located in the position.

The relationship between the measured data (i.e.,,,) and the unknown DoAs [i.e.,,] can be then represented in a compact matrix form as follows:

whereis the complex measurement vector, with denoting the transpose operation, andis the steering vector matrix wherebeing. Moreover, is the signal vector, andis the noise vector.

It is simple to observe that the solution of (3) is neither linear nor sparse with respect to the problem unknowns,, while it is linear versus, for all. In order to apply the BCS to the DoAs estimation in planar arrays, the method in [24] for linear arrays has been exploited and here suitably customized to the dimensionality (2D) at hand.

To reformulate the original problem as a sparse one, the observation domain composed by all angular directionsandis partitioned (Figure 1) in a fine grid ofsamples satisfying the condition. Therefore, the termsandin (3) turn out being equal to

By substituting (4) in (3), the problem is still linear with respect to also, but[unlike] is now sparse since. Accordingly, only few coefficients,are expected to differ from zero and exactly in correspondence with the steering vectorsat the angular directionwhere the wave is estimated to impinge on the array. Accordingly, the original problem of determining the DoAs,,, is reformulated as the estimation of the (sparse) signal vector. The signal DoAs are then retrieved as the directionswhose corresponding signal amplitudesare nonnull.

Figure 1: Sketch of the discretized observation domain forCS-based DoAs estimations.

For single time-instant () acquisitions, the single-task bayesian compressive sensing (ST-BCS) is used, and the sparsest vectoris retrieved by maximizing the posterior probability [24, 25]:

whereis the estimate of the noise power, supposed to be not varying in time, andis the hyperparameter vector [26] enforcing the sparseness of the solutionat theth snapshot. Accordingly, the analytic form of the solution turns out to be

where all terms are real since the BCS works only with real numbers. The signal vector,, has the dimension, and is avector, while

ismatrix, with andbeing the real and imaginary parts, respectively. The two control parameters in (6),and, are obtained through the maximization of the function

by means of the relevance vector machine (RVM). In (6), whereis the identity matrix.

When a set of consecutive snapshots is available, the multitask BCS (MT-BCS) implementation is used to statistically correlate the estimates derived for each snapshot by setting a common hyperparameter vector:, for all . Hence, the final MT-BCS solution is given by [24, 27]:

whereis computed through the RVM maximization of the following function:

whereandandare two user-defined parameters [28].

Although the conditionorusually holds true, the number of nonnull coefficients in either(ST-BCS) or(MT-BCS) could be larger because of the presence of the noise. Hence, the energy thresholding techniques in [24] are exploited to firstly count the number of arriving signals,, and then to estimate the corresponding DoAs. More in detail, the coefficients(or) are firstly sorted according to their magnitude, and then only the firstcoefficients whose cumulative power content is lower than a percentageof the totally received signal power, namely, (or), are preserved. Hence,is selected such that(or).

3. Numerical Results

The planar array BCS-based estimation method is assessed by means of the following analysis devoted to evaluate (a) the performance of its different implementations in correspondence with single snapshot () or multiple-snapshots () acquisitions and (b) the impact of different array configurations. Throughout the numerical assessment, the array elements have been assumed uniformly spaced ofandalong the-axis and-axis, respectively, and all signals have been characterized with the same amplitude,. The measurements have been blurred with an additive Gaussian noise of variancesuch that the resulting signal-to-noise ratio turns out to be

with () being the voltage measured at theth array element in the noiseless case. The angular observation domain (Figure 1) has been partitioned with a uniform grid characterized by a sampling step equal toandalong the elevation and azimuthal direction, respectively. The energy threshold has been set toaccording to [24].

In order to quantify the reliability and the effectiveness of the DoA estimation, the following indexes have been computed. For eachth signal, the location index [13] is defined as

where

andis the maximum admissible error in the DoA retrieval. Since the number of arriving signals is unknown and it is derived from the BCS processing, the global location index has been also evaluated [24]:

whereis the maximum of (12) andSince it is preferred to detect all signals really present in the scenario, although overestimating their number then missing some of them, the penalty is considered only when.

3.1. Single and Multiple Snapshot BCS-Based DoAs Estimation Techniques

Let us consider the fully populated array of Figure 2 withelements, withbeing the number of elements along theandaxes, collecting the data. Several different electromagnetic scenarios have been considered in which,, andsignals are supposed to impinge on the planar array from the directions indicated in Table 1. (In the numerical results, the actual DoAs are chosen lying on the sampling grid of the observation domain. Whether this condition does not hold true, off-grid compensation methods [29, 30], already proposed in the state-of-the-art literature, can be profitably used).

Table 1: Fully populated array—(; ; ;  dB; )—actual DoAs of the impinging signals.

2

4

8
; 

Figure 2: Geometry of the receiving fully populated array ().

The power of the background noise has been set to yield SNR = 10 dB. In order to test the behavior of the ST-BCS and the MT-BCS, the simulation for each signal configuration has been repeatedtimes, while varying the noise samples on the data. The DoAs estimation error has been therefore evaluated through the average location index defined as

with being computed as in (14).

As for the ST-BCS, a single snapshot has been processed each time (). Figure 3 shows the best (Figure 3—left column) and the worst (Figure 3—right column) solutions in terms of minimum () and maximum () location errors, respectively, among the DoAs estimations carried out when (Figures 3(a) and 3(b)), (Figures 3(c) and 3(d)), and(Figures 3(e) and 3(f)). In Figure 3, the actual DoAs are denoted with a point at the center of a circle, while the color points indicate the estimated signal locations and amplitudes. For the sake of clarity, the retrieved DoAs are also reported in Table 2 where the number of estimated signals is given, as well. As it can be observed, the strength of the estimated signals is different (Figure 3), even though they impinge on the antenna with the same energy because of the presence of the noise. On the other hand, the DoAs are predicted with a high degree of accuracy whenandas confirmed by the values of the location error (Table 3). As a matter of fact, the error values are low also for the worst solutions among thetrials (i.e.,and). It is worth also noting that forthe location error is small even though the numbers of detected signals are greater than the actual ones () because two signals have very close DoAs (as compared to the sampling stepsand). However, if the ST-BCS shows being robust and accurate in such scenarios (and), it is not able to correctly locate the actual DoAs when the number of signals increases to (Figures 3(e) and 3(f)—Table 2). Indeed, the location error significantly increases as indicated by the indexes in Table 3.

Table 2: Fully populated array—(; ; ;  dB; ; )—values of the DoAs for the best and worst estimation obtained by means of the ST-BCS among the different noisy scenarios.

2
2

4
4

8
7

2
3

4
4

8
4

Table 3: Fully populated array—(; ; ;  dB; ; )—statistics (minimum, maximum, average, and variance) of the location index among different noisy scenarios when using the () and the ().

[sec]

2

4

8

2

4

8

(a)

(b)

(c)

(d)

(e)

(f)

Figure 3: Fully populated array—(; ;; SNR = 10 dB;;)—plot of the best (left column) and worst (right column) estimations obtained by means of the ST-BCS among thedifferent noisy scenarios when (a) (b) , (c) (d) , and (e) (f) .

As for the computational efficiency, the ST-BCS is able to perform the DoAs estimation in a limited CPU time (—Table 3) (the simulations have been run using a standard processing unit (i.e., 2.4 GHz PC with 2 GB of RAM) with a nonoptimized code) also thanks to the single-snapshot processing. In order to investigate the effects of the SNR on the DoAs estimation capabilities of the ST-BCS, the SNR has been varied from −5 dB up to 30 dB with a step of 5 dB, while keeping the same DoAs of Table 1. In Figure 4, the values of the average location index are reported. As it can be noticed, the location indexforandmonotonically decreases, as one should expect, with the increment of the SNR. However, the ST-BCS estimates when turn out to be still nonreliable also for higher SNR confirming the difficulty of dealing with such a complex scenario just processing one snapshot.

Figure 4: Fully populated array—(;;; SNRdB;;)—behavior of the location indexaveraged amongdifferent noisy scenarios versus the SNR when using the ST-BCS.

Let us now analyze the MT-BCS behavior. Firstly, the same problems addressed by means of the ST-BCS in Figure 3 are considered by taking into account onlysnapshots. The best and worst MT-BCS results are reported in Figure 5, and the corresponding DoAs are given in Table 4. Unlike the ST-BCS (Table 2) the number of impinging signals is always correctly identified in the best case (Figure 5—left column), while in the worst case (Figure 5—right column),only when and signals. As a matter of fact, the average location error whenis still high (). The use of onlysnapshots does not guarantee reliable performance also with the MT-BCS, even though the advantages in terms of accuracy of the MT-BCS over the ST-BCS are nonnegligible as pointed out by the values in Table 3. On the opposite, the computational cost of the MT-BCS is higher than that of the ST-BCS (Table 3).

Table 4: Fully populated array—(; ; ;  dB; ; )—values of the DoAs for the best and worst estimation obtained by means of the MT-BCS among the different noisy scenarios.

2

4

8

2

4

8

(a)

(b)

(c)

(d)

(e)

(f)

Figure 5: Fully populated array—(;;; SNR = 10 dB;;)—plot of the best (left column) and worst (right column) estimations obtained by means of theMT-BCSamong thedifferent noisy scenarios when(a) (b),(c) (d), and(e) (f) .

More reliable MT-BCS estimations can be yielded when processing a larger number of snapshots. Figure 6 shows that, also for complex electromagnetic scenarios (i.e.,—Table 1), the average location error gets lower whenincreases. By considering SNR = 10 dB as a representative example, one can observe thatreduces almost one order of magnitude from() to(). As expected, more accurate estimations arise with even more data (i.e.,when andwhen—Figure 6). The benefits from the correlation of the information coming from different time instants thanks to the MT-BCS are also highlighted by the behavior of the plots in Figure 6:more rapidly decreases for higher values ofwhen the quality of the data improves (i.e., higher SNR).

Figure 6: Fully populated array—(;;; SNR;;)—behavior of the location indexaveraged amongdifferent noisy scenarios versus the SNR when using the MT-BCS with different number of available snapshots.

As long as the applications at hand do not require the fast or real-time identification of the DoAs, and there is the possibility to collect the data at consecutive time instants, the robust estimation of a larger number of impinging signals is allowed. In this context, Figure 7 shows the results obtained with the MT-BCS when(Figures 7(a) and 7(b)) and(Figures 7(c) and 7(d)) (SNR = 10 dB). As for the case, the DoAs are estimated with a good degree of accuracy also in the worst case within theexperiments (Figure 7(b)—), while the average location error amounts to. Differently, the average error isand in the worst case (Figure 7(d)) is when . For the sake of completeness, the best solutions are reported in Figures 7(a) and 7(c) whenand, respectively.

(a)

(b)

(c)

(d)

Figure 7: Fully populated array—(;;; SNR = 10 dB;;)—plot of the best (left column) and worst (right column) estimations obtained by means of the MT-BCS among thedifferent noisy scenarios when(a) (b)and(c) (d) .

3.2. DoAs Estimation Performance for Different Array Geometries

In this section, the behavior of the BCS-based single-snapshot and multiple-snapshots DoAs estimators is analyzed for different array architectures. The three array geometries in Figure 8 are taken into account. As it can be noticed, the first array (Figure 8(a)) has the same number of elements of the fully populated one, but the sensors are randomly located on the antenna aperture. The other two arrays (Figures 8(b) and 8(c)) have less elements (i.e.,) but same aperture length of the fully populated array along the two coordinate axes.

(a)

(b)

(c)

Figure 8: Array geometries comparison—geometries of the receiving(a)random (),(b) L-shaped (), and (c) cross-shaped () arrays.

In the first example, the performance of the ST-BCS is assessed when changing the number of impinging signals fromup to, while keeping the noise level to SNR = 10 dB. Figure 9 shows the average location error () obtained in correspondence with the three arrays. Unlike the fully populated arrangement enabling good estimation features especially until(), both the L-shaped array and the cross-shaped one do not allow reliable estimations also for the simplest scenario (i.e.,and). This is due, on the one hand, to the limited information collected from a single snapshot acquisition and, on other hand, to the fact that the number of sensors is one third the elements of the fully-populated configuration (i.e.,). As for the random array, the achieved performances are almost equal to those of the fully populated solution thus confirming the higher reliability when having at disposal a larger number of sensors. When using the MT-BCS, no significant improvements occur in comparison with the ST-BCS when, since average errors higher than(Figure 10(a)) are obtained with both the L-shaped or cross-shaped array. Whethersnapshots are at disposal (Figure 10(b)), it turns out that the estimates from the L-shaped array present average location errors below until . Differently, always worse performance is achieved with the cross-shaped array (Figure 10(b)).

Figure 9: Array geometries comparison—(;;; SNR = 10 dB;;)—behavior of the location indexaveraged amongdifferent noisy scenarios versus the number of arriving signalswhen using the ST-BCS.

(a)

(b)

Figure 10: Array geometries comparison—(;;; SNR = 10 dB;;)—behavior of the location indexaveraged amongdifferent noisy scenarios versus the number of arriving signalswhen using the MT-BCS with(a) snapshots and(b)snapshots.

In order to give some insight on the effects of the SNR, let us consider the caseas a representative example. The results from the ST-BCS and the MT-BCSare reported in Figures 11(a) and 11(b), respectively. The location error tends to reduce as the SNR increases for all array structures, even though the L-shaped array outperforms the cross-shaped one, and the random array behavior is always very close to that of the fully populated configuration.

(a)

(b)

Figure 11: Array geometries comparison—(;;;SNR = 10 dB;;)—behavior of the location indexaveraged amongdifferent noisy scenarios versus the SNR when using (a) the ST-BCS withsnapshot and (b) the MT-BCS with snapshots.

4. Conclusions

The BCS method has been customized for the DoAs estimation of multiple signals impinging on planar arrays. Two different implementations, one requiring the data measured at a single snapshot and the other using the data collected at multiple snapshots, have been tested on a wide number of different scenarios as well as using different array arrangements. Likewise in the linear array case, the reported results have shown that:

(i)the two BCS-based implementations provide effective DoAs estimates just using as data the sensors output voltages without requiring the covariance matrix;(ii)the joint estimation of the signals number and DoAs is enabled; (iii)the correlation capability of the MT-BCS allows one to yield better results than the ST-BCS at the expenses of an increased computational burden.

As for the behavior of the two approaches versus the planar array geometry, it is possible to conclude that

(i)the fully populated and the random arrays give the best performance as compared to both the L-shaped and the cross-shaped arrays, but using a larger number of sensors; (ii)under the assumption of the same number of elements, the L-shaped configuration always outperforms the precision from the cross-shaped arrangement.

References

E. J. Candes and M. B. Wakin, “An introduction to compressive sampling: a sensing/sampling paradigm that goes against the common knowledge in data acquisition,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21–30, 2008.

W. U. Bajwa, J. Haupt, A. M. Sayeed, and R. Nowak, “Compressed channel sensing: a new approach to estimating sparse multipath channels,” Proceedings of the IEEE, vol. 98, no. 6, pp. 1058–1076, 2010.

A. Majumdar, R. K. Ward, and T. Aboulnasr, “Compressed sensing based real-time dynamic MRI reconstruction,” IEEE Transactions on Medical Imaging, vol. 31, no. 12, pp. 2253–2266, 2012.

J. Yang, J. Thompson, X. Huang, T. Jin, and Z. Zhou, “Random-frequency SAR imaging based on compressed sensing,” IEEE Transactions on Geoscience and Remote Sensing, vol. 51, no. 2, pp. 983–994, 2013.

G. Oliveri, P. Rocca, and A. Massa, “A bayesian-compressive-sampling-based inversion for imaging sparse scatterers,” IEEE Transactions on Geoscience and Remote Sensing, vol. 49, no. 10, pp. 3993–4006, 2011.

L. Poli, G. Oliveri, P. Rocca, and A. Massa, “Bayesian compressive sensing approaches for the reconstruction of two-dimensional sparse scatterers under TE illuminations,” IEEE Transactions on Geoscience and Remote Sensing, vol. 51, no. 5, pp. 2920–2936, 2013.

S. Ji, Y. Xue, and L. Carin, “Bayesian compressive sensing,” IEEE Transactions on Signal Processing, vol. 56, no. 6, pp. 2346–2356, 2008.

R. O. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE Transactions on Antennas and Propagation, vol. 34, no. 3, pp. 276–280, 1986.

R. Roy and T. Kailath, “ESPRIT—estimation of signal parameters via rotational invariance techniques,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 37, no. 7, pp. 984–995, 1989.

I. Ziskind and M. Wax, “Maximum likelihood localization of multiple sources by alternating projection,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 36, no. 10, pp. 1553–1560, 1988.

A. H. El Zooghby, C. G. Christodoulou, and M. Georgiopoulos, “A neural network-based smart antenna for multiple source tracking,” IEEE Transactions on Antennas and Propagation, vol. 48, no. 5, pp. 768–776, 2000.

M. Pastorino and A. Randazzo, “The SVM-based smart antenna for estimation of the directions of arrival of electromagnetic waves,” IEEE Transactions on Instrumentation and Measurement, vol. 55, no. 6, pp. 1918–1925, 2006.

M. Donelli, F. Viani, P. Rocca, and A. Massa, “An innovative multiresolution approach for DOA estimation based on a support vector classification,” IEEE Transactions on Antennas and Propagation, vol. 57, no. 8, pp. 2279–2292, 2009.

J.-J. Fuchs, “On the application of the global matched filter to DOA estimation with uniform circular arrays,” IEEE Transactions on Signal Processing, vol. 49, no. 4, pp. 702–709, 2001.

D. Model and M. Zibulevsky, “Signal reconstruction in sensor arrays using sparse representations,” Signal Processing, vol. 86, no. 3, pp. 624–638, 2006.

A. C. Gurbuz, V. Cevher, and J. H. McClellan, “Bearing estimation via spatial sparsity using compressive sensing,” IEEE Transactions on Aerospace and Electronic Systems, vol. 48, no. 2, pp. 1358–1369, 2012.

D. Malioutov, M. Çetin, and A. S. Willsky, “A sparse signal reconstruction perspective for source localization with sensor arrays,” IEEE Transactions on Signal Processing, vol. 53, no. 8, pp. 3010–3022, 2005.

M. M. Hyder and K. Mahata, “Direction-of-arrival estimation using a mixed ℓ 2,0 norm approximation,” IEEE Transactions on Signal Processing, vol. 58, no. 9, pp. 4646–4655, 2010.

H. Zhu, G. Leus, and G. B. Giannakis, “Sparsity-cognizant total least-squares for perturbed compressive sampling,” IEEE Transactions on Signal Processing, vol. 59, no. 5, pp. 2002–2016, 2011.

I. Bilik, “Spatial compressive sensing for direction-of-arrival estimation of multiple sources using dynamic sensor arrays,” IEEE Transactions on Aerospace and Electronic Systems, vol. 47, no. 3, pp. 1754–1769, 2011.

Z. Zhang and B. D. Rao, “Sparse signal recovery with temporally correlated source vectors using sparse Bayesian learning,” IEEE Journal on Selected Topics in Signal Processing, vol. 5, no. 5, pp. 912–926, 2011.

M. Carlin and P. Rocca, “A Bayesian compressive sensing strategy for direction-of-arrival estimation,” in Proceedings of the European Conference on Antennas and Propagation (EuCAP '12), pp. 1–2, Prague, Czech Republic, March 2012.

M. Carlin, P. Rocca, G. Oliveri, and A. Massa, “Multi-task Bayesian compressive sensing for direction-of-arrival estimation,” in Proceedings of the IEEE International Conference on Wireless Information Technology and Systems (ICWITS '12), Maui, Hawaii, USA, November 2012.

M. Carlin, P. Rocca, G. Oliveri, F. Viani, and A. Massa, “Directions-of-arrival estimation through Bayesian compressive sensing strategies,” IEEE Transactions on Antennas and Propagation, 2013.

G. Oliveri and A. Massa, “Bayesian compressive sampling for pattern synthesis with maximally sparse non-uniform linear arrays,” IEEE Transactions on Antennas and Propagation, vol. 59, no. 2, pp. 467–481, 2011.

M. E. Tipping, “Sparse Bayesian learning and the relevance vector machine,” Journal of Machine Learning Research, vol. 1, no. 3, pp. 211–244, 2001.

G. Oliveri, M. Carlin, and A. Massa, “Complex-weight sparse linear array synthesis by Bayesian Compressive Sampling,” IEEE Transactions on Antennas and Propagation, vol. 60, no. 5, pp. 2309–2326, 2012.

S. Ji, D. Dunson, and L. Carin, “Multitask compressive sensing,” IEEE Transactions on Signal Processing, vol. 57, no. 1, pp. 92–106, 2009.

E. T. Northardt, I. Bilik, and Y. I. Abramovich, “Spatial compressive sensing for direction of-arrival estimation with bias mitigation via expected likelihood,” IEEE Transactions on Signal Processing, vol. 61, no. 5, pp. 1183–1106, 2013.

Z. Yang, L. Xie, and C. Zhang, “Off-grid direction of arrival estimation using sparse Bayesian inference,” IEEE Transactions on Signal Processing, vol. 61, no. 1, pp. 38–43, 2013.