Research Article | Open Access

# Compressive Sensing for High-Resolution Direction-of-Arrival Estimation via Iterative Optimization on Sensing Matrix

**Academic Editor:**Paolo Burghignoli

#### Abstract

A novel compressive sensing- (CS-) based direction-of-arrival (DOA) estimation algorithm is proposed to solve the performance degradation of the CS-based DOA estimation in the presence of sensing matrix mismatching. Firstly, a DOA sparse sensing model is set up in the presence of sensing matrix mismatching. Secondly, combining the Dantzig selector (DS) algorithm and least-absolute shrinkage and selection operator (LASSO) algorithm, a CS-based DOA estimation algorithm which performs iterative optimization alternatively on target angle information vector and sensing matrix mismatching error vector is proposed. The simulation result indicates that the proposed algorithm possesses higher angle resolution and estimation accuracy compared with conventional CS-based DOA estimation algorithms.

#### 1. Introduction

The strong scatter centers of targets in area of interest only occupy finite angle resolution cells, and the echo signal of targets is sparse, so compressive sensing (CS) theory is widely studied in direction-of-arrival (DOA) estimation applications [1–5]. In [1], a CS-based DOA estimation algorithm of multiple input and multiple output (MIMO) radar is proposed, which makes use of the sparsity of radar echo signals to perform compressive sampling on array receipt signals in time-domain. In [2], an array with element randomly distributed is adopted to perform compressive sampling on space-domain signal, reducing the number of receiving front-end channels of the array. However, both [1, 2] treat the overcomplete based matrixes as the redundant dictionaries, obtained from the angle interval of uniform quantization area of interest, which cannot ensure that the corresponding sensing matrix meets the restricted isometry property (RIP) [3]. And then, [4] proves the RIP for MIMO radar application. Reference [5] uses random Gauss matrix to perform compressive sampling on space-domain signal and adopts regularized multivectors focal undetermined system solver (RMFOCUSS) algorithm to achieve high-resolution estimation. However, the computation complexity of RMFOCUSS algorithm increases dramatically with the increase of snapshots.

In addition, the estimation performance degrades seriously in the presence of sensing matrix mismatching in the above algorithms [6, 7]. The authors in [8] investigate the CS-based DOA estimation in the presence of sensing model mismatching errors, proving that the performance of CS-based DOA estimation algorithm degrades dramatically in that case. References [9–11] present a DOA estimation model under sensing model mismatching and then use Bayesian method to realize DOA estimation. Reference [12] proposes a joint least-absolute shrinkage and selection operator (LASSO) algorithm to achieve DOA estimation in the presence of mismatching.

In this paper, a new CS-based DOA estimation algorithm is proposed to decrease the effect of sensing matrix mismatching and achieve high resolution on DOA estimation. Firstly, a DOA sparse sensing model is set up in the presence of sensing matrix mismatching. Secondly, combining the Dantzig selector (DS) algorithm [13] and least-absolute shrinkage and selection operator (LASSO) algorithm [14], a CS-based DOA estimation algorithm which performs iterative optimization alternatively on target angle information vector and sensing matrix mismatching error vector is proposed to achieve high-resolution DOA estimates.

#### 2. The Signal Model

Consider that distant-field narrow-band signals enter the uniform linear array (ULA), made up by array elements, and then the output signal of the array can be represented aswhere is steering vector of the th receipt signal, , and is the distance between the array elements. is the wavelength of carrier wave, is the array noise vector, and is the signal plural envelope.

Assume that the angle resolution vector obtained from the angle interval of area of interest through uniform quantization is , is the number of angle resolution vectors, and is the angle resolution cell; then (1) can be rewritten aswhere is the target angle information vector and is the steering vector matrix of angle resolution cell of the array.

In practice, targets in area of interest only occupy finite angle resolution cells. So and denotes norm. Thus the output signal of the array is sparse signal, is the sparsity-based matrix, and is the sparsity of target angle information vector.

#### 3. The Proposed Algorithm

##### 3.1. DOA Estimation Model under Sensing Model Mismatching

Assume that targets’ angle information vector of the array in area of interest , and . That is to say, the th target’s angle information mismatches the angle resolution vector defined before, which is called mismatching between sensing matrix and target angle information. According to CS theory, sensing model mismatching will lead to the angle information vector failing to represent target angle precisely, decreasing the estimation accuracy of target angles through conventional CS-based DOA estimation method [8].

Assume that () is the angle resolution element nearest to target’s angle in angle resolution vectors; then the steering vector of th target can be denoted approximately aswhere .

Thus the steering vector matrix when sensing matrix mismatches target angle information can be rewritten aswhere , , , and

Therefore, taking no account of the approximation error of measurement noise, (2) can be rewritten as

According to CS theory, we can recover the target angle information vector by sampling the receipt signal with only finite array elements. So we extract elements from elements of the array, and let be the corresponding line-extraction matrix; thus the output of the array after line extraction could be represented as

By observing (7), we can conclude that sampling of space-domain signals can be regarded as measurement matrix performing random projection measurements on echo signal . In addition, sensing matrix is the product result of matrix whose elements are randomly distributed and sparsity-based matrix which can be treated as Fourier transform matrix of space-domain signal. Therefore, meets the RIP condition with great probability, thus ensuring the effectiveness and robustness of using compressive sensing reconstruction algorithm to perform DOA estimation.

##### 3.2. Derivation of the Proposed Algorithm

By comparing (2) and (6), we can find that the influences of measurement noise and sensing matrix mismatching error on DOA estimation can be summed up to “additive” disturbance and “productive” disturbance. So far, conventional CS-based DOA estimation algorithms only have constraints on “additive” disturbance but fail to take the influence of “productive” disturbance on the accuracy of target angle information estimation into consideration. Therefore, conventional CS-based DOA estimation algorithms cannot effectively reduce sensing matrix mismatching error when angle resolution vector, previously defined, fails to precisely represent target. That is to say, conventional CS-based DOA algorithms are unable to ensure DOA estimation’s effectiveness and robustness when there are sensing matrix mismatching errors.

To solve these problems, a novel CS-based DOA estimation algorithm suitable for the situation when sensing matrix mismatches target angle information is proposed in this paper. The proposed algorithm combines DS algorithm and LASSO algorithm to achieve a high-resolution DOA estimation result by performing iterative optimization alternatively on target angle information vector and sensing matrix mismatching error vector.

First assume the vector of sensing matrix mismatching error in lack of prior information. According to CS theory, the optimization problem expressed in (7) can be solved by working out norm optimization under the circumstance of noise, consequently obtaining target angle information vector in space-domain:where constant is relevant to noise variance. This optimization problem can be perfectly solved by DS algorithm.

Take the estimation value of target angle information obtained by solving (8) to (7); we can get

According to the property of vector, compiling (9), it can be achieved thatwhere .

Because of being vector of sensing matrix mismatch error, from (5) we know that shares the same sparsity with target angle information . So (10) can be transformed towhere and .

Hence, (11) can be retreated as a CS optimization problem using sensing matrix mismatching error as the sparse signal, and this CS optimization problem can be denoted as

The CS optimization problem in (12) can be perfectly solved by LASSO algorithm.

Take the vector of sensing matrix mismatching error worked out from (12) to (8); estimation value of target angle information can be resolved. Repeat the process mentioned above until the difference of two target angle information vector’s norm is less than the certain predefined threshold. That is,Stop iteration at this moment; then that we get is the target angle estimation information, where is the certain predefined threshold.

#### 4. Simulation

In this part, numerical simulations are presented to examine the performance of the proposed method. Consider array elements spaced randomly in .

In the first examples, the angle resolution cell is set to be , and the snapshots of the echo signal . The angles of input signals are assumed to be . Figure 1 illustrates the spatial spectrum, when the signal-to-noise ratio (SNR) is set to 0 dB. It can be seen that both MUSIC algorithm and CAPON algorithm fail to achieve high-resolution estimation on target angle information. The CS-based DOA algorithm based on RMFOCUSS is endowed with better angle resolution compared to conventional DOA estimation algorithms while its estimation accuracy still suffers from the impacts of mismatching between sensing matrix and target angle information. In contrast, the proposed algorithm remarkably increases the DOA estimation accuracy by performing calibration on sensing matrix.

In the second examples, we consider the root-mean-square error (RMSE) of different DOA estimation algorithms versus different SNR. As shown in Figure 2, we can observe that the proposed algorithm possesses better estimation performance and achieves high resolution on DOA estimation, for the reason that it successfully calibrates sensing matrix mismatching error and impairs the effect from system sensing matrix mismatching in low SNR.

In the third experiment, the simulations on randomly generated DOAs are examined. Consider that the directions of the three signals are uniformly generated within direction intervals , and the other parameters stay consistent. The RMSE of different DOA estimation algorithms versus different SNR is plotted in Figure 3. It is seen from the figure that when the certain predefined threshold , the estimation accuracy of the proposed algorithm is less than the method in [11], but when the certain predefined threshold , the proposed algorithm can achieve higher estimation accuracy compared with other CS-DOA methods which deal with off-grid targets.

In the last experiment, the different angle resolution cells are considered to examine the ability of the proposed method to represent the true signals. The angle resolution cells are selected as . The other parameters stay consistent. The RMSE versus different angle resolution cells is depicted in Figure 4, which demonstrate that the performance of the proposed method increases with the decrease of the angle resolution cell.

#### 5. Conclusion

In this paper, a novel CS-based DOA estimation algorithm is proposed to solve the problem that the CS-based DOA estimation performance deteriorates in the presence of sensing matrix mismatching. The proposed algorithm reduces the estimation error of target angle information through calibrating sensing matrix. The algorithm proposed in this paper is characterized by great value in practical applications, since it improves the performance of CS-based DOA estimation algorithm and achieves high resolution on DOA estimation.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgment

This work was supported by the National Natural Science Foundation of China under Grant 61401204.

#### References

- Y. Yu, A. P. Petropulu, and H. V. Poor, “MIMO radar using compressive sampling,”
*IEEE Journal on Selected Topics in Signal Processing*, vol. 4, no. 1, pp. 146–163, 2010. View at: Publisher Site | Google Scholar - 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. View at: Publisher Site | Google Scholar - Z. Liu, X. Wei, and X. Li, “Aliasing-free moving target detection in random pulse repetition interval radar based on compressed sensing,”
*IEEE Sensors Journal*, vol. 13, no. 7, pp. 2523–2534, 2013. View at: Publisher Site | Google Scholar - B. Li and A. Petropulu, “RIP analysis of the measurement matrix for compressive sensing-based MIMO radars,” in
*Proceedings of the IEEE 8th Sensor Array and Multichannel Signal Processing Workshop (SAM '14)*, pp. 497–500, IEEE, A Coruña, Spain, June 2014. View at: Publisher Site | Google Scholar - S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, “Sparse solutions to linear inverse problems with multiple measurement vectors,”
*IEEE Transactions on Signal Processing*, vol. 53, no. 7, pp. 2477–2488, 2005. View at: Publisher Site | Google Scholar | MathSciNet - Z. Yang, C.-S. Zhang, and L.-H. Xie, “Robustly stable signal recovery in compressed sensing with structured matrix perturbation,”
*IEEE Transactions on Signal Processing*, vol. 60, no. 9, pp. 4658–4671, 2012. View at: Publisher Site | Google Scholar | MathSciNet - 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. View at: Publisher Site | Google Scholar | MathSciNet - 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. View at: Publisher Site | Google Scholar - Z.-M. Liu and Y.-Y. Zhou, “A unified framework and sparse Bayesian perspective for direction-of-arrival estimation in the presence of array imperfections,”
*IEEE Transactions on Signal Processing*, vol. 61, no. 15, pp. 3786–3798, 2013. View at: Publisher Site | Google Scholar | MathSciNet - Y. Zhang, Z. Ye, X. Xu, and N. Hu, “Off-grid DOA estimation using array covariance matrix and block-sparse bayesian learning,”
*Signal Processing*, vol. 98, pp. 197–201, 2014. View at: Publisher Site | Google Scholar - 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. View at: Publisher Site | Google Scholar | MathSciNet - Z. Tan and A. Nehorai, “Sparse direction of arrival estimation using co-prime arrays with off-grid targets,”
*IEEE Signal Processing Letters*, vol. 21, no. 1, pp. 26–29, 2014. View at: Publisher Site | Google Scholar - E. J. Candes and T. Tao, “The Dantzig selector: statistical estimation when
*p*is much larger than*n*,”*The Annals of Statistics*, vol. 35, no. 6, pp. 2313–2351, 2007. View at: Publisher Site | Google Scholar | MathSciNet - R. Tibshirani, “Regression shrinkage and selection via the lasso,”
*Journal of the Royal Statistical Society. Series B. Methodological*, vol. 58, no. 1, pp. 267–288, 1996. View at: Google Scholar | MathSciNet

#### Copyright

Copyright © 2015 Hongtao Li 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.