Research Article  Open Access
Minjie Wu, Xiaofa Zhang, Jingjian Huang, Naichang Yuan, "DOA Estimation of Cylindrical Conformal Array Based on Geometric Algebra", International Journal of Antennas and Propagation, vol. 2016, Article ID 7832475, 9 pages, 2016. https://doi.org/10.1155/2016/7832475
DOA Estimation of Cylindrical Conformal Array Based on Geometric Algebra
Abstract
Due to the variable curvature of the conformal carrier, the pattern of each element has a different direction. The traditional method of analyzing the conformal array is to use the Euler rotation angle and its matrix representation. However, it is computationally demanding especially for irregular array structures. In this paper, we present a novel algorithm by combining the geometric algebra with Multiple Signal Classification (MUSIC), termed as GAMUSIC, to solve the direction of arrival (DOA) for cylindrical conformal array. And on this basis, we derive the pattern and array manifold. Compared with the existing algorithms, our proposed one avoids the cumbersome matrix transformations and largely decreases the computational complexity. The simulation results verify the effectiveness of the proposed method.
1. Introduction
A conformal antenna is an antenna that conforms to a prescribed shape. The shape can be some part of an airplane, highspeed missile, or other vehicle [1]. Their benefits include reduction of aerodynamic drag, wide angle coverage, and spacesaving [2]. Nevertheless, due to the complex curved surface structure, the pattern of each antenna is inconsistent. Thus, the conformal array can no longer be regarded as a simple isotropic one. The pattern multiplication theorem is not available as well. Most classical DOA estimation algorithms cannot be directly transplanted to such scene.
In recent years, there has been a considerable interest in estimating DOAs for conformal array. Milligan used Euler rotation angles to find the patterns with elements in a conformal array that requires one to rotate not only the direction but also the polarization [3]. In [2], Wang et al. proposed a uniform method for the element polarized pattern transformation of arbitrary 3D conformal arrays based on Euler rotation. Yang et al. introduced a conformal array DOA algorithm with an unknown source number; the method was realized by virtue of the pseudo expected signal [4]. However, the root mean square error (RMSE) deteriorated severely when the number of snapshots was small. Up to the present, we have observed that most of DOA estimation algorithms for conformal array are based on the Euler rotation transformation which converts the local coordinate system to the global coordinate system. Though the Euler rotation angle is a useful tool for spatial rotation transformation [5], a huge amount of computation is incurred.
Geometric algebra is the largest possible associative algebra that integrates all algebraic systems (algebra of complex numbers, matrix algebra, quaternion algebra, etc.) into a coherent mathematical language [6]. Threedimensional pattern analysis of arbitrary conformal arrays using the mathematical framework of the geometric algebra was introduced [7]. Nevertheless, this mathematical language was not transplanted to the DOA estimation. In [8], Zou et al. took several elements as a new one and transformed the original array into another regular array to estimate the DOA. However, this method was only suitable for some particular array structures. Combining the MUSIC with geometric algebra to solve the DOA estimation has not been addressed in the literature. In this paper, we fill this gap and study the problem based on the cylindrical conformal array. Compared with the existing methods, the proposed one has three main advantages. Firstly, it does not need to calculate the rotation matrices and therefore has a much lower computational complexity. Subsequently, it is not limited to the cylindrical conformal array due to its strong commonality. Finally, it can still work effectively even when the number of polarized signals is larger than that of the array elements.
The structure of this paper is as follows. In Section 2, the rotors in geometric algebra which establishes the mathematical knowledge of transformation is briefly introduced. In Section 3, we derive the cylindrical conformal array manifold using rotors and present the GAMUSIC algorithm. In addition, to better explain the superiority of GAMUSIC in reducing the computational complexity, we briefly introduce the Euler angle and compare it with the proposed algorithm. Simulations using the proposed method for cylindrical conformal array are given in Section 4. Finally, the conclusions are drawn.
2. Rotors in Geometric Algebra
Geometric algebra was first introduced by the British mathematician, named Clifford, in the nineteenth century. He constructed the geometric product by combining the inner product with the outer product. The main advantage of the geometric algebra is embodied in processing the rotation transformation [9]. Various rotations can be described by an element called the rotor. A rotor is more general than an Euler rotation angle because a rotor can be used in an arbitrary dimensional space.
We begin by introducing a new product between vectors that we call the outer product. Let us use the wedge symbol “” to denote outer product with the properties listed in Table 1.

The outer product is regarded as the “addition operator” of subspaces, in that the outer product spans the subspace that and span together, as long as and are independent. The geometry is illustrated in Figure 1.
(a)
(b)
Next, we will introduce the fundamental product of the geometric algebra, namely, geometric product. It is simply the sum of the outer and inner product:
Reversing the order of and in (1), by means of the symmetry of the inner product and the antisymmetry of the outer product, it follows that
Thus, combining (1) with (2), the inner product and the outer product can be uniformly represented by the geometric product:
Generally, we call an outer product of vectors a blade. The value of is called the grade of the blade. Specifically, the topgrade blades in an dimensional space are called pseudoscalars. In principle, blades are just elements of the geometric algebra. To be useful for doing geometry, blades can be interpreted as subspaces. is a 2blade as shown in Figure 1(a). By introducing vector , we can construct the 3blade , which coincides with the Cartesian coordinate system. As shown in Figure 2, the unit vectors , , and , in that order, form a righthanded Cartesian coordinate system. is the pseudoscalar, relative to the origin denoted by . The 3blade is drawn as a parallelepiped. The volume depicts the weight of the 3blade, but, in principle, blades have no specific shape.
As shown in Figure 3, vector is obtained by rotating vector with . We can regard the rotation as two consecutive reflections, first in and then in . The expression that reflects in the line with direction is
In (4), must be unit length. We give the detailed derivation process in Appendix. The regularity condition can be dropped by using an inverse geometric product, as inwherewith representing the inverse operator.
Then, can be obtained by reflecting in the line with direction :
Thus, we can identify as the rotor. To proceed further, we rewrite according to the definition of the geometric product:
Here, we consider the case that the vectors are unit length. This assumption is reasonable, because the basic vectors of the Cartesian coordinate system satisfy it as well. The geometric product of itself is
Thus, we define the 2blade :
can be further simplified by substituting (10) into (8):
The expression is similar to the polar decomposition of a complex number with the unit imaginary replaced by the 2blade . It can also be written as the exponentials of :
This formalism is more useful for the logspace of rotors is linear. Up to this point, the angle of rotation in the plane remains to be determined. We split into part () parallel to plane and part () orthogonal to plane. Then, is not affected by application . And we infer that the rotation must be in plane. As stated above, the rotation consists of two successive reflections which are orthogonal (anglepreserving) transformations. Thus, it allows us to pick any vector in plane to determine the angle. Without loss of generality, we choose vector and construct the “sandwich product” as shown in (7):where is the reflection of in . From this, it is clear that the rotation must be over twice the angle between and , since the angle between and is twice the angle between and . The negative signature in (12) represents the rotation direction.
Consequently, if we want to rotate a vector counterclockwise by a specific angle, we only need to apply the rotor to the vector.
3. GAMUSIC Algorithm
3.1. Array Manifold Modeling Based on GAMUSIC
In this subsection, we will combine the geometric algebra with MUSIC to estimate the DOA. To illustrate the versatility of this algorithm, we consider cylindrical conformal array as shown in Figure 4. The array contains uniformly spaced rings on the surface. In addition, there are dipoles distributed on each ring. We assume that each dipole is a short dipole whose output voltage is proportional to the electric field along the dipole. The angle between two consecutive elements on the same ring is .
Assume that there are farfield narrow band polarization sources. represents th signal elevation angle which is measured down from axis. indicates th signal azimuth angle and is measured counterclockwise from axis. The polarization ellipse of th signal is depicted by constants and , representing the auxiliary polarization angle and the polarization phase difference [10], respectively. The array element spatial phase matrix of the th signal can be described as follows:where is the diagonal matrix depicting the output signal spatial coherent structures. th diagonal element, , represents the space phase factor about th array element. Among which, and are th signal propagation vector and the wavelength, respectively. Symbol is the element location vector and denotes the transpose operator.
It is worthwhile to note that the aforementioned element spatial phase matrix, , is derived under the global coordinate system. The azimuth and elevation are defined in Figure 4 as well. However, due to the effects of the curvature of conformal carriers, the local coordinate system is distinct from the global one. As stated above, the rotor can be used to realize the rotation between the two coordinate systems. Thus, we define the local coordinate system of th element as shown in Figure 5.
axis is the same as axis in the global coordinate system, is normal to the element surface, and is tangent to the surface so as to form a righthanded coordinate system. Naturally, transforming the global coordinate into the local one is equivalent to rotating the global coordinate around axis. From the last section, we have known that (12) denotes the rotation in plane with twice the value of . The rotation angle is
Substituting and for and , respectively, then the rotor is
In addition, , , and are orthogonal to each other and the inner products between them are zero. So,
According to the antisymmetry property of the outer product,
Adopting as the pseudoscalar in the threedimensional space, (16) can be further simplified:
Through (7), we obtain the standard orthogonal basis in the local coordinate, and the specific calculation process can refer to [11]. Here, the results are given directly:
Referring back to (14), the remaining unknown variable is . The position vector of th element in the global frame iswhere means the spacing between adjacent rings. Thus, can be obtained. If is the gain when the signal perfectly matched the antenna polarization, then the element of generalized polarization sensitive matrix can be represented aswhere and indicate the elevation and azimuth pointing directions of the short dipole.
According to this, we can get the array manifold:where is th signal polarization vector [12] and can be described by and , that is, . is the steering vector of the angle field [13] and is independent of the space location:
The received signals of the array are a superposition of the response of each signal, and the output can be expressed aswhere is th signal and is assumed to be zero mean, complex Gaussian processes statistically independent of each other, with covariance .
Up to the present, we have perfectly applied the geometric algebra to the derivation of the steering vector of the conformal array and acquired the GAMUSIC algorithm. This is also the focus of our work. As for the content of constructing the spatial spectrum and searching the peak, the readers can refer to literature [14]. As the spatial location of the short dipole is arbitrary when introducing the “rotors,” the GAMUSIC is not limited to any specific array geometry.
3.2. Comparing with the Conventional Modeling Using Euler Angle
For better understanding of the superiority of the geometric algebra in modeling the conformal array, we will briefly introduce the conventional methods of analysis based on Euler angle. In general, the transformations from the element local coordinates to the array global coordinates can be realized by three successive Euler rotations [2]. The corresponding rotation matrix can be written as where are three successive Euler rotation angles about axis, axis, and axis, respectively. , , and are the corresponding Euler rotation matrices. Note that, for cylindrical conformal array, two successive Euler rotations are usually sufficient [2]. The third Euler rotation matrix is added here to account for some irregular or complex conformal arrays. Moreover, as shown in (28), the rotation matrix is invertible. Thus, the inversion is taken with respect to , resulting in
From (28) and (29), it is not hard to find that
So, is the orthogonal matrix. Then, taking the transformation from the element local coordinates to the array global coordinates is equivalent to taking the transposition/inversion with respect to the aforementioned rotation matrix. If we model the conformal array adopting the Euler angle, three matrix multiplications and one matrix transposition are involved for each element.
In practical applications, the matrix operations are essentially the multiplication and addition operations between elements. To quantify what we mean by this, the amounts of multiplication and addition operations of the two algorithms (i.e., GAMUSIC and Euler angle) are computed, respectively, as shown in Table 2. Suppose that one matrix transposition is regarded as one multiplication or addition operation. As is known to all, the multiplication between two 3 × 3 matrices requires 9 × 3 multiplications and 9 × 2 additions. For convenience, the multiplication operation and the addition operation are collectively referred to as the operation. Then, the calculation of (28) contains 2 × 9 × 3 + 2 × 9 × 2 operations. For the conformal array consisting of elements, the transformation between different coordinates involves operations. In contrast to the Euler angle, GAMUSIC avoids the cumbersome matrix transformations.

From (20)–(22), we know that and are independent of . Moreover, can be obtained directly from (20) without extra computations. Thus, (21)(22) can be rewritten in 2 × 2 matrix. While applying the rotor to construct the array manifold, the computational process is equivalent to 2 × 2 matrix multiplied by 2 × 1 vector. Then, the operations for each element involve 4 multiplications and 2 additions. The total amount of operations is . Thus, the latter method largely decreases the computational complexity.
To sum up, the Euler rotation and its matrix representation cannot intuitively display the whole procedure. Moreover, as the configuration of the conformal array becomes more irregular and complex, the level of complexity involved in the transformations and the number of calculations required increase significantly.
4. Simulation Results
In this section, MonteCarlo simulation experiments are employed to verify the effectiveness of the GAMUSIC algorithm. The array structure is shown in Figure 4. We select and as 4 and 2, respectively, for the validations. The pattern of single short dipole is shown in Figure 6(a), while the cylindrical conformal array pattern is displayed in Figure 6(b). Compared with the existing methods, adopting the geometric algebra will be more simple and intuitive. For the solved array pattern or manifold is the superposition of various elements, the proposed method can be applied to arbitrary array structures. This also proves the superiority of the rotor in solving conformal problems.
(a)
(b)
Next, the performance of the GAMUSIC algorithm is to be verified. We make some notations. Firstly, the absolute value of the differences between the estimated mean and the true value is regarded as the deviation. Secondly, the RMSE is utilized as the performance measure. Under these premises, 100 independent simulation experiments are carried out. The RMSE is defined aswhere are the estimates of elevation angles and azimuth angles, respectively, at th run. Wang’s method [2] and Qun’s method [4] are included for comparison.
Provided that there are three signals that can be received, the incident angles are (15°, 40°), (35°, 10°), and (60°, 65°), respectively. The corresponding polarization auxiliary angle and the polarization phase difference are (20°, 25°), (50°, 45°), and (65°, 65°). The snapshot, , is selected as 100. Figure 7(a) shows the simulation results of the GAMUSIC algorithm. The position of the spectrum peak represents the corresponding signal DOA. Intuitively, the estimation accuracy of the GAMUSIC algorithm is high.
(a)
(b)
We assume that there are nine distinct signals impinging on the cylindrical conformal array at the same time. The spatial spectra are shown in Figure 7(b). It is obvious that the method still works effectively when the number of incident signals is larger than that of the array elements.
Figure 8 displays the performance with a varying SNR from 0 dB to 30 dB. Among them, Figure 8(a) displays the relationship between SNR and deviation of DOA estimation, while Figure 8(b) reveals the CramerRao Lower Bound (CRLB) and the RMSE versus the SNR, respectively. It is clear that the deviation varies inversely with SNR. The higher the SNR, the lower the deviation. The trend of the variance of the CRLB with SNRs is the same as the RMSE, which is expected. Obviously, in the engineering design, the higher the SNR, the better the estimation performance that we can obtain. Note that, since statistical data have some randomness, the simulation curves in Figure 8(a) are not smooth and do not decline monotonically.
(a)
(b)
To proceed further, we increase the number of snapshots to 200 and leave the other conditions unchanged. The respective results are shown in Figure 9. Compared with Figure 8, both the deviation and CRB were improved. If we choose the point at some SNR, we can find that the CRB of Figure 8 is nearly twice as much as of Figure 9. For example, the CRB of Target 1 is −82.58 dB when the SNR is 20 dB as shown in Figure 8(b), while, in Figure 9(b), the value is −86.08 dB. In fact, these improvements can be predicted from the derivation of CRLB. For details on the specific derivation process, see the work of Stoica and Nehorai [15, 16]. The number of snapshots can be extracted from the Fisher information matrix. Moreover, the CRLB is found as the element of the inverse of that matrix. So, we can conclude that CRLB is inversely proportional to . Thus, the estimation precision will be higher.
(a)
(b)
Figure 10 shows the improvements of GAMUSIC over existing algorithms, such as Qun’s method [4] and Wang’s method [2]. We study the performance with a varying SNR from 0 dB to 30 dB and the performance with the number of snapshots varying from 100 to 1000, respectively. Without loss of generality, we select the first source (T1) and the second source (T2), respectively, to verify it. As shown in Figure 10(a), the proposed method outperforms Qun’s method by exploiting the polarization information of the received data. Moreover, the elliptic covariance matrix of the GAMUSIC is nonzero which increases the information utilization rates as well.
(a)
(b)
The RMSE of the GAMUSIC is close to that of the Wang’s method. The reason is that the estimation accuracy mainly depends on the steering vector. Both the Euler rotation angle and the geometric algebra can be used to derive the steering vector. As previously mentioned, the array manifold was obtained by using the rotor in this paper. However, in [2], Wang derived the array manifold by means of the Euler rotation angle. Therefore, in this case, both methods exhibit the same performance. From Section 3.2, we clearly know the GAMUSIC is superior to the Euler rotation angle in computational complexity.
Figure 10(b) illustrates the RMSE versus the number of snapshots with the SNR fixed at 20 dB. Compared with Figure 10(a), we can draw similar conclusions.
5. Conclusion
In this paper, we proposed a novel algorithm named GAMUSIC to estimate the DOA for cylindrical conformal array, which combines the geometric algebra with MUSIC. Compared with existing methods based on Euler rotation angle, it avoids complex matrix transformations and largely decreases the computational complexity. In contrast to the method introduced in the literature [8], our presented method has a strong commonality which can be used for arbitrary array structure. In addition, it can also be suited for the case that the number of polarized signals is larger than that of the array elements. At last, the simulated results verify the effectiveness of the GAMUSIC algorithm.
Appendix
Here, we derive the calculation process of (4).
Thus,
Up to the present, (4) has been obtained.
Competing Interests
The authors declare that they have no competing interests.
Acknowledgments
This project was supported by the National Natural Science Foundation of China (Grant no. 61302017).
References
 L. Josefsson and P. Persson, Conformal Array Antenna Theory and Design, IEEE Press Series on Electromagnetic Wave Theory, 2006.
 B.H. Wang, Y. Guo, Y.L. Wang, and Y.Z. Lin, “Frequencyinvariant pattern synthesis of conformal array antenna with low crosspolarisation,” IET Microwaves, Antennas and Propagation, vol. 2, no. 5, pp. 442–450, 2008. View at: Publisher Site  Google Scholar
 T. Milligan, “More applications of euler rotation angles,” IEEE Antennas and Propagation Magazine, vol. 41, no. 4, pp. 78–83, 1999. View at: Publisher Site  Google Scholar
 Q. Yang, X.Y. Cao, J. Gao, and W.Q. Li, “An algorithm of conformal array DOA estimation with unknown source number,” in Proceedings of the 3rd AsiaPacific Conference on Antennas and Propagation (APCAP '14), pp. 502–505, Harbin, China, July 2014. View at: Publisher Site  Google Scholar
 H. A. Burger, “Use of eulerrotation angles for generating antenna patterns,” IEEE Antennas and Propagation Magazine, vol. 37, no. 2, pp. 56–63, 1995. View at: Publisher Site  Google Scholar
 V. de Sabbata and B. K. Datta, Geometric Algebra and Applications to Physics, CRC Press, Boca Raton, Fla, USA, 2007. View at: MathSciNet
 L. Zou, J. Lasenby, and Z. He, “Pattern analysis of conformal array based on geometric algebra,” IET Microwaves, Antennas & Propagation, vol. 5, no. 10, pp. 1210–1218, 2011. View at: Publisher Site  Google Scholar
 L. Zou, J. Lasenby, and Z. He, “Direction and polarisation estimation using polarised cylindrical conformal arrays,” IET Signal Processing, vol. 6, no. 5, pp. 395–403, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 L. Dorst, D. Fontijne, and S. Mann, Geometric Algebra for Computer Science, Morgan Kaufmann, Boston, Mass, USA, 2007.
 J. Li and R. T. Compton Jr., “Angle estimation using a polarization sensitive array,” IEEE Transactions on Antennas and Propagation, vol. 39, no. 10, pp. 1539–1543, 1991. View at: Publisher Site  Google Scholar
 D. Hildenbrand, Foundations of Geometric Algebra Computing, Springer, Berlin, Germany, 2013. View at: Publisher Site
 G. A. Deschamps, “Techniques for handling elliptically polarized waves with special reference to antennas: part IIgeometrical representation of the polarization of a plane electromagnetic wave,” Proceedings of the IRE, vol. 39, no. 5, pp. 540–544, 1951. View at: Publisher Site  Google Scholar
 A. Nehorai and E. Paldi, “Vectorsensor array processing for electromagnetic source localization,” IEEE Transactions on Signal Processing, vol. 42, no. 2, pp. 376–398, 1994. View at: Publisher Site  Google Scholar
 R. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE Transactions on Antennas and Propagation, vol. 34, no. 3, pp. 276–280, 1986. View at: Publisher Site  Google Scholar
 P. Stoica and A. Nehorai, “MUSIC, maximum likelihood, and cramerrao bound,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 37, no. 5, pp. 720–741, 1989. View at: Publisher Site  Google Scholar  MathSciNet
 P. Stoica and A. Nehorai, “MUSIC, maximum likelihood, and CramerRao bound: further results and comparisons,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 38, no. 12, pp. 2140–2150, 1990. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2016 Minjie Wu 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.