- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

International Journal of Antennas and Propagation

Article ID 316962

## An Improved Antenna Array Pattern Synthesis Method Using Fast Fourier Transforms

^{1}Institute of Electronics, Chinese Academy of Sciences, Beijing 100190, China^{2}University of Chinese Academy of Sciences, Beijing 100190, China

Received 21 April 2014; Revised 18 August 2014; Accepted 22 August 2014

Academic Editor: Michelangelo Villano

Copyright © Xucun Wang 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

An improved antenna array pattern synthesis method using fast Fourier transform is proposed, which can be effectively applied to the synthesis of large planar arrays with periodic structure. Theoretical and simulative analyses show that the original FFT method has a low convergence rate and the converged solution can hardly fully meet the requirements of the desired pattern. A scaling factor is introduced to the original method. By choosing a proper value for the scaling factor, the convergence rate can be greatly improved and the final solution is able to fully meet the expectations. Simulation results are given to demonstrate the effectiveness of the proposed algorithm.

#### 1. Introduction

In order to solve complex antenna pattern synthesis problems, various methods using various optimization algorithms have been developed. In [1], a quadratic program is formed for arbitrary array pattern synthesis. In [2], a convex optimization problem [3] is formulated for pattern synthesis subject to arbitrary upper bounds. For certain cases, the convex programming problem can be reduced to a linear programming problem [4]. In [5] an effective hybrid optimization method is proposed for footprint pattern synthesis of very large planar antenna arrays [6]. The methods mentioned above all adopt conventional optimization algorithms [7]. Global optimization algorithms such as genetic algorithms [8–10] and particle swarm optimization algorithms [11–13] have also been successfully applied in pattern synthesis problems. To approximate the desired pattern for an array, we need to discretize the angular space. The bigger the elements number is, the greater the required discrete density needs to be. Usually, the computational complexity would grow greatly as the elements number increases. As a consequence, normal synthesis techniques using local or global optimization algorithms are usually not suitable for large planar arrays.

As we know, fast Fourier transforms (FFT) are able to quickly compute the radiation pattern of an array with periodic structure. Once the number of FFT points is specified, the computation time is barely affected by the element number. In [14], an FFT method suitable for large planar arrays is proposed. The operation is very straightforward, which mainly involves direct and inverse fast Fourier transforms. In [15], a modified iterative FFT technique is proposed for leaky-wave antenna pattern synthesis. In [16], FFT is used for the pattern synthesis of nonuniform antenna arrays. The iterative FFT method is very efficient as shown in [14], and many examples are presented, but why the method is effective has not been explained.

In this paper, both theoretical and simulative analyses of the FFT method are presented. It is found that, though effective, it is a slow-convergence method and can hardly converge to the optimum solution. Based on the analyses, we introduce a scaling factor and the performance can be greatly improved.

#### 2. Original FFT Method for Pattern Synthesis

First, we establish the relationship between a certain point in the FFT result and the corresponding angle of the radiation pattern. Consider a planar array with elements arranging in a rectangular grid and spacing and between rows and columns. Assume the element pattern is isotropic. The array factor is given by where is the complex excitation of the th element and is the wavelength. If the coordinates are used, the array pattern can be written as Performing points 2D inverse fast Fourier transform (IFFT) on the excitations, we get If we want to represent the array factor using , then the coordinates and are related by where and are integers, making sure both sides of the equations have the same value range. Suppose that both and are even numbers. Define Combining (4) and (5) and considering the value ranges of and , we have So, the relation between the array factor and the IFFT of the array excitation is Finally, the visible space is given by Note that the indices change in (5) is in fact the fftshift operation in Matlab.

Once the corresponding relationship is established, the procedure of the FFT method for pattern synthesis is given as follows.(1)Specify dimension of the array , the initial excitation , the FFT points , and the maximum iteration times .(2)Perform IFFT on the excitation of the th iteration and obtain the array factor .(3)Extract the amplitude and phase of .(4)Compare with the desired pattern . If the computed pattern fully meets the requirements or the maximum iteration time is reached, terminate the procedure; otherwise go to the next step.(5)Obtain the new pattern by replacing the undesired with as follows: where is a set containing all the points where the pattern is undesired. For example, if is a point within the side lobe region and , then it means that the side lobe level exceeds the desired level and that .(6)Perform points 2-D FFT on and choose the first points as the initial excitation for the next iteration . Constraints can be easily made for amplitude-only or phase-only synthesis.(7)Go to step .

The procedure is also illustrated in Figure 1.

#### 3. Algorithm Analysis

The procedure is simple yet effective. In this section, the method is carefully examined. Without loss of generality, take an -element linear array for example. Suppose that in the th iteration the excitation sequence is which has been extended to points by zero padding. is the number of the FFT points. After comparing the obtained pattern with the desired pattern, we can obtain the error pattern . Now we will find the relation between the error pattern in the next iteration and . It is difficult to precisely compute through the above assumption. Let be the corresponding error excitation for . Then where contains points. Consider the elements in If the set only contains points representing the side lobe region, then the magnitude values of the elements in are very small, as well as . So the variation in from is very little. Then we can use as the desired pattern in the th iteration and obtain the error pattern

For complex weighting using both amplitude and phase, is given as where is a sequence by setting the first elements in to zero. So As a result, we have where denotes the -norm.

It is seen from (15) that the method has the ability to converge. However, as increases the difference between and decreases. We can conclude that the method has a lower converge rate for larger FFT points. For amplitude-only synthesis, the analysis is similar and (15) still holds. For phase-only analysis, the excitation of the th iteration is where is the given amplitude. Since the magnitude value of can be very small compared to , can be approximated by So the convergence properties are similar to amplitude-only or complex tapering.

To verify our analysis, we will give an example. Consider a linear array with 60 elements spacing by half wavelength. For the amplitude-only synthesis, the desired pattern has a maximum side lobe level of −40 dB. For the phase-only case, the maximum side lobe level is −18 dB. We use the uniform taper as the initial excitation and set the maximum iteration number to 5000 and 10000 for the two cases, respectively. Figure 2 shows the convergence properties of the norm of the error pattern. We can see that the method has a low convergence rate, as it converges logarithmically in the latter part of the iteration. We can also see that the bigger the FFT points number is, the lower the method converges. Figure 2 also illustrates that although the norm of the error pattern can converge to a very low value, it does not reach zero. It means that the method can hardly synthesize a pattern that fully meets the requirements of the desired pattern.

#### 4. Improved FFT Method for Pattern Synthesis

For planar arrays, the elements in the error pattern are given by First we divide into and , which are the sets representing the side lobe region and the main lobe region, respectively. When , and the value tends to converge towards zero more slowly as the procedure iterates. So, to change the slowly varying characteristics, we propose the following updating equation for the error pattern: where is a scaling factor within the range . The smaller the value of is, the more intense the excitation changes. In (19), when , the error pattern remains unchanged, since for main lobe shaping synthesis, we need to approximate to a certain error level, whereas in the side lobe region, only is required. So, the final updating equation replacing (9) is given by

To analyze the convergence properties of the proposed method, we still use the prior examples and consider a linear array with 60 elements spacing by half wavelength. The maximum iteration times are 5000 and 10000 as before. As illustrated in Figures 3 and 4, although the curves are not smooth, the norm of the error pattern can converge to zero for all the cases. In both figures, we can also see that the iteration times of the case are much less than that of . Figures 5 and 6 show the influence of value on the maximum iteration times and the array directivity. It is shown that as grows near one, the iterations times increase rapidly but the directivity only changes a little. So we can say that the proposed method can give a good performance by setting to zero. The radiation patterns obtained using are shown in Figure 7, where is measured from one end of the linear array to the other end.

#### 5. Example for Planar Array Pattern Synthesis

Consider a planar array with elements spacing by in both directions. The desired pattern has a maximum side lobe level of −40 dB and two −60 dB notches at rectangular sectors and . The procedure suggested in [14] is adopted. First the points FFT is used. At the following two phases, and points FFT are performed, with the previous results being the initial excitations for the next phase. At each phase, the maximum iteration time is 1000, and the scaling factor is set to zero. Figure 8 gives the convergence property of the number of undesired radiation points. It shows that, after the previous two phases, the final phase converges very quickly.

The 1D radiation patterns containing the two notch sectors are shown in Figure 9. Figure 10 presents the 2D radiation pattern, where the visible space is determined by (8). The normalized amplitude and phase of the excitations are given in Figure 11.

#### 6. Conclusion

The iterative FFT method is capable of synthesizing a large planar array. In this paper, the method is validated by theoretical and simulative analyses. But the original method has a low convergence rate, and the synthesized results are usually unable to achieve the optimal solution. A scaling factor is introduced to form an improved method, which can avoid the drawbacks of the original method. Analysis and simulation results showed the effectiveness of the improved method.

#### Conflict of Interests

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

#### References

- B. P. Ng, M. H. Er, and C. Kot, “Flexible array synthesis method using quadratic programming,”
*IEEE Transactions on Antennas and Propagation*, vol. 41, no. 11, pp. 1541–1550, 1993. View at Publisher · View at Google Scholar · View at Scopus - T. Isernia, P. D. Iorio, and F. Soldovieri, “An effective approach for the optimal focusing of array fields subject to arbitrary upper bounds,”
*IEEE Transactions on Antennas and Propagation*, vol. 48, no. 12, pp. 1837–1847, 2000. View at Publisher · View at Google Scholar · View at Scopus - S. Boyd and L. Vandenberghe,
*Convex Optimization*, Cambridge University Press, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - O. M. Bucci, L. Caccavale, and T. Isernia, “Optimal far-field focusing of uniformly spaced arrays subject to arbitrary upper bounds in nontarget directions,”
*IEEE Transactions on Antennas and Propagation*, vol. 50, no. 11, pp. 1539–1554, 2002. View at Publisher · View at Google Scholar · View at Scopus - F. Ares, J. Fondevila-Gomez, G. Franceschetti, E. Moreno-Piquero, and J. A. Rodriguez-Gonzalez, “Synthesis of very large planar arrays for prescribed footprint illumination,”
*IEEE Transactions on Antennas and Propagation*, vol. 56, no. 2, pp. 584–589, 2008. View at Publisher · View at Google Scholar · View at Scopus - D. H. Schaubert, A. O. Boryssenko, A. van Ardenne, J. G. B. de Vaate, and C. Craeye, “The square kilometer array (SKA) antenna,” in
*Proceedings of the IEEE International Symposium on Phased Array Systems and Technology*, pp. 351–358, October 2003. View at Publisher · View at Google Scholar - J. Nocedal and S. J. Wright,
*Numerical Optimization*, Springer, New York, NY, USA, 2006. View at MathSciNet - F. J. Ares-Pena, J. A. Rodriguez-Gonzalez, E. Villanueva-Lopez, and S. R. Rengarajan, “Genetic algorithms in the design and optimization of antenna array patterns,”
*IEEE Transactions on Antennas and Propagation*, vol. 47, no. 3, pp. 506–510, 1999. View at Publisher · View at Google Scholar · View at Scopus - D. Marcano and F. Durán, “Synthesis of antenna arrays using genetic algorithms,”
*IEEE Antennas and Propagation Magazine*, vol. 42, no. 3, pp. 12–20, 2000. View at Publisher · View at Google Scholar · View at Scopus - L. Shi, Y. Deng, H. Sun, R. Wang, J. Ai, and H. Yan, “An improved real-coded genetic algorithm for the beam forming of spaceborne SAR,”
*IEEE Transactions on Antennas and Propagation*, vol. 60, no. 6, pp. 3034–3040, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus - W. T. Li, X. W. Shi, and Y. Q. Hei, “An improved particle swarm optimization algorithm for pattern synthesis of phased arrays,”
*Progress in Electromagnetics Research*, vol. 82, pp. 319–332, 2008. View at Publisher · View at Google Scholar · View at Scopus - K. V. Deligkaris, Z. D. Zaharis, D. G. Kampitaki, S. K. Goudos, I. T. Rekanos, and M. N. Spasos, “Thinned planar array design using boolean PSO with velocity mutation,”
*IEEE Transactions on Magnetics*, vol. 45, no. 3, pp. 1490–1493, 2009. View at Publisher · View at Google Scholar · View at Scopus - T. H. Ismail and Z. M. Hamici, “Array pattern synthesis using digital phase control by quantized particle swarm optimization,”
*IEEE Transactions on Antennas and Propagation*, vol. 58, no. 6, pp. 2142–2145, 2010. View at Publisher · View at Google Scholar · View at Scopus - W. P. M. N. Keizer, “Fast low-sidelobe synthesis for large planar array antennas utilizing successive fast fourier transforms of the array factor,”
*IEEE Transactions on Antennas and Propagation*, vol. 55, no. 3, pp. 715–722, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. L. Gomez-Tornero, A. J. Martinez-Ros, and R. Verdu-Monedero, “FFT synthesis of radiation patterns with wide nulls using tapered leaky-wave antennas,”
*IEEE Antennas and Wireless Propagation Letters*, vol. 9, pp. 518–521, 2010. View at Publisher · View at Google Scholar · View at Scopus - K. Yang, Z. Zhao, and Q. H. Liu, “Fast pencil beam pattern synthesis of large unequally spaced antenna arrays,”
*IEEE Transactions on Antennas and Propagation*, vol. 61, no. 2, pp. 627–634, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus