International Journal of Antennas and Propagation
Volume 2018 (2018), Article ID 3284619, 10 pages
https://doi.org/10.1155/2018/3284619

Research Article

Reduced-Complexity Direction of Arrival Estimation Using Real-Valued Computation with Arbitrary Array Configurations

Feng-Gang Yan,¹ Jun Wang,¹ Shuai Liu,¹ Yi Shen,² and Ming Jin¹

¹Harbin Institute of Technology at Weihai, Weihai 264209, China
²Harbin Institute of Technology, Harbin 150001, China

Correspondence should be addressed to Shuai Liu; lius_hit@163.com

Received 31 August 2017; Revised 14 December 2017; Accepted 4 March 2018; Published 29 April 2018

Academic Editor: Elisa Giusti

Copyright © 2018 Feng-Gang Yan 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.

A low-complexity algorithm is presented to dramatically reduce the complexity of the multiple signal classification (MUSIC) algorithm for direction of arrival (DOA) estimation, in which both tasks of eigenvalue decomposition (EVD) and spectral search are implemented with efficient real-valued computations, leading to about 75% complexity reduction as compared to the standard MUSIC. Furthermore, the proposed technique has no dependence on array configurations and is hence suitable for arbitrary array geometries, which shows a significant implementation advantage over most state-of-the-art unitary estimators including unitary MUSIC (U-MUSIC). Numerical simulations over a wide range of scenarios are conducted to show the performance of the new technique, which demonstrates that with a significantly reduced computational complexity, the new approach is able to provide a close accuracy to the standard MUSIC.

1. Introduction

Direction-of-arrival (DOA) estimation is a fundamental array processing problem with many applications, for example, radar, sonar, wireless communication, and smart antenna design [1, 2]. This topic has been extensively studied during the past four decades, resulting in many efficient and accurate algorithms including multiple signal classification (MUSIC) [3], maximum likelihood (ML) [4], subspace fitting (SF) [5], minimum norm (MN) [6], and their derivations. Among those methods, the MUSIC algorithm is able to provide super resolution DOA estimation for closely spaced sources and has an easy implementation with arbitrary array configuration [7]. However, such advantages are archived at the expense of huge complexity which is mainly caused by an involved eigenvalue decomposition (EVD) step and a tremendous spectral search step, both are generally implemented with complex-valued computations. Therefore, the standard MUSIC is prohibitively expensive in scenarios where real-time processing is required [8].

It is well known that the problem of DOA estimation can be simplified with some specified array structures, based on which a variety of low-complexity methods has been proposed for high computational efficiency. For example, when the array geometry satisfies the rotational invariant property, DOA can be immediately computed without spectral search by using the estimation of signal parameters via rotational invariance technique (ESPRIT) [9]. Exploiting the special geometry of a uniform linear array (ULA), one can also find source DOA by polynomial rooting with search-free computations using the well-known root-MUSIC algorithm [10]. Besides, numerous useful modifications of ESPRIT and root-MUSIC have been proposed with circular and other kinds of arrays [11, 12]. As the array structures used in these techniques are still rather specific, many promising attempts such as array interpolation (AI) [13], manifold separation technique (MST) [14], and Fourier-domain (FD) root-MUSIC [15] have been proposed recently to extend ESPRIT and root-MUSIC to more general classes of array configurations. Unfortunately, those approaches usually use a polynomial with a sufficiently high order to warrant that the truncation errors are small, and hence, the complexity for finding the roots of this polynomial may be higher than expected [16].

Considering one multiplication between two complex variables generally require four times that between two real ones, algorithms with real-valued computation can reduce about 75% complexity as compared to their complex versions. Following this idea, Huarng and Yeh [17] introduced an outstanding unitary transformation for low-complexity DOA estimation with real-valued computation. Whereafter, Linebarger et al. [18] proposed a forward/backward (FB) averaging method which obtains real-valued arithmetic for fast DOA estimation as well. These techniques are firstly exploited by the unitary MUSIC (U-MUSIC) algorithm [19] and then extended to many other derivations including unitary root MUSIC (U-root-MUSIC) [20], unitary ESPRIT (U-ESPRIT) [21], unitary method of direction-of-arrival estimation (U-MODE) [22], and unitary matrix pencil (U-MP) [23]. Based on the special structure of a centrosymmetrical array (CSA), those algorithms transform the complex array covariance matrix into a real one. It has been proven that this real matrix is symmetrical, and hence, both matrix decomposition and spectral search can be implemented with real-valued computation. Besides, it has been found that real-valued algorithms also show improved accuracy as compared to complex-valued approaches. Despite their increased estimation accuracies with reduced costs, almost all of the state-of-the-art real-valued methods are only suitable for CSAs [24], which severely limits their applications [25, 26].

As a further development of our previous work in [27], the objective of the present paper is to propose a new real-valued subspace-based algorithm for fast DOA estimation. However, unlike the abovementioned methods that attempted to overcome the high-complexity problem using special array structures or array mapping techniques [28], we show that exploiting only the real part of the array covariance matrix can lead to a real-valued version of the MUSIC algorithm, which has implementation advantages over most state-of-the-art real-valued techniques since it can be used with arbitrary arrays. Furthermore, we prove that the real part of the array covariance matrix can be equivalently reformulated as an entire array covariance matrix received by a virtual array with an extended array manifold which is real. Because the virtual array covariance matrix and the virtual array manifold are real, both tasks of matrix decomposition and spectral search can be implemented with efficient real-valued computations instead of complex-valued ones. Thanks to these merits, the new algorithm is able to reduce about 75% computational complexity as compared to the standard MUSIC. Finally, we provide in-depth insights into the new approach including the EVD of the real part of the array covariance matrix as well as performance simulation over a wide range of application scenarios, which demonstrate that with significantly reduced complexity, the proposed approach can still provide acceptable accuracy close to the standard MUSIC.

1.1. Mathematical Notations

Throughout the paper, matrices and vectors are denoted by upper and lower boldface letters, respectively. Complex and real vectors and matrices are denoted by single-bar- and double-bar upper boldface letters, respectively, and detailed mathematical notations are defined in Table 1.

Table 1: Mathematical notations.

Noise power

Transpose

Conjugation

Hermitian transpose

Round down to integer

Frobenius norm

Mathematical expectation

Real part of the embraced element

Imaginary part of the embraced element

Zero matrix (vector)

identity matrix

Dirac delta function

Rank of the embraced matrix

Column space of the embraced matrix

Diagonal matrix composed of the embraced elements

2. Signal Model and Standard MUSIC

2.1. Signal Model and Basic Assumptions

Without loss of generality, let us consider an arbitrary linear array (as to be shown that the proposed method has no dependence on array geometries, and it can be easily extended to arbitrary plane array for two-dimensional DOA estimate) with M omnidirectional sensors labeled by , where the coordinate of the th sensor is denoted by . Suppose that there are uncorrelated narrow-band plane waves with unknown DOAs impinging on the array from far field, the array received data can be written as [1–28]

where is the number of snapshots, is the signal waveform, is the additive white Gaussian noise (AWGN), and

is the steering vector matrix (also known as array manifold), and each column of is defined as a so-called steering vector, which can be expressed as

where and are the center wavelength. The goal of the DOA estimation is to find the DOA set , based on snapshots of array received data .

Throughout the paper, it is assumed that the number of sources is known [29] and is smaller than half that of sensors such that . It is also assumed that positions and displacements of array elements do not need to be uniform or follow regular patterns, provided that they satisfy the rank ambiguity restriction [30]. The AWGN is assumed to satisfy the following statistical performances [31–33].

and the incident signal is uncorrelated and satisfies [34, 35]

where is the source covariance matrix and is a real diagonal matrix.

2.2. Standard MUSIC

With snapshots of array received data , one can compute the array output covariance matrix.

and further obtained the EVD of as follows:

where and are the signal and noise subspaces, respectively. In practical situations, the theoretical is estimated by

Hence, the EVD of the array output covariance matrix is in fact given by

Based on some facts and , the standard MUSIC suggests to search the peaks of the following function over to find source DOAs.

The primary advantage of the MUSIC algorithm is its easy implementation with arbitrary array configurations, which is archived at the expense of huge complexity caused by an involved tremendous spectral search step with expensive complex-valued computation.

3. The Proposed Algorithm

We begin our algorithm by considering the real part of the array output covariance. Using (6), we have

where is defined as

Using , can be expressed as

Therefore, we have

where c and are given by

Using (5) and noting that , we have

where is given by

Inserting (14) as well as (16) into (11), we obtain

where is given by

Comparing (18) and (19) with (1) and (6), the real part of the array covariance matrix can be regarded as an entire array covariance matrix of a virtual array with a manifold . The output sensor vector of this virtual array is and the incident signal on this virtual array is with its covariance matrix given by . Therefore, (19) provides a virtual signal model for DOA estimation, which is similar to the conventional one given by (1).

Because DOA information is also contained in , one can exploit the idea of eigenvalue analysis to perform the EVD of the virtual array covariance matrix and construct a MUSIC-like spectral for DOA estimate. Noting that , which implies that is a symmetrical real matrix. Therefore, the EVD computation

requires only real-valued flops [36]. Using (6), it is shown in the appendix that the eigenvalues of are given by

where is the number of pairs of symmetrical sources in , are the eigenvalues of matrix

and is defined as

According to (21), has significant and smallest eigenvalues. Therefore, (20) can be further written as

where contains the significant eigenvalues , contains the smallest eigenvalues , and and are the signal and noise matrices such that

Since is the virtual manifold matrix associated with , by using the orthogonality between the signal and the noise subspaces, we obtain

Because is in fact a combined manifold matrix covering both and , we have

where and are two real vectors, given by

Based on (26) and (27), we can define a MUSIC-like spectral for DOA estimation as follows

Since , , and are all real, we must have

which means that the minima of over half of the angular field of view, that is, or , is either true DOAs or their images. Thus, we can search over half of the angular field of view to obtain candidate angles

and select the true DOAs from and its mirror

by a further step to solve the ambiguity problem. Because for one true DOA , shows two symmetrical peaks at angles and simultaneously. Therefore, for true DOAs, gives at most peaks over half of the angular field of view. This happens if and only if any two of the true DOAs are not symmetrical. Oppositely, generates at least peaks over half of the angular field of view, and this happens if and only if all the true DOAs are paired symmetrical themselves. In other words, the number of candidate angels satisfies

The conventional beamformer (CBF) [37] is exploited to select the true DOAs among and . As the CBF takes its maxima only at the true DOAs, the CBF spectral amplitudes responding to the true DOAs must be much larger than those associated with their symmetrical mirrors. On the other hand, as the number of the true DOAs is known in advance, the true DOAs can be easily selected among the candidate angles by

where

Although using CBF to exclude the symmetrical mirror DOAs means that there is an additional step involved in the proposed estimator, the complexity of this further step is substantially lower since we only need to compute the product for at most spectral points. Detailed steps for implementing the proposed algorithm are summarized in Algorithm 1.

Require: snapshots of the array output vectors.

Return: a set of L estimated source DOAs.

    1. Estimate and obtain its real part ;

    2. Compute to get the noise matrix ;

    3. Construct ;

    4. Search over only to get T peak angles ;

    5. Obtain candidate angles and ;

    6. Select the true DOAs by .

Algorithm 1: The Proposed Algorithm.

We end up this section by a comparison of primary real-valued computational flops required by MUSIC [3], U-MUSIC [19], and the proposed method, which is shown in Table 2. In the table, stands for the total number of search points over . Because EVD and spectral search dominate the total complexity, the common flops required by the three algorithms for the estimation of and the slight flops required by the proposed method for solving the ambiguity problem are omitted.

Table 2: Comparison of real-valued computational flops.

Algorithms
Real-valued computational flops

MUSIC

U-MUSIC

Proposed

Using the fast subspace decomposition (FSD) technique [38], the EVD computation on a real matrix for a signal subspace of dimension costs real-valued flops. As the proposed method has equivalent signals, this term for the proposed method is given by . Since the standard MUSIC needs to compute the EVD of the complex matrix , this term for MUSIC is given by . Because and , computing the MUSIC spectral for sample points over costs real-valued flops [39]. Since the proposed method involves a compressed search over , it only needs to compute sample points. Taking into account that , and , the complexity of spectral search for the proposed method is significantly reduced to .

It can be concluded from Table 2 that our method has the lowest complexity among the three algorithms. Moreover, because we generally have [8, 15], about 3/4 = 75% complexities are reduced by the new method as compared to the standard MUSIC.

4. Simulation Results

Numerical simulations with 500 Monte Carlo trials are conducted to demonstrate the performance of the proposed method on a linear array composed of sensors, where sources are considered throughout the simulations. For the root mean square error (RMSE) comparison, the Cramer-Rao lower bound (CRLB) given in [40] is also applied for reference and the RMSE is defined as

where is the th estimated value of the th signal incident angle . For sources, the signal-to-noise ratio (SNR) is defined as

where denotes the average power of all sources, and is the power of the source.

In the first simulation, we use a ULA to estimate the DOAs of two sources located at and . Five algorithms including the standard MUSIC [3], ESPRIT [9], U-MUSIC [19], RV-MUSIC [39], and the proposed method are applied in the simulation.

Figure 1 compares the RMSEs of different algorithms against the SNR, where the number of snapshots is set as . It is seen from Figure 1 that U-MUSIC is the most accurate one among the four methods as expected, although it can be only used with CSAs. It is also seen from the figure that with a significantly reduced complexity, our method can still provide a close accuracy to the standard MUSIC and the RV-MUSIC algorithms, especially with SNR > 0 dB. In addition, the proposed has a much better accuracy than ESPRIT.

Figure 1: RMSE versus the SNR, ULA, , , , and .

To see more clearly the performance of the new method with a ULA, Figure 2 plots the RMSEs of different algorithms as functions of the number of snapshots, where the SNR is fixed as SNR = 5 dB. It can be concluded again from Figure 2 that the proposed method can provide acceptable estimation accuracy which is very close to MUSIC and RV-MUSIC and is much better than ESPRIT.

Figure 2: RMSE versus the number of snapshots, ULA, SNR = 5 dB, , , and .

In the second simulation, we examine fast DOA estimation with nonuniform linear arrays (NULAs), where two closely spaced sources located at and are considered. We use a minimum redundancy linear array (MRLA) [41] to assess the performance of the proposed method and compare it to that of the standard MUSIC. Note that neither the shift invariant geometry or the centrosymmetrical structure exists in a MRLA, and hence ESPRIT [9] and most state-of-the-art real-valued methods [19–23] including U-MUSIC cannot be used in such an array directly without array mapping techniques [28].

In Figure 3, we set again the number of snapshots as and compare the RMSEs of different algorithms against the SNR. In Figure 4, we fix SNR = 5 dB and plot RMSEs as functions of the number of snapshots, where the amounts of snapshots vary from a wide range over to .

Figure 3: RMSE versus SNR, MRLA, , , , and .

Figure 4: RMSE versus the number of snapshots, SNR = 5dB, MRLA, , , and .

It can be seen clearly from Figure 3 and Figure 4 that the three methods perform closely to each other. More specifically, the standard MUSIC slightly outperforms RV-MUSIC and the proposed technique, especially with low SNRs and small numbers of snapshots. However, as the proposed method is a real-valued DOA estimator which reduces about 75% complexities, it makes an efficient trade-off between complexity and accuracy as compared to the standard MUSIC.

In the third simulation, we examine the performance of the proposed method with different numbers of signals in Figure 5 and Figure 6, where the simulation parameters are given in the captions. As can be seen clearly from the two figures that our method provides very close RMSEs to the standard MUSIC with different numbers of signals. It is also seen from the two figures that the performances of both the two method decreases slightly when L increases. This is because when L increases, the dimensions of noise subspaces decreases oppositely.

Figure 5: RMSE versus SNR respect to different numbers of signals, ULA, , and .

Figure 6: RMSE versus the number of snapshots respect to different numbers of signals, ULA, SNR = 10 dB and .

In the last simulation, we use a ULA to plot the simulation times of DOA estimation by MUSIC [3], U-MUSIC [19], RV-MUSIC [39] and the proposed method as functions of the number of sensors in Figure 7, where we set SNR = 10 dB, , and two sources located at and are considered. The simulated results are given by a PC with Intel(R) Core(TM) Duo T5870 2.0 GHz CPU and 1 GB RAM by running the Matlab codes in the same environment, where a common fine search gird is used the three methods. It can be concluded from Figure 7 that although the proposed method is slightly efficient than the RV-MUSIC algorithm, it is the most efficient one among the four techniques, and it costs a simulation time being about 4 times lower than that of MUSIC.

Figure 7: Simulation time versus the number of sensors, ULA, SNR = 10 dB, , , and .

5. Conclusions

We have proposed an efficient DOA estimation algorithm, in which both tasks of eigenvalue decomposition and spectral search are implemented with low-complexity real-valued computations. In addition, the proposed method can be used with arbitrary array configurations, which shows implementation advantage over most existing unitary methods. Complexity analysis and simulation demonstrate that with about 75% reduced complexity, the new method is able to provide a good DOA estimation accuracy which is very close to the standard MUSIC.

Appendix

Proof of Equation (21)

We Begin the Proof by Using (6) to Rewrite R as

Since there are pairs of symmetrical sources in , we can divide into two subsets as follows:

where contains all the symmetrical sources and we can write

Note for any two DOAs , we have . Because has the Vandermonde structure and , we must have

Since is a diagonal matrix with full rank (note that is assumed to be uncorrelated), we can write , where is also a diagonal matrix with full rank. Thus, we further obtain [28]

As are the eigenvalues of matrix , we have

Using (A.6), we have

which implies that the eigenvalues of are given by

and the proof is completed.

Conflicts of Interest

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

Acknowledgments

This work is supported by the National Natural Science Foundation of China (61501142), China Postdoctoral Science Foundation (2015M571414), Science and Technology Program of Weihai, and Discipline Construction Guiding Foundation in Harbin Institute of Technology (Weihai) (WH20160107).

References

H. Krim and M. Viberg, “Two decades of array signal processing research: the parametric approach,” IEEE Signal Processing Magazine, vol. 13, no. 4, pp. 67–94, 1996.

D. H. Tuan and P. Russer, “Signal processing for wideband smart antenna array applications,” IEEE Microwave Magazine, vol. 5, no. 1, pp. 57–67, 2004.

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

P. Stoica and K. C. Sharman, “Maximum likelihood methods for direction-of-arrival estimation,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 38, no. 7, pp. 1132–1143, 1990.

A. Swindlehurst and M. Viberg, “Subspace fitting with diversely polarized antenna arrays,” IEEE Transactions on Antennas and Propagation, vol. 41, no. 12, pp. 1687–1694, 1993.

R. Kumaresan and D. W. Tufts, “Estimating the angles of arrival of multiple plane waves,” IEEE Transactions on Aerospace and Electronic Systems, vol. AES-19, no. 1, pp. 134–139, 1983.

W. Zheng, X. Zhang, and J. Shi, “Sparse extension Array geometry for DOA estimation with nested MIMO radar,” IEEE Access, vol. 5, pp. 9580–9586, 2017.

F. G. Yan, M. Jin, and X. L. Qiao, “Low-complexity DOA estimation based on compressed MUSIC and Its performance analysis,” IEEE Transactions on Signal Processing, vol. 61, no. 8, pp. 1915–1930, 2013.

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.

A. Barabell, “Improving the resolution performance of eigenstructure-based direction-finding algorithms,” in ICASSP '83. IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 8, pp. 336–339, Boston, MA, USA, April 1983.

G. Jiang, X. Mao, and Y. Liu, “Direction-of-arrival estimation for uniform circular arrays under small sample size,” Journal of Systems Engineering and Electronics, vol. 27, no. 6, pp. 1142–1150, 2016.

D. Zhang, Y. Zhang, G. Zheng, C. Feng, and J. Tang, “Improved DOA estimation algorithm for co-prime linear arrays using root-MUSIC algorithm,” Electronics Letters, vol. 53, no. 18, article 1279, 2017.

T. E. Tuncer, T. K. Yasar, and B. Friedlander, “Direction of arrival estimation for nonuniform linear arrays by using array interpolation,” Radio Science, vol. 42, no. 4, 2007.

Y. Cao, Z. Zhang, F. Dai, and R. Xie, “Direction of arrival estimation for monostatic multiple-input multiple-output radar with arbitrary array structures,” IET Radar, Sonar & Navigation, vol. 6, no. 7, p. 679, 2012.

M. Rbsamen and A. B. Gershman, “Direction-of-arrival estimation for nonuniform sensor arrays: from manifold separation to Fourier domain MUSIC methods,” IEEE Transactions on Signal Processing, vol. 57, no. 2, pp. 588–599, 2009.

F. G. Yan, M. Jin, and X. L. Qiao, “Source localization based on symmetrical MUSIC and Its statistical performance analysis,” Science China Information Sciences, vol. 56, no. 6, pp. 1–13, 2013.

K. C. Huarng and C. C. Yeh, “A unitary transformation method for angle-of-arrival estimation,” IEEE Transactions on Signal Processing, vol. 39, no. 4, pp. 975–977, 1991.

D. A. Linebarger, R. D. DeGroat, and E. M. Dowling, “Efficient direction-finding methods employing forward/backward averaging,” IEEE Transactions on Signal Processing, vol. 42, no. 8, pp. 2136–2145, 1994.

S. Akkar and A. Gharsallah, “Reactance domains unitary MUSIC algorithms based on real-valued orthogonal decomposition for electronically steerable parasitic array radiator antennas,” IET Microwaves, Antennas & Propagation, vol. 6, no. 2, p. 223, 2012.

C. Qian, L. Huang, and H. C. So, “Improved unitary root-MUSIC for DOA estimation based on pseudo-noise resampling,” IEEE Signal Processing Letters, vol. 21, no. 2, pp. 140–144, 2014.

G. Zheng, B. Chen, and M. Yang, “Unitary ESPRIT algorithm for bistatic MIMO radar,” Electronics Letters, vol. 48, no. 3, p. 179, 2012.

A. B. Gershman and P. Stoica, “On unitary and forward-backward MODE,” Digital Signal Processing, vol. 9, no. 2, pp. 67–75, 1999.

N. Yilmazer, J. Koh, and T. K. Sarkar, “Utilization of a unitary transform for efficient computation in the matrix pencil method to find the direction of arrival,” IEEE Transactions on Signal Processing, vol. 54, no. 1, pp. 175–181, 2006.

F. G. Yan, T. Jin, M. Jin, and Y. Shen, “Subspace-based direction-of-arrival estimation using centro-symmetrical arrays,” Electronics Letters, vol. 52, no. 22, pp. 1895-1896, 2016.

F. G. Yan, B. Cao, S. Liu, M. Jin, and Y. Shen, “Reduced-complexity direction of arrival estimation with centro-symmetrical arrays and Its performance analysis,” Signal Processing, vol. 142, pp. 388–397, 2018.

F. G. Yan, Y. Shen, and M. Jin, “Fast DOA estimation based on a split subspace decomposition on the array covariance matrix,” Signal Processing, vol. 115, pp. 1–8, 2015.

F. G. Yan, X. W. Yan, J. Shi et al., “MUSIClike direction of arrival estimation based on virtual array transformation,” Signal Processing, vol. 139, pp. 156–164, 2017.

P. Pal and P. P. Vaidyanathan, “Nested arrays: a novel approach to array processing with enhanced degrees of freedom,” IEEE Transactions on Signal Processing, vol. 58, no. 8, pp. 4167–4181, 2010.

Y. Tian and H. Xu, “Extended-aperture DOA estimation with unknown number of sources,” Electronics Letters, vol. 51, no. 7, pp. 583-584, 2015.

F. G. Yan, Z. K. Chen, M. J. Sun, Y. Shen, and M. Jin, “Two-Dimensional Direction-of-Arrivals Estimation Based on One-Dimensional Search Using Rank Deficiency Principle,” International Journal of Antennas and Propagation, vol. 2015, Article ID 127621, 8 pages, 2015.

J. D. Lin, W. H. Fang, Y. Y. Wang, and J. T. Chen, “FSF MUSIC for joint DOA and frequency estimation and Its performance analysis,” IEEE Transactions on Signal Processing, vol. 54, no. 12, pp. 4529–4542, 2006.

F. Li, H. Liu, and R. J. Vaccaro, “Performance analysis for DOA estimation algorithms: unification, simplification, and observations,” IEEE Transactions on Aerospace and Electronic Systems, vol. 29, no. 4, pp. 1170–1184, 1993.

F. Li, R. J. Vaccaro, and D. W. Tufts, “Performance analysis of the statespace realization (TAM) and ESPRIT algorithms for DOA estimation,” IEEE Transactions on Antennas and Propagation, vol. 39, no. 3, pp. 418–423, 1991.

F. Liu, J. Wang, C. Sun, and R. Du, “Spatial differencing method for DOA estimation under the coexistence of both uncorrelated and coherent signals,” IEEE Transactions on Antennas and Propagation, vol. 60, no. 4, pp. 2052–2062, 2012.

Z. Ye, Y. Zhang, and X. Xu, “Two-dimensional direction of arrival estimation in the presence of uncorrelated and coherent signals,” IET Signal Processing, vol. 3, no. 5, pp. 416–429, 2009.

G. H. Golub and C. H. Van Loan, Matirx computations, The Johns Hopkins Univ. Press., Baltimore, MD, USA, 1996.

J. C. Chen, K. Yao, and R. E. Hudson, “Source localization and beamforming,” IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 30–39, 2002.

G. Xu and T. Kailath, “Fast subspace decomposition,” IEEE Transactions on Signal Processing, vol. 42, no. 3, pp. 539–551, 1994.

F. G. Yan, M. Jin, S. Liu, and X. L. Qiao, “Real-valued MUSIC for efficient direction estimation with arbitrary array geometries,” IEEE Transactions on Signal Processing, vol. 62, no. 6, pp. 1548–1560, 2014.

P. Stoica and A. Nehorai, “Performance study of conditional and unconditional direction-of-arrival estimation,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 38, no. 10, pp. 1783–1795, 1990.

C. Chambers, T. C. Tozer, K. C. Sharman, and S. D. Tariq, “Temporal and spatial sampling influence on the estimates of superimposed narrowband signals: when less can mean more,” IEEE Transactions on Signal Processing, vol. 44, no. 12, pp. 3085–3098, 2004.