Research Article | Open Access

# Sparse Array Angle Estimation Using Reduced-Dimension ESPRIT-MUSIC in MIMO Radar

**Academic Editor:**A. Torsello

#### Abstract

Sparse linear arrays provide better performance than the filled linear arrays in terms of angle estimation and resolution with reduced size and low cost. However, they are subject to manifold ambiguity. In this paper, both the transmit array and receive array are sparse linear arrays in the bistatic MIMO radar. Firstly, we present an ESPRIT-MUSIC method in which ESPRIT algorithm is used to obtain ambiguous angle estimates. The disambiguation algorithm uses MUSIC-based procedure to identify the true direction cosine estimate from a set of ambiguous candidate estimates. The paired transmit angle and receive angle can be estimated and the manifold ambiguity can be solved. However, the proposed algorithm has high computational complexity due to the requirement of two-dimension search. Further, the Reduced-Dimension ESPRIT-MUSIC (RD-ESPRIT-MUSIC) is proposed to reduce the complexity of the algorithm. And the RD-ESPRIT-MUSIC only demands one-dimension search. Simulation results demonstrate the effectiveness of the method.

#### 1. Introduction

MIMO radar employs multiple transmit and receive elements and has the ability to jointly plan transmissions and process received signals. It has recently been the focus of research owing to its significant performance improvement compared to the conventional phased-array radar [1–3]. MIMO radar has more degrees of freedom than other systems with a single transmit element. These additional degrees of freedom are well-qualified for overcoming fading effect, enhancing spatial resolution, strengthening parameter identifiability, and also improving target detection performance [4–6].

In order to estimate the transmit angle and receive angle in the bistatic MIMO radar, some methods have been proposed [7, 8]. However, both of them cannot be applied in sparse linear arrays. In [9], the authors discuss the imaging method of the moving targets in MIMO radar with sparse array. Also, the issue of sparsity in the specific context of a MIMO radar system is studied in [10]. Sparse linear arrays can provide a large measurement basis with a reduced number of elements as compared to filled arrays. But the disadvantage of sparse array is manifold ambiguity which can cause large angle estimation errors. In [11, 12] the authors discuss the angle estimation performance for different sparse linear array configurations using the Ziv-Zakai bound (ZZB). They illustrate that the ZZB includes three terms which correspond to the three types of estimation errors: random errors, small main lobe errors, and errors due to side lobe ambiguities.

In conventional radar, three types of methods are proposed to solve the ambiguity problem in angle estimation. The first type is to change the original array by inducing an additional sensor or sliding the sensors positions [13–15]. The second type is to optimize the sensor positions of an array [16–18]. The last type focuses on the algorithms rather than on the hardware [19–21].

In this paper, we present an angle estimation method based on ESPRIT and MUSIC to avoid the manifold ambiguity for the bistatic MIMO radar spaced sparse linear arrays. The main idea of the method uses MUSIC-based procedure to search the true direction cosine estimate from a set of ambiguous candidate estimates. And the ambiguous candidate estimates are obtained by ESPRIT algorithm. But, the requirement of two-dimension search renders much higher computational cost. Then we derive a Reduced-Dimension ESPRIT-MUSIC algorithm which reduces the complexity for angle estimation in the bistatic MIMO radar with sparse linear arrays. Compared to the uniform linear array (ULA), we can obtain more accurate angle estimation.

#### 2. Problem Formulation

As shown in Figure 1, a bistatic MIMO radar system consists of -element transmit array and -element receive array, both of which are spaced sparse linear arrays. The transmit array is composed of subarrays with sensors per subarray, and the receive array is composed of subarrays with sensors per subarray, intersensor spacing and intersubarray spacing . The targets are assumed to be in the far-field of transmit and receive arrays. At the transmit site, different narrowband signals are emitted simultaneously, which have identical bandwidth and centre frequency but are temporally orthogonal. Assume that noncoherent targets, respectively, correspond to the transmit angle and the receive angle , where , are presented in the same range. For convenience, we consider that estimation of angle cosines are relative to the array axis , .

The output of the entire matched filters at the receiver can be expressed as where is an matrix composed of the steering vectors and is the Kronecker product of the receive and the transmit steering vectors for the th target.

And the transmit steering vectors can be written as where is the steering vector of the transmit subarray which is defined by where , stands for transpose and is the vector describing the phase shifts caused by transmit subarray displacements where .

Also, the receive steering vectors can be expressed as where is the steering vector of the receive subarray which is defined by where and is the vector describing the phase shifts caused by receive subarray displacements where .

is a column vector consisting of the phase and amplitudes of the sources at time which is usually in the form of with being the Doppler frequency and the amplitude involving the reflection coefficients and path losses and so on. The noise vector is assumed to be independent, zero-mean complex Gaussian distribution.

#### 3. ESPRIT-MUSIC for Angle Estimation

##### 3.1. The Theory of ESPRIT-MUSIC Algorithm

The maximum likelihood (ML) estimation of the covariance of for snapshots is , where denotes the Hermitian transpose. Let be the signal subspace matrix composed of the eigenvectors corresponding to the largest eigenvalues of , and the last eigenvectors constitute the noise subspace . It can be shown that and span the same subspace. Therefore, there exists a unique nonsingular such that . We define a new matrix , where . Then the matrix is row equivalent to . is an signal subspace matrix formed from by the same row interchange operations as is formed from . Let and be the submatrices of consisting of the first and the last rows of , respectively. Then , where . Here denotes a diagonal matrix constructed by the vector . Let and be the submatrices formed from in the same way as the and are formed from . Then the diagonal elements of are the eigenvalues of , which satisfy . The eigenvalue decomposition of yields , where is a diagonal matrix composed of the eigenvalues of and the columns of are eigenvectors of . Thus, [8]. Similarly, let and be the submatrices of consisting of the first and the last rows of . Then , where . So we obtain , , and the set of low-variance but cyclically ambiguous direction cosine estimates Because , here exists a set of cyclically related candidates for the low-variance estimate of , , . It can be written as we define , , , and , the bounds for parameter , are determined by where denotes the smallest integer greater than and denotes the largest integer less than . The unambiguous estimates of direction cosines can be obtained based on the 2D-MUSIC null spectrum Then the paired transmit angle and receive angle can be written as , .

The major steps of ESPRIT-MUSIC algorithm for angle estimation in the bistatic MIMO radar with sparse linear arrays are as follows.

*Step 1.* Perform eigen-decomposition operation for the covariance matrix to obtain and .

*Step 2.* Calculate the ambiguous angle cosine estimates and via (8).

*Step 3.* Find the set of cyclically related candidates and by (9).

*Step 4.* Searching , with respect to (11), the largest peaks can be found. Then compute the transmit angle and the receive angle .

##### 3.2. Simulation Results

We present 200 Monte Carlo simulations to demonstrate the angle estimation performance of ESPRIT-MUSIC algorithm. Assume that there exist uncorrelated stationary targets, which are located at angles , , and , and the number of snapshots is for an , , and , , bistatic MIMO radar. The root mean squared error (RMSE) of the target angle estimation is defined as , where and are the estimated transmit angle and the estimated receive angle of the same target for the *i*th-trial. Figure 2 shows the RMSE of angle estimation of the first target with different intersubarray spacing, . The angle estimation performance significant degradation in 80 half-wavelengths can be seen. So, we select the intersubarray spacing in the following simulation. Figure 3 presents the paired angle estimation results of ESPRIT-MUSIC algorithm for all three targets with . The variation of angle estimation RMSE of the proposed algorithm and the method of [8] with SNR are shown in Figure 4. From Figures 3 and 4, we can see that the paired transmit angle and receive angle are correct, and the performances of ESPRIT-MUSIC with sparse array are much better than ESPRIT with ULA. Figure 5 depicts the algorithmic performance with different . It illustrates that the angle estimation performance becomes better with increasing. From Figure 5, we also draw a conclusion that the proposed algorithm has a good performance with small sampling sizes, .

#### 4. RD-ESPRIT-MUSIC for Angle Estimation

##### 4.1. The Theory of RD-ESPRIT-MUSIC Algorithm

ESPRIT-MUSIC algorithm requires two-dimension search leading to the high computational complexity. In order to reduce the computational cost of the algorithm, we propose the RD-ESPRIT-MUSIC algorithm.

In previous section, we construct the 2D-MUSIC null spectrum. And (11) is also denoted by where . Equation (12) is the problem of quadratic optimization. In order to eliminate the trivial solution , we add the constraint of , where . The optimization problem can be reconstructed as follows: Then we construct the following costing function where is constant. We have According to (15), , where is constant. For , . So is obtained by Inserting of (16) into (12), then the receive angle cosine estimates are obtained by Searching , we can find the largest peaks which correspond to the receive angle. Then the receive angle can be obtained by . Also, we can obtain the receive steering vectors . Inserting the receive steering vectors into , we obtain . According to (12), we have Searching , the largest peaks which correspond to the transmit angle can be obtained. Then the transmit angle can be expressed as .

The main steps of Reduced-Dimension ESPRIT-MUSIC algorithm for angle estimation in the bistatic MIMO radar with sparse linear arrays as follows.

*Step 1.* Perform eigen-decomposition operation for the covariance matrix to obtain and .

*Step 2.* Calculate the ambiguous angle cosine estimates and via (8).

*Step 3.* Find the set of cyclically related candidates and by (9).

*Step 4.* Searching with respect to (17), the largest peaks can be found. Then compute the receive angle .

*Step 5.* Searching with respect to (18), the largest peaks can be obtained. Then calculate the transmit angle .

##### 4.2. Simulation Results

All simulations are implemented in the computer that consists of an Intel Core i3-2100 CPU at 3.10 GHz and an internal memory with capacity of 2 GB. Some simulations verify the angle estimation performance of RD-ESPRIT-MUSIC algorithm. To ensure fair comparison, all the experimental parameters are similar to Section 3.2. Assume that there exist uncorrelated stationary targets, which are located at angles , , and , and the number of snapshots is for an , , and , , bistatic MIMO radar. And the intersubarray spacing . From Figure 6, we can see that the angle estimation performance of RD-ESPRIT-MUSIC algorithm is similar to the ESPRIT-MUSIC algorithm. And all of them are much better than ESPRIT with ULA. Figure 7 depicts the runtime comparison between ESPRIT-MUSIC algorithm and RD-ESPRIT-MUSIC algorithm. It is clearly shown that RD-ESPRIT-MUSIC algorithm pay much less time than ESPRIT-MUSIC algorithm. The simulation result demonstrates that the complexity of RD-ESPRIT-MUSIC algorithm reduces sharply.

#### 5. Conclusion

In this paper, the ESPRIT-MUSIC method is proposed to estimate target angle in bistatic MIMO radar spaced sparse linear array. The proposed method can obtain the paired transmit angle and receive angle and avoid the manifold ambiguity. In order to reduce the computational complexity of the algorithm, we derive the RD-ESPRIT-MUSIC algorithm which only requires one-dimension search. All of them have much better performance than ESPRIT with ULA. Several simulation results are presented to verify the effectiveness of the two algorithms.

#### Acknowledgments

This work is supported by the National Natural Science Foundation of China (Grant no. 61172159) and the Fundamental Research Funds for the Central Universities (HEUCFT1101).

#### References

- E. Fishler, A. Haimovich, R. Blum, D. Chizhik, L. Cimini, and R. Valenzuela, “MIMO radar: an idea whose time has come,” in
*Proceedings of the IEEE Radar Conference*, pp. 71–78, Philadelphia, Pa, USA, April 2004. View at: Google Scholar - A. M. Haimovich, R. S. Blum, and L. J. Cimini, “MIMO radar with widely separated antennas,”
*IEEE Signal Processing Magazine*, vol. 25, no. 1, pp. 116–129, 2008. View at: Publisher Site | Google Scholar - J. Li and P. Stoica, “MIMO radar with colocated antennas,”
*IEEE Signal Processing Magazine*, vol. 24, no. 5, pp. 106–114, 2007. View at: Publisher Site | Google Scholar - E. Fishler, A. Haimovich, R. S. Blum, L. J. Cimini Jr., D. Chizhik, and R. A. Valenzuela, “Spatial diversity in radars—models and detection performance,”
*IEEE Transactions on Signal Processing*, vol. 54, no. 3, pp. 823–838, 2006. View at: Publisher Site | Google Scholar - J. Li, P. Stoica, L. Xu, and W. Roberts, “On parameter identifiability of MIMO radar,”
*IEEE Signal Processing Letters*, vol. 14, no. 12, pp. 968–971, 2007. View at: Publisher Site | Google Scholar - L. Xu, J. Li, and P. Stoica, “Target detection and parameter estimation for MIMO radar systems,”
*IEEE Transactions on Aerospace and Electronic Systems*, vol. 44, no. 3, pp. 927–939, 2008. View at: Publisher Site | Google Scholar - C. Duofang, C. Baixiao, and Q. Guodong, “Angle estimation using ESPRIT in MIMO radar,”
*Electronics Letters*, vol. 44, no. 12, pp. 770–771, 2008. View at: Publisher Site | Google Scholar - C. Jinli, G. Hong, and S. Weimin, “Angle estimation using ESPRIT without pairing in MIMO radar,”
*Electronics Letters*, vol. 44, no. 24, pp. 1422–1423, 2008. View at: Publisher Site | Google Scholar - F. Gu, L. Chi, Q. Zhang, F. Zhu, and Y. Liang, “An imaging method for MIMO radar with sparse array based on Compressed Sensing,” in
*Proceedings of the IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC '11)*, pp. 1–4, Xi'an, China, September 2011. View at: Publisher Site | Google Scholar - T. Strohmer and B. Friedlander,
*Analysis of Sparse MIMO Radar*, Cornell University Library, 2012. - D. Khan and K. L. Bell, “Analysis of DOA estimation performance of sparse linear arrays using the Ziv-Zakai bound,” in
*Proceedings of the IEEE International Radar Conference (RADAR '10)*, pp. 746–751, Washington, DC, USA, May 2010. View at: Publisher Site | Google Scholar - D. Khan and K. L. Bel, “Explicit Ziv-Zakai bound for DOA estimation with sparse linear arrays,” in
*Proceedings of the 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP '09)*, pp. 257–260, Dutch Antilles, The Netherlands, December 2009. View at: Publisher Site | Google Scholar - D. W. Tufts, G. Hongya, and R. Kumaresan, “Resolving ambiguities in estimation spatial frequencies in sparse linear array,” in
*Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing*, pp. 345–348, Adelaide, South Australia, April 1994. View at: Google Scholar - W. Leng and A.-G. Wang, “Research of the ambiguity restraint in five-element cross-shaped array,” in
*Proceedings of the International Conference on Microwave Technology and Computational Electromagnetics (ICMTCE '09)*, pp. 37–40, Beijing, China, November 2009. View at: Publisher Site | Google Scholar - H.-L. Sun, H.-H. Tao, and R.-C. Hao, “Method of resolving ambiguity for sparse array via modified sparse even array based on MUSIC algorithm,” in
*Proceedings of the 2nd Asia-Pacific Conference on Synthetic Aperture Radar (APSAR '09)*, pp. 246–249, Huangshan, China, October 2009. View at: Publisher Site | Google Scholar - F. Athley, “Optimization of element positions for direction finding with sparse arrays,” in
*Bayesian Bounds for Parameter Estimation and NonlInear FilterIng/TrackIng*, pp. 545–548, Wiley-IEEE Press, Hoboken-Piscataway, NJ, USA, 2007. View at: Google Scholar - H. Gazzah and K. Abed-Meraim, “Optimum ambiguity-free isotropic antenna arrays,” in
*Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '09)*, pp. 2157–2160, Taipei, Taiwan, April 2009. View at: Publisher Site | Google Scholar - H. Gazzah, “Optimum antenna arrays for isotropic direction finding,”
*IEEE Transactions on Aerospace and Electronic Systems*, vol. 47, no. 2, pp. 1482–1489, 2011. View at: Publisher Site | Google Scholar - V. I. Vasylyshyn and O. A. Garkusha, “Direction finding using sparse array composed of multiple identical subarrays,” in
*Proceedings of the 5th International Conference on Antenna Theory and Techniques*, pp. 273–276, Kyiv, Ukraine, May 2005. View at: Publisher Site | Google Scholar - M. D. Zoltowski and K. T. Wong, “Closed-form eigenstructure-based direction finding using arbitrary but identical subarrays on a sparse uniform Cartesian array grid,”
*IEEE Transactions on Signal Processing*, vol. 48, no. 8, pp. 2205–2210, 2000. View at: Publisher Site | Google Scholar - V. Vasylyshyn, “Direction of arrival estimation using ESPRIT with sparse arrays,” in
*Proceedings of the 6th European Radar Conference (EuRAD '09)*, pp. 246–249, Rome, Italy, October 2009. View at: Google Scholar

#### Copyright

Copyright © 2013 Chaozhu Zhang and Yucai Pang. 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.