Research Article | Open Access
Scalable Alternating Projection and Proximal Splitting for Array Pattern Synthesis
Array synthesis with embedded element patterns is a problem of great practical importance. In this paper, an array pattern synthesis method using scalable alternating projection and proximal splitting is proposed which considers the scaling invariance property of design specifications and constraints for the amplitudes of pattern and excitation. Under the framework of alternating projection, the scalable pattern and excitation constraint sets are first defined. Then the scalable pattern projection and iterative procedure for optimum pattern scaling factor are studied in detail. For the scalable excitation projection, it is designed as the solution to a constrained weighted least mean squares optimization, which can be solved by an effective forward-backward splitting iterative process. Finally, the selection of the weighted matrix and computational complexity are discussed briefly. Several typical linear and planar synthesis examples with or without the embedded element patterns are provided to demonstrate the effectiveness and power of the proposed method.
The synthesis problem for array antennas can be loosely defined as the inverse of the analysis problem, that is, to determine the element excitations and possibly the lattice geometry, so that the array radiation pattern or the excitations satisfy some prescribed requirements. It is a vast subject in the antenna research, which has applications in fields, such as radar, sonar, radio astronomy, and satellite communications .
There are many methods to synthesize a desired pattern. The early history of the synthesis algorithm could date back to Woodward-Lawson method , which was firstly presented for linear arrays, and then extended to the circular and planar arrays. The synthesis methods in this stage established the basic pattern decomposition theory, using expanding characters of Fourier series and Bessel function and solving the question with some energy optimization ways. Yet, poor controls for side lobe levels (SLLs) and ripples in the desired coverage are the common problems for these early methods, so some algorithms using Taylor or Chebyshev distribution as aperture current distribution made a great effect on solving them next stage [3, 4]. However, these Taylor or Chebyshev synthesis methods have some drawbacks. The applied array should be a circle or rectangle, and this would be difficult to apply during most synthesis procedures. Today, iterative methods based on optimization techniques are very powerful tools for pattern synthesis thanks to the modern computer. There are many types of random optimization methods that have been applied to antenna synthesis problems, such as genetic algorithm, differential evolution, simulated annealing, and particle swarm optimization [5–8]. These optimization methods are computationally expensive and they are not effective in large arrays because a large number of particles must be needed in these situations.
Alternating projection (AP) is an extremely powerful and versatile procedure for synthesizing the excitation of very general antenna structures [9, 10]. The synthesis problem is formulated as the search of the intersection of sets and is solved by an iterative projection method. On the other hand, the least mean squares (LMS) or weighted least mean squares (WLMS) method is popular in array synthesis , which formulates pattern of array in matrix form and minimizes the difference of realized pattern and desired pattern in LMS sense. A variation of the LMS method is described in , where different weights for different directions are introduced and the weights are changed iteratively according to the relative errors in each direction. In , a novel alternating adaptive projections (AAP) algorithm for antenna synthesis is presented based on the scaling invariance property of design specifications and constraints which arises in synthesis problems of practical relevance, and an iterative procedure is proposed to compute the optimum scale parameter (or reference level) which is simple to implement and easily integrated in standard alternating projection routines. In , a Gram-Schmidt orthogonalization method is proposed for the radiation pattern synthesis. It applies the Gram-Schmidt procedure to obtain an orthonormal basis from the embedded element patterns, and then the pattern synthesis is viewed as finding the projection on a linear space spanned by this basis, which can be solved by using WLMS optimization. Recently, an efficient synthesis method called the weighted alternating reverse projection (WARP) was developed in [15, 16], which combined the power of WLMS and alternating projection together by iteratively modifying the target pattern and weighting values of different directions.
With the inspiration of WARP, we have proposed an array synthesis method with consideration of embedded element patterns by using weighted alternating projection and proximal splitting , whose salient characteristic is that the projector over excitation constraint set is designed as the solution to a constrained weighted least mean squares (CWLMS) problem which can be efficiently solved by using proximal splitting method. In this paper, our alternating projection and proximal splitting method is extended to consider the scaling invariance property of design specifications and constraints (particularly for the amplitudes of pattern and excitation).
The rest of the paper is organized as follows. In Section 2, we present the problem statement for array synthesis with embedded element patterns. The proposed array pattern synthesis method is developed in Section 3. Several synthesis examples are reported in Section 4 to demonstrate the efficiency of the proposed method. Conclusions are drawn in Section 5.
2. Problem Statement
Consider an arbitrary antenna array with elements. Suppose that the embedded pattern of the th element with sampling directions is expressed as , where and are the elevation and azimuth angles. The far field pattern obtained by the superposition of those embedded element patterns can be written aswhere is the array excitations, , and . The purpose of array synthesis is to find a set of complex excitations so that the field pattern and excitations can meet the specified requirements.
Same as AAP method , we consider the scaling invariance property of design specifications and constraints for the amplitudes of pattern and excitation. The scalable pattern constraint sets are defined aswhere is arbitrary nonzero scaling parameter for pattern constraints and and are the upper and low masks. The scalable excitation constraint sets are represented aswhere and are the amplitude and phase of , is arbitrary nonzero scaling parameter, and , , , and limit the amplitude and phase variations for each excitation. Obviously, for the case of phase-only array synthesis, we have . It is worth noting that and may not be convex because they are the unions of some convex sets. The purpose of the array synthesis is to find the intersection of these pattern and excitation constraint sets.
3. Proposed Array Pattern Synthesis Method
3.1. The Method of Alternating Projections
According to the above discussion, the array synthesis problem can be formulated as the search of the intersection of constraint sets. Our solution is the method of AP [18, 19]. Here we first briefly introduce the method of AP. Given sets with , we seek a feasible solution which belongs to the intersection of constraint sets. For the AP algorithm, the most important concept is the projection operator. The projector over a subset is defined as the operator whose value of is a point such that every point in has a distance from not smaller than . Note that when is a nonconvex set, more than such a point can exist; in this case we assume that a rule of choice has been fixed. The AP algorithm can be expressed by the iterative processwhere is the iteration time and , are the projectors over the constraint sets . That is to say, the method of AP can be implemented by projecting onto the constraint sets cyclically in each iteration, with the desired point obtained in the limit. In this paper, a weighted AP algorithm is used in the application of array synthesis with scalable pattern and excitation constraints.
3.2. Scalable Pattern Projection
In this subsection, the scalable pattern projection over pattern constraint sets is discussed. We first define the projector over with a fixed scaling factor bywhere . Then the projector over the scalable pattern constraints can be defined aswhere and is an arbitrary norm definition, such as , , and norms. In this paper, we select norm since the norm dynamic projector presents the most robust operation in terms of solution quality and convergence rate . In each iteration, the optimum scaling factors can be determined by following Algorithm 1. For convenience, we denote and , where and represent the real and imaginary parts of a complex vector, respectively.
Algorithm 1 (iterative procedure for optimum pattern scaling factor ).
Step 1. Initialize the scaling factor .
Step 2. Obtain by carrying on the projector .
Step 3. Calculate the relative error .
Step 4. Update the scaling factor by .
Step 5. If convergent or equal to the maximum iteration time, then and break; else return to Step 2.
3.3. Scalable Excitation Projection
Now, we address the scalable excitation projection over excitation constraint sets. After we obtain a new pattern by using projector , an appropriate way must be found to transform to a new excitation . It can be implemented by minimizing the difference between the temporary field pattern and synthesized radiation pattern under the excitation constraint , which can be solved by a constrained weighted LMS such thatwhere is a diagonal matrix with weights for each direction; it can be adjusted according to the relative importance of the different directions of the temporary pattern. The details of choosing will be given in Section 3.4.
To solve (7), a proximal splitting method is developed. We first introduce the proximity operator [20, 21]; for a point in set , the minimization problemadmits a unique solution, which is denoted by . The operator thus defined is the proximity operator of . Similar to the definition of projector , if there are multiple minima, we assume that a rule of choice has been fixed.
Obviously, (7) is equivalent to the following unconstrained problem:where is the indicator function of :It may not be convex because of the nonconvexity of . From [17, 20, 21], we can know that (9) can be effectively solved by using forward-backward splitting iterative processwhere is the forward gradient step, is the iteration time for solving (9), and is a step-size parameter which can be obtained by the normalized steepest decent :where and . is the backward proximity operator which is equivalent to the projection over the excitation constraints .
Here one remark is presented for (11). In the strict sense, the forward and backward splitting iterative process can be applied for convex functions only. When is convex, the forward and backward algorithm converges to the unique solution to (9). When is nonconvex, the convergence of this method is still an open question and the optimum solution cannot be guaranteed . However, despite lack of adequate theoretical justification, the forward and backward method is routinely applied to problems in the absence of convexity with good results [24, 25]. Furthermore, when we check (11) in detail, it can be seen that the forward step is well-posed because is convex. For the backward step , it is ill-posed because is nonconvex and the projection over is not unique. In this case, we should define a fixed rule for the projector over , which is described as follows.
We first define an operator , which is the projector over for a fixed scaling factor :where and force the excitation coefficients to satisfy the amplitude constraint and phase constraint , respectively:Letting , we have the projector of over such thatwhere , which can be calculated using Algorithm 2.
Algorithm 2 (iterative procedure for optimum excitation scaling factor ).
Step 1. Initialize the scaling factor .
Step 2. Obtain by carrying on the projector .
Step 3. Calculate the relative error .
Step 4. Update the scaling factor by .
Step 5. If convergent or equal to the maximum iteration time, then and break; else return to Step 2.
Here we also use norm to compute the optimum scaling factors and denote and . Thus the iterative process of (11) can be rewritten asand the operator can be approximated bywhere is the number of iterations for solving (9). For the initialization of the excitation in (16), we set . The way of initialization is very efficient and has good convergence.
After the operation of , a new excitation is obtained. Then we can transform to a new field pattern by applying a linear transform . Therefore, the whole alternating projections can be expressed bywhere is the iteration time of AP.
3.4. Selection of the Weighted Matrix
In this subsection, the choosing of weighted matrix is discussed. Similar to [15, 16], we first calculate the overranging differences for different directions between the obtained pattern after the operation of and the upper mask or lower mask at each iteration; that is,where is the optimum scaling factor determined by Algorithm 1. Then the weights are adjusted according to the differences in each direction, which is expressed bywhere is the used weight at previous iteration, represents the adjusted weight, and is an S-shape function with the scale parameter . The purpose of is to regularize the sum of weights in different directions to be 1, which can avoid the large variation of and improve the stability of weighted alternating projection.
3.5. Algorithm Summary
The proposed array synthesis method is summarized in Algorithm 3.
Algorithm 3 (scalable array synthesis using weighted alternating projection and proximal splitting).
Step 1. Initialize the field pattern and matrix .
Step 2. Compute the optimum pattern scaling factor .
Step 3. Impose the scalable pattern constraint using .
Step 4. Calculate the error value and update .
Step 5. Solve the constrained weighted LMS using .
Step 5.1. Initialize excitation .
Step 5.2. Carry on the forward iteration using .
Step 5.3. Compute the optimum excitation scaling factor .
Step 5.4. Impose the scalable excitation constraints using .
Step 5.5. If convergent, then break; else return to Step 5.2.
Step 6. Calculate field pattern using .
Step 7. If satisfies the pattern and excitation constraints, then stop; else return to Step 2.
Now the computational complexity of Algorithm 3 is briefly discussed. According to Algorithm 3, Table 1 lists the computational complexity for each step. From Table 1, we can see that the complexity of our algorithm is aboutwhere and are the numbers of outer and inner iterations of AP. and are the iteration times of computing the optimum pattern and excitation scaling factors. and are the numbers of array elements and pattern sampling directions. is the exponential complexity which arises from the calculations of weighted matrix and operator . It is worth mentioning that the number of inner iterations does not need to be very large to ensure the convergence of inner iteration. A small value can be set to reduce the oscillations in iterative process and accelerate the convergence of AP method . For the iteration times of and , from the statement in , we can know that few iterations should suffice in approaching the norm exact projection to find the optimum scaling factors. So they can be set to be small values which leads to negligible increase in the computational cost compared to the fixed scaling factors.
4. Synthesis Examples
To demonstrate the performance of proposed method, some synthesis examples are provided. In Section 4.1, we consider two examples for the linear array synthesis using a flat-topped pattern (FTP) and a cosecant-squared pattern (CSP). One is with excitation amplitude constraint, and the other is with excitation amplitude and phase constraints. For comparison, we also provided the synthesis results of AAP  and WARP . In Section 4.2, three pattern synthesis examples are provided for a planar array with excitation amplitude constraint, whose fluctuation is less than a prescribed value.
4.1. Synthesis with Linear Array
As illustrated in Figure 1, we first synthesize an FTP whose shaped region is from to . A uniform linear array with 17 omnidirectional elements spaced half a wavelength apart is considered. The ripples are required to be less than 2 dB in the shaped regions and the SLL is lower than −30 dB. The excitation amplitude constraints are and there is no phase constraint. The synthesis results of AAP, WARP, and our proposed method are given in Figures 1(a), 1(b), and 1(c), respectively. Figures 2(a), 2(b), and 2(c) are the excitation amplitude and phase distributions for different methods. The excitations for our synthesised FTP are especially provided in Table 2. The comparisons of maximum SLL and mainlobe ripple have been listed in Table 3. From Figures 1 and 2 and Table 3, we can see that the excitation amplitude dynamics are all less than 3.5. Our synthesis result shows a very good fit to destination pattern. The ripple level in the shaped region is about 1.97 dB and the maximum SLL is −29.6 dB, which is slightly higher than −30 dB, but much lower than AAP and WARP methods.
Next we consider the CSP synthesis with excitation amplitude and phase constraints. As shown in Figure 3, the shaped region is from to and the SLL is also required to be lower than −30 dB. The proposed method is examined with a 12-element linear array spaced half a wavelength apart. The excitation amplitude and phase constraints are and . Figures 3(a), 3(b), and 3(c) are the synthesized patterns of AAP, WARP, and our proposed method, respectively. Figures 4(a), 4(b), and 4(c) are the excitation amplitude and phase distributions for different methods. The excitations of our synthesised CSP pattern are shown in Table 2. The values of maximum SLL and mainlobe ripples are also compared in Table 3. From Figures 3 and 4 and Table 3, it can be observed that the obtained excitations of three methods are all satisfied to the excitation amplitude and phase constraints. The proposed method provides better performance compared to WARP and AAP methods. The ripple level in the shaped region is about 0.75 dB and the SLLs are lower than −30 dB.
4.2. Synthesis with Planar Array
In this subsection, an S band planar array of 91 elements for low earth orbit satellite communication is considered. As illustrated in Figure 5(a), the elements of array form an equilateral triangle arrangement with the interelement spacing of half wavelength. There are different patterns shown in Figure 5(b) to be synthesized in UV plane, where , . The goal is to synthesize these patterns with consideration of embedded element patterns, which are evaluated by using HFSS software. The maximum SLL is required to be lower than and the ripples in shaped regions must be less than 2 dB. The excitation amplitude dynamics are . For convenience, we select pattern 1, pattern 2, and pattern 8 as examples. The shaped region of pattern 1 is a circular footprint located on the center of UV plane with and , pattern 2 is located in the region of and , and pattern 8 has an arc-shaped footprint located in and .
Figures 6, 7, and 8 depict the synthesized results for patterns 1, 2, and 8. Figures 6(a), 7(a), and 8(a) are the synthesized patterns, where only the patterns above −17 dB are shown for clarity. The contour plots of three patterns with levels of −2 dB and −17 dB are presented in Figures 6(b), 7(b), and 8(b). The normalized excitation amplitudes of patterns 1, 2, and 8 are plotted in Figures 6(c), 7(c), and 8(c). From Figures 6, 7, and 8, it can be observed that the −2 dB contours all fully cover the shaped regions and the ripples in these regions are less than 2 dB. The maximum SLLs are all lower than −17 dB. The excitation amplitude dynamics for patterns 1, 2, and 8 have been successfully controlled to satisfy .
In this paper, an array pattern synthesis method combining scalable alternating projection and proximal splitting is developed. In this method, the embedded element patterns and scaling invariance property of design specifications are considered. Compared to other alternating projection methods, the proposed array pattern synthesis designs the projector over scalable excitation constraint set as the solution to a CWLMS problem which is solved using forward-backward proximal splitting. Several linear and planar synthesis examples demonstrate the better performance of the proposed array pattern synthesis.
|LMS:||Least mean squares|
|WLMS:||Weighted least mean squares|
|AAP:||Alternating adaptive projections|
|WARP:||Weighted alternating reverse projection|
|CWLMS:||Constrained weighted least mean squares|
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
This study is supported in part by the National Natural Science Foundations of China (nos. 11273017 and 61471196).
- C. A. Balanis, Antenna Theory: Analysis and Design, Wiley, New York, NY, USA, 3rd edition, 2005.
- G. A. Somers, “Proof of the Woodward-Lawson sampling method for a finite linear array,” Radio Science, vol. 28, no. 4, pp. 481–485, 1993.
- A. T. Villeneuve, “Taylor patterns for discrete arrays,” IEEE Transactions on Antennas and Propagation, vol. 32, no. 10, pp. 1089–1093, 1984.
- C. L. Dolph, “A current distribution for broadside arrays which optimizes the relationship between beam width and side-lobe level,” Proceedings of the IRE, vol. 34, no. 6, pp. 335–348, 1946.
- H. M. Elkamchouchi and M. M. Hassan, “Array pattern synthesis approach using a genetic algorithm,” IET Microwaves, Antennas and Propagation, vol. 8, no. 14, pp. 1236–1240, 2014.
- F. Zhang, W. Jia, and M. Yao, “Linear aperiodic array synthesis using differential evolution algorithm,” IEEE Antennas and Wireless Propagation Letters, vol. 12, pp. 797–800, 2013.
- J. A. Ferreira and F. Ares, “Pattern synthesis of conformal arrays by the simulated annealing technique,” Electronics Letters, vol. 33, no. 14, pp. 1187–1189, 1997.
- R. K. Baee, K. Forooraghi, and S. Chamaani, “Conformal array pattern synthesis using a hybrid WARP/2LB-MOPSO algorithm,” International Journal of Antennas and Propagation, vol. 2012, Article ID 202906, 7 pages, 2012.
- O. M. Bucci, G. D. Elia, and G. Romito, “Intersection approach to array pattern synthesis,” IEE Proceedings—Microwaves, Antennas and Propagation, vol. 137, no. 6, pp. 349–357, 1990.
- O. M. Bucci, G. D'Elia, and G. Romito, “Power synthesis of conformal arrays by a generalised projection method,” IEE Proceedings: Microwaves, Antennas and Propagation, vol. 142, no. 6, pp. 467–471, 1995.
- B. D. Carlson and D. Willner, “Antenna pattern synthesis using weighted least squares,” IEE Proceedings H: Microwaves, Antennas and Propagation, vol. 139, no. 1, pp. 11–16, 1992.
- L. I. Vaskelainen, “Iterative least-squares synthesis methods for conformai array antennas with optimized polarization and frequency properties,” IEEE Transactions on Antennas and Propagation, vol. 45, no. 7, pp. 1179–1185, 1997.
- J. L. Araque Quijano and G. Vecchi, “Alternating adaptive projections in antenna synthesis,” IEEE Transactions on Antennas and Propagation, vol. 58, no. 3, pp. 727–737, 2010.
- E. Ercil, E. Yildirim, and M. E. Inal, “Array Antenna pattern synthesis using measured active element patterns and Gram-Schmidt Orthogonalization,” in Proceedings of the 4th IEEE International Symposium on Phased Array Systems and Technology, pp. 357–360, Waltham, Mass, USA, October 2010.
- A. Haddadi, A. Ghorbani, and J. Rashed-Mohassel, “Cosecant-squared pattern synthesis using a weighted alternating reverse projection method,” IET Microwaves, Antennas & Propagation, vol. 5, no. 15, pp. 1789–1795, 2011.
- R. Karimzadeh, M. Hakkak, A. Haddadi, and K. Forooraghi, “Conformal array pattern synthesis using the weighted alternating reverse projection method considering mutual coupling and embedded-element pattern effects,” IET Microwaves, Antennas and Propagation, vol. 6, no. 6, pp. 621–626, 2012.
- Y. Han, C. Wan, W. Sheng, B. Tian, and H. Yang, “Array synthesis using weighted alternating projection and proximal splitting,” IEEE Antennas and Wireless Propagation Letters, vol. 14, pp. 1006–1009, 2015.
- R. Escalante and M. Raydan, Alternating Projection Methods-Fundamentals of Algorithms, U.S.: Society for Industrial and Applied Mathematics, 2011.
- M. K. Tam, The Method of Alternating Projections, University of Newcastle, Callaghan, Australia, 2012.
- P. L. Combettes and V. R. Wajs, “Signal recovery by proximal forward-backward splitting,” Multiscale Modeling & Simulation, vol. 4, no. 4, pp. 1168–1200, 2005.
- P. L. Combettes and J.-C. Pesquet, “Proximal splitting methods in signal processing,” in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185–212, Springer, New York, NY, USA, 2011.
- L. A. Hageman and D. M. Young, Applied Iterative Methods, Academic Press, New York, NY, USA, 1981.
- J. Bolte, S. Sabach, and M. Teboulle, “Proximal alternating linearized minimization for nonconvex and nonsmooth problems,” Mathematical Programming, vol. 146, no. 1-2, pp. 459–494, 2014.
- H. Attouch, J. Bolte, P. Redont, and A. Soubeyran, “Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-Łojasiewicz inequality,” Mathematics of Operations Research, vol. 35, no. 2, pp. 438–457, 2010.
- H. H. Bauschke, H. M. Phan, and X. Wang, “The method of alternating relaxed projections for two nonconvex sets,” Vietnam Journal of Mathematics, vol. 42, no. 4, pp. 421–450, 2014.
- H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang, “Restricted normal cones and the method of alternating projections: theory,” Set-Valued and Variational Analysis, vol. 21, no. 3, pp. 431–473, 2013.
Copyright © 2015 Yubing Han and Chuan Wan. 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.