Abstract

This paper proposes a 2D pattern synthesis algorithm for cylindrical array. According to the geometric characteristic of cylinder, we can regard a cylindrical array as an equivalent linear array whose elements are identical circular subarrays. Therefore, the beam pattern can be obtained by the product of the array factor of linear array and beam pattern of circular subarray. Then, the 2D beamforming can be realized by two 1D beamforming processes. We can prove that the complex excitation vector of a cylindrical array is the Kronecker product of linear array’s weight vector and circular array’s weight vector. By this algorithm of decomposition and reconstruction, the computational complexity of 2D beamforming could be significantly reduced. Finally, simulation results further illustrate the validity of the proposed method.

1. Introduction

Conformal arrays can be commodiously mounted on a curved surface of platforms, such as aerial vehicles and fighter aircraft, and provide aerodynamic shape compatible with the corresponding fuselage. This conformal design leads to an excellent aerodynamic performance and thus has an extremely wide range of applications due to its advantages of low radar cross section (RCS), large surveillance coverage, and volume saving [1]. Although conformal arrays are widely used in many areas, the pattern synthesis of such arrays is still a challenge because of the complexity induced by the unusual configuration. For the arrays, the simple characteristics associated with linear or planar arrays do not hold, and most of the conventional methods would not work.

In the recent years, pattern synthesis of conformal arrays has attracted increasing attention and a wide variety of techniques have been developed for the pattern synthesis of conformal arrays. In [2], Bucci et al. propose a method to solve the pattern synthesis problem of arbitrary planar array. They alternately found the projection on the upper and lower bounds of the desired pattern to control the shape of main lobe and the side lobe level (SLL). Afterwards, the method was extended to conformal arrays. Considering the embedded element radiation pattern, Steyskal used it in a conformal wing array [3]. Tseng and Griffiths provide a new iterative method in [4] to achieve the desired beam pattern of arbitrary arrays by controlling the side lobe peaks. But the number of side lobe peaks that it can control is limited. In [5], Vaskelainen presents an iterative least-squares method by assigning different weight values to different directions. He further presents a modified least-squares optimization method with linear constraints in [6] to obtain a prescribed shape of main lobe. In [7], Olen and Compton propose another method based on adaptive array theory. In this method, they first set excessive artificial interference signals in observation area outside the main lobe and then adaptively adjust the intensities of these interference signals to control the side lobe level. In [8], Zhou and Ingram improve the method above. They only allow iterations occurred in the main lobe and among side lobe peaks. The method can provide more convenient main lobe shape control, but finding the location of side lobe peaks might increase computational complexity. In [9], Guo et al. use linearly constrained minimum variance (LCMV) criterion to achieve the desired beam pattern with a flat top main lobe. Dohmen et al. give a synthesis method of conformal array in [10] to design both the copolarized and cross-polarized patterns. In [11], Zou et al. present an adaptive beamforming method with low level of polarization components based on geometric algebra. The synthesis problem of an arbitrary array antenna can be seen as a general optimization problem. Therefore, intelligent optimization algorithms can also be used to solve this problem. Genetic algorithms (GA) are applied to complete this kind of optimization in [12, 13]. Simulated annealing and particle swarm optimization (PSO) also have good performance of global optimization and are used in the area of pattern synthesis [14, 15].

Most of these methods are applied to general conformal arrays and need an iterative process. The computational complexity is acceptable in 1D condition. However, the amount of calculation will significantly increase when they are applied to 2D beamforming. Some researchers have realized this problem and began to find fast algorithms [16]. Nevertheless, the structure information is not taken into consideration. Most of the conformal arrays have regular structures which may be helpful to the array beamforming. In [17], the authors indicate that the cylindrical array can be treated as a linear array while beamforming. However, they did not touch upon the 2D beamforming problem.

In this paper, we present a new method to solve the 2D beam pattern synthesis for cylindrical arrays. According to the geometry feature of cylinder, we treat the cylindrical array as an equivalent linear array whose elements are identical circular subarrays. Since the linear array and circular array are orthogonal to each other, 2D beam pattern of the array in elevation and azimuth direction will be mainly affected by linear and circular arrays, respectively. Therefore, the 2D beamforming process can be realized by two individual 1D pattern syntheses of the circular and linear arrays successively. Through this process, the new method can greatly decrease the amount of computation of 2D beamforming for cylindrical arrays.

2. Problem Formulation

Consider a cylindrical array consisting of elements; the sketch map can be seen in Figure 1. and are the number of elements contained in each line and circle. is the global Cartesian coordinate system, while is the local system, and is the central angle of the th element. The far-field beam pattern in the generic direction can be written as in which and are the azimuth and elevation, is the complex excitation voltage of the th element, is the phase constant, and is the antenna gain of the th element with its local direction associated with the global direction . is the position vector of the th element, while is the unit vector in the direction .

Since the array is conformal to a curved surface, the antenna elements generally direct their radiation beams toward different directions. Therefore, the transformation between the global coordinate system and the element local coordinate system needs to be carried out to calculate the contribution of each element to the whole conformal array radiation, which is shown as follows:

The Euler rotation matrix is a very useful tool for this spatial rotation transformation [18]. The corresponding rotation matrix can be written as where are three Euler rotation angles of the axes , , and , respectively. And then, the spatial rotation transformation can finally be written as

For a cylindrical array, the maximal radiation of antenna is along the normal direction at most of the time; the coordinate transformation process can be expressed as

Without considering the coordinate shift, the rotation angles in (3) are in this case, where is the corresponding central angle of the th element.

3. 2D Beamforming for Cylindrical Arrays

In a planar array, the array factor and the element pattern are separable, but this condition does not hold for the case of a general conformal array. Consider the structure characteristic of cylindrical array; it consists of a series of identical circular arrays and the whole array can be seen as an equivalent linear array whose elements are these identical circular subarrays. Therefore, the array beam pattern can still be obtained by the principle of pattern multiplication. And then, the 2D beam pattern of cylindrical array can be expressed by the following formula: where is the array factor of the linear array and is the beam pattern of the circular subarray which is used as the element pattern here. Assume that the complex excitation vector of linear array and circular array are and , respectively. Then, the beam pattern and can be written as where and are the ideal steering vector of the linear array and the circular array and . The symbol represents a diagonal matrix with diagonal entries . Define the equivalent steering vector , and from (6), (7), and (8), beam pattern in (1) can be rewritten as follows: in which is the steering vector of the whole cylindrical array and its weight vector can be obtained as follows: where “" denotes the Kronecker product.

Since the array factor of linear array is identical in azimuth, it can be simplified as . Moreover, since the linear array and circular array are orthogonal to each other, the beam pattern in the azimuth direction is mainly determined by the circular subarrays. Therefore, the 2D beam pattern can be decomposed into two 1D beamforming processes, one in the azimuth direction and one in the elevation direction. In order to achieve the desired 2D beam pattern , we first carry out beamforming for circular subarray to achieve the given SLL in azimuth and then obtain the weight vector which can satisfy the following equation:

And then, is used as the element pattern in the beamforming for linear array in the direction of elevation to obtain the weight vector which can satisfy the following equation:

The weight vector for the 1D pattern synthesis can be obtained based on an adaptive array method as follows [7]: where is the look direction, while and , are the power of noise and artificial interference signals, respectively. Through the following iteration, the optimal weight vector can be obtained to approach the desired beam pattern: where denotes the th iteration, , and is the desired beam pattern.

Since the radiation of array element is not isotropic, some elements may have little contribution to the look direction. And consequently we ignore these elements in the beamforming process to further decrease the computational complexity. In most cases, elements radiate outwards around the normal direction, so we only use the elements in an area around the look direction, and the subarray becomes a circular arc array as shown in Figure 2. The solid ones represent the used elements and the circle ones represent the ignored elements.

From the above, the proposed algorithm can be summarized as follows.(1)Consider a cylindrical array consisting of identical elements with their identical pattern . Select the contributive elements as shown in Figure 2, and carry out the beamforming process for the circular arc array in azimuth with the fixed elevation . Through the iteration of (13) and (14), the weight vector of circular subarray and its 1D beam pattern can be obtained.(2)Calculate the beam pattern of circular subarray by (8). Use it as the element pattern in the M-element linear array and similarly carry out the beamforming process in elevation with the fixed azimuth .(3)After getting and for the circular and linear arrays, respectively, the weight vector of the cylindrical array can be obtained by (10), and then the 2D beam pattern can be obtained by (9) as well.

From the above, we can see that the practically used array is a part of a complete cylindrical array. Actually, the proposed method can be applied to any conformal array with similar structure that it can be seen as an equivalent linear array whose elements are identical subarrays.

4. Results and Discussions

In this section, simulations are provided to illustrate the effectiveness of the proposed method. Consider a uniform cylindrical array with and as shown in Figure 1. The space between neighboring elements is half wavelength. Each element is assumed to have the same pattern function , and in their respective local coordinate system. Since the attenuation of the pattern is more than 10 dB at in the local coordinate system and this angle is in the global coordinate system, the contributive element we choose to carry out the uniform circular array beamforming is in the area and others are ignored with this element pattern. Without loss of generality, we assume that the look direction is . Then, the number of actually used elements in the uniform circular array beamforming is 11 in following simulations. The desired beam pattern is defined by the main lobe beamwidth between first nulls (50°) and side lobe level (−40 dB). The interested angle area is with its scan step 1°.

First, we carry out beamforming for the 11-element arc array. The artificial interferences are set with an interval of 3° and the same below. After 100 iterations, the weight vector is obtained and its beam pattern is shown in Figure 3. Consequently, can be obtained and is used as the element pattern for the following 8-element uniform linear array beamforming in the elevation direction. The process is similar to the above and iteration number is also set to be 100. Figure 4 shows the final 1D beam pattern in the elevation direction.

After getting the weight vectors and , the whole weight vector of the practically used conformal array can be calculated and so is the 2D beam pattern as shown in Figure 5. Figures 6 and 7 show its projections in azimuth and elevation directions, respectively. Obviously, they coincide with the 1D beam pattern we obtained above, which well supports the analyses above. It can be seen from the figures that the finally obtained beam pattern can successfully achieve the prescribed beam pattern response.

The method in [9] is also performed for the 2D beamforming for cylindrical array in the same condition. With the same interval, there will be artificial interferences. Result can be seen in Figure 8 which is similar to the above. However, the amount of computation is more than that of the proposed method. Figure 9 shows the normalized weights obtained by the two methods, where method 1 denotes the proposed method and method 2 denotes the method in [9].

In the pattern synthesis, the calculation mainly focuses on the spatial rotation transformation, the update of the power of artificial interferences, and matrix inversion. In our method, the whole process is mainly composed of two 1D beamforming processes. There are 61 interferences for the beamforming of each of azimuth and elevation. Assume that the number of iterations is L. Then, to get the final optimal weight vector , we need to calculate rotation transformation times, matrix inversion times and interference power times. Moreover, the size of matrix inversion is small ( and ). Meanwhile, if the method in [9] is directly applied to the 2D pattern synthesis of this cylindrical array, then we need to calculate rotation transformation times, matrix inversion times and interference power times. The size of matrix inversion is . The number of artificial interferences and size of matrix are the main reason for the large amount of calculation. Our method can significantly reduce both of them and hence reduce the amount of calculation. Moreover, with the increase of array element number, the amount of computation will be rapidly increasing for those direct 2D beamforming algorithms, while our method will not. More scenarios are simulated to verify the proposed algorithm. With the Intel (R) Core (TM) i5 CPU 2.4 GHz and 4 GB RAM, the elapsed time of getting the optimal weight vector for both the proposed method and the method in [9] is shown in Table 1.

and in Table 1 are the elapsed time for the proposed method and the method in [9], respectively. Although the elapsed time may be affected by the computing environment and some parameters of the conformal array, there is no doubt that our method has greatly reduced the amount of calculation without performance degradation.

5. Conclusion

In this paper, an efficient 2D beamforming method is proposed for cylindrical arrays. According to the geometry characteristics, a cylindrical array can be seen as an equivalent linear array composed of identical circular subarrays, so that the principle of pattern multiplication can be applied and 2D pattern synthesis process can be realized by two 1D pattern syntheses based on the linear and circular arrays, respectively. This method avoids the complicated calculation of 2D beam pattern and can significantly reduce the amount of computation. Furthermore, the proposed method can be applied to any similar conformal arrays which can be seen as a linear array whose elements are identical subarrays. Effectiveness of the algorithm has been illustrated by the above simulations.

Acknowledgments

This work is supported by China Postdoctoral Science Foundation Grant no. 20100480680 and the Natural Science Foundation of Anhui Province Grant no. 1208085QF105.