Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations
In monopulse radar antennas, the synthesizing process of the sum and difference patterns must be fast enough to achieve good tracking of the targets. At the same time, the feed networks of such antennas must be as simple as possible for efficient implementation. To achieve these two goals, an iterative fast Fourier transform (FFT) algorithm is used to synthesize sum and difference patterns with the main focus on obtaining a maximum allowable sharing percentage in the element excitations. The synthesizing process involves iterative calculations of FFT and its inverse transformations; that is, starting from an initial excitation, the successive improved radiation pattern and its corresponding modified element excitations can be found repeatedly until the required radiation pattern is reached. Here, the constraints are incorporated in both the array factor domain and the element excitation domain. By enforcing some constraints on the element excitations during the synthesizing process, the described method provides a significant reduction in the complexity of the feeding network while achieving the required sum and difference patterns. Unlike the standard optimization approaches such as genetic algorithm (GA), the described algorithm performs repeatedly deterministic transformations on the initial field until the prescribed requirements are satisfied. This property makes the proposed synthesizing method converge much faster than GA.
Conventional approaches for synthesizing sum and difference patterns require the use of two separate element excitations for one monopulse radar antenna, for example, Taylor excitation  for sum pattern formation and Bayliss excitation  for difference pattern formation. Thus, these approaches require a feed network of considerable complexity [3–5].
Currently, this drawback of the conventional approaches can be overcome by using subarrays [6, 7] or another method known as common element excitations [8, 9]. Although these approaches allow a significant reduction in the complexity of the feeding network, they rely on the use of an optimization procedure, by either simulated annealing or genetic algorithm. Generally, the optimization algorithms depend on a successive improvement of randomly initialized patterns by applying more or less random variations, which are necessary to overcome local optima. Therefore, the optimization algorithms can be considered as trial-and-error methods and show a rather slow convergence due to the large number of unsuccessful trials .
In [11, 12], the complexity of the feeding network was simplified to only one attenuator and two phase shifters by controlling the amplitude and phase excitations of the side elements only, while keeping the excitation of the rest of array elements uniform.
This paper introduces a simple and fast algorithm for synthesizing sum and difference patterns with a number of common element excitations for the purpose of reducing the feeding network. For active antenna arrays, the element excitations can be implemented by using a number of digital attenuators and phase shifters. More number of elements results in a complex feeding network. Thus, higher sharing percentage in the element excitations results in lower complexity and cost. By using an iterative fast Fourier transform (FFT) with a specific constraints on the required element excitations and their corresponding radiation patterns, it is possible to reach a good compromise among the sum/difference patterns quality and the complexity of the required feeding networks. Unlike the current optimization approaches, the proposed method may be regarded as a deterministic method. Therefore, it delivers results much faster as compared to standard optimization approaches.
2. Description of the Method
Consider an array of an even number of isotropic elements that are equally spaced by . For sum beam pattern, the relation between antenna’s radiation and its corresponding element excitation can be written asand, for difference beam pattern, this relation can be given bywhere , representing the wavelength in free space, , representing the angle with respect to the direction normal to the array axis, and and are two separate sets of the excitation coefficients belonging to the corresponding sum and difference beam patterns, respectively.
It can be seen from these two equations that the element excitations and and their array patterns and are related together through FFT algorithm. In order to apply FFT, the antenna array is assumed to be linear with equally spaced elements. By using these relationships in an iterative manner with some constraints enforcing on the element excitation and sidelobe level, the required goal can be achieved. Specifically, we wish to calculate the coefficients, and , so that the corresponding sum and difference beam patterns have a prescribed sidelobe requirements and, at the same time, these two sets have a number of common element excitations. To design such antenna patterns we adopted an iterative fast Fourier transform method [13, 14]. First, we started to calculate the sum and difference patterns assuming some initial values for the coefficients, and (i.e., for we used uniform excitation and for we used odd linear excitation). Since we are using amplitude-only synthesis, the phase of the element excitation is unchanged and thus its value is made to be equal to that of the initial excitation.
As we mentioned earlier, for linear arrays with equally spaced elements, the radiation pattern and its corresponding element excitation are related together by an inverse Fourier transformation. The algorithm starts by updating the sum and difference patterns of the corresponding initial excitations in an iterative manner using 4096-point inverse FFT. During each update, only the sidelobe values that exceed the prescribed sidelobe are modified, and the other sidelobe values are left unchanged. After this modification, a direct 4096-point FFT is performed on the adapted sum and difference patterns to get two new sets of the excitation coefficients and . Note that the length of vectors and is extended using zero padding. Then, from those 4096 excitation coefficients, only the samples belonging to the array are retained.
The constraints on the element excitations are performed by replacing the values of a number of the element excitations of the synthesized sum pattern to be equal to that of the synthesized difference pattern.
It is worth mentioning that the constraints are applied to a certain number of element excitations of the corresponding sum pattern (this means that the rest of the element excitations of the synthesized difference pattern remains unchanged). Finally and after applying these element excitation constraints, the fast Fourier transform is performed to get new sum and difference patterns.
3. Simulation Results
To validate the effectiveness and the convergence speed of the described method, a number of numerical experiments have been performed on a 2.4 GHz Laptop equipped with a 4 GB of RAM. In the following examples, the synthesis of equally spaced linear arrays composed of and elements is considered.
As a first example, the iterative FFT algorithm is used to synthesize sum and difference patterns to reach a prescribed sidelobe requirement. In this case, the required sidelobe level of both patterns is chosen to be −24 dB. Note that, in this example, none of the constraints have been applied to the element excitation, that is, and have no common excitation. The results are shown in Figure 1. This figure also shows the corresponding element excitations for both patterns. Clearly, implementing such antenna with these two separate excitations (i.e., no common excitations) requires a considerable complexity in the feeding network. More importantly, these two excitations tend to be approximately equal at the side elements of the array. This feature can be highly exploited in the proposed method as can be seen in the following examples.
In the second example, both radiation patterns are resynthesized subject to twelve common amplitude excitations (i.e., 60% of the overall number of array elements is shared for synthesizing sum and difference patterns). The resulting element excitations and the corresponding array patterns are shown in Figure 2. In this case, the element excitations for the difference pattern are kept unchanged (i.e., the same as in Figure 1(b)), while the element excitations corresponding to the sum pattern are modified according to the above-mentioned constraints. Accordingly, a new sum pattern with some changes in its sidelobe structure is noticed (see Figure 2(a)). However, the main beam shape of the new sum pattern is maintained undistorted. Although the sidelobe level (SLL) of the resulting sum pattern is higher than the prescribed SLL requirements, the complexity of the feeding network is reduced to more than half with respect to the conventional case (i.e., two separate element excitations for sum and difference pattern with no common excitations).
The sidelobe level (SLL), beam width (BW), taper efficiency, and runtime for these aforementioned two cases (i.e., no common excitations and 60% common excitations) and for other cases that use different percentage of sharing excitations are reported in Table 1.
It is worth mentioning that the taper efficiency is defined as follows:where represents the element excitations, whereas the sidelobe level (SLL) is defined as the highest peak level of all side lobes which is usually the closest one to the main beam.
From this table, it can be remarked that the greater the percentage of sharing excitations, the poorer the SLLs of the corresponding sum patterns. Nevertheless, the taper efficiency is slightly increased, and the beam width is significantly decreased when increasing the percentage of sharing excitations.
As mentioned in the previous example, the excitations of the difference pattern were fixed, whereas the excitations of the sum pattern are constraints to 60% of common excitations. Accordingly, the SLL in the resulting sum pattern was increased. However, this pattern is crucial in the radar applications. Thus, it is desirable to keep its peak sidelobe at low level. By using the proposed method, the excitations of the sum pattern can be easily fixed while those for the difference pattern can be constraints. As with the previous example, 60% of common excitations are used. The resulting element excitations and the corresponding array patterns are shown in Figure 3. As can be seen, the sum pattern is capable of providing a required SLL which is chosen to be at −24 dB, while the difference pattern can provide SLL about 8 dB above the prescribed SLL requirement. However, this sacrifice in the SLL in the difference pattern comes at the good profit in the feeding network.
In the next example, the convergence speed of the iterative FFT algorithm is compared to the standard GA. For fair comparison, it is assumed that the initial excitations or populations for both algorithms are uniform. In addition, the updating processes of these two algorithms are terminated immediately after reaching the allowed number of iterations or prescribed SLL value. In Figure 4, the variations of the maximum SLL, which starts from the initial value of −13.2 dB and ends when reaching the required value of −24 dB, are shown as a function of the iteration number. From this figure, it can be seen that the iterative FFT algorithm is much faster than the solution obtained by GA. Clearly, the described method requires the numerical evaluation of about 4 iterations whereas the GA requires about 100 generations of 8 individuals per generation. Here, we used a standard continuous GA, which uses single point crossover and roulette wheel selection.
In the last example, the synthesis of sum and difference patterns with required dB and elements is considered. For no-common-excitation case, the radiation patterns and the corresponding element excitations are shown in Figure 5. Then, both radiation patterns are resynthesized subject to 50% common excitations. The resulting element excitations and the corresponding array patterns are shown in Figure 6. In this case, the element excitations for the sum pattern are fixed, while those corresponding to the difference pattern are modified according to the above-mentioned constraints. It can be seen that the SLL in the resulting difference pattern was changed from −35 dB to −30.3 dB. Also, the slope near to the boresight is found to be 12.23 dB/degree. For the sum pattern, the 3 dB beam width and the taper efficiency are 0.8283 and 1.317°, respectively. Moreover, the runtime required to synthesize the above example was about 0.2718 seconds.
4. Feeding Network Complexity
The feeding network complexity and cost are the main challenging issues in practical implementation of the tracking array antennas. Since the amplitude-only control of the element excitation is considered in this study, therefore the complexity and cost in terms of required numbers of amplifiers or attenuators are considered.
The required number of attenuators needed in implementing the feeding network of the sum and difference patterns under different percentage of sharing excitations is reported in Table 2. From this table, it can be seen that, for a tracking antenna with elements, the total number of the required attenuators for synthesizing sum and difference patterns under the case of no sharing excitation is 40 attenuators, while this number is reduced to 30 attenuators under 50% of sharing excitation and it is further reduced to only 25 attenuators under 75% of sharing excitation. This reduction in the complexity becomes more significant especially for larger array elements. Moreover, if the array elements possess even symmetry about the center of the monopulse array, the number of attenuators required and the computational time are halved.
It has been shown that it is possible to generate both sum and difference patterns with a certain number of common excitations. The complexity of the feeding network can be significantly reduced with respect to that case of separate (no sharing) excitations. This reduction comes at the cost of changing the peak SLL in the sum pattern or in the difference pattern. The results show that the greater the percentage of sharing excitations, the poorer the SLLs of the corresponding beam patterns. Thus, the designer needs to trade off between the required sidelobe level and the feed network’s complexity.
More importantly, the proposed method converges 100 times faster than the standard GA because the core calculations were based on direct and inverse fast Fourier transforms.
The method can be easily extended to synthesize other patterns such as flat-top beam and pencil beam with common element excitations. Moreover, the principle of the proposed approach may be also extended to the planar arrays having different shapes such as rectangular and circular with uniform element spacing.
Conflicts of Interest
The author declares that they have no conflicts of interest.
T. T. Taylor, “Design of circular apertures for narrow beamwidth and low sidelobes,” IEEE Transactions on Antennas and Propagation, vol. 8, no. 1, pp. 17–22, 1960.View at: Google Scholar
M. Alvarez-Folgueiras, J. Rodriguez-Gonzales, and F. Ares-Pena, “Optimal compromise among sum and difference patterns in monopulse antennas: use of subarrays and distributions with common aperture tail,” Journal of Electromagnetic Waves and Applications, vol. 23, pp. 2301–2311, 2009.View at: Google Scholar
M. Alvarez-Folgueiras, J. Rodriguez-Gonzales, and F. Ares-Pena, “Synthesizing taylor and bayliss linear distributions with common aperture tail,” Electronics Letters, vol. 45, no. 11, pp. 18–19, 2009.View at: Google Scholar