Vol. 18
Latest Volume
All Volumes
PIERM 126 [2024] PIERM 125 [2024] PIERM 124 [2024] PIERM 123 [2024] PIERM 122 [2023] PIERM 121 [2023] PIERM 120 [2023] PIERM 119 [2023] PIERM 118 [2023] PIERM 117 [2023] PIERM 116 [2023] PIERM 115 [2023] PIERM 114 [2022] PIERM 113 [2022] PIERM 112 [2022] PIERM 111 [2022] PIERM 110 [2022] PIERM 109 [2022] PIERM 108 [2022] PIERM 107 [2022] PIERM 106 [2021] PIERM 105 [2021] PIERM 104 [2021] PIERM 103 [2021] PIERM 102 [2021] PIERM 101 [2021] PIERM 100 [2021] PIERM 99 [2021] PIERM 98 [2020] PIERM 97 [2020] PIERM 96 [2020] PIERM 95 [2020] PIERM 94 [2020] PIERM 93 [2020] PIERM 92 [2020] PIERM 91 [2020] PIERM 90 [2020] PIERM 89 [2020] PIERM 88 [2020] PIERM 87 [2019] PIERM 86 [2019] PIERM 85 [2019] PIERM 84 [2019] PIERM 83 [2019] PIERM 82 [2019] PIERM 81 [2019] PIERM 80 [2019] PIERM 79 [2019] PIERM 78 [2019] PIERM 77 [2019] PIERM 76 [2018] PIERM 75 [2018] PIERM 74 [2018] PIERM 73 [2018] PIERM 72 [2018] PIERM 71 [2018] PIERM 70 [2018] PIERM 69 [2018] PIERM 68 [2018] PIERM 67 [2018] PIERM 66 [2018] PIERM 65 [2018] PIERM 64 [2018] PIERM 63 [2018] PIERM 62 [2017] PIERM 61 [2017] PIERM 60 [2017] PIERM 59 [2017] PIERM 58 [2017] PIERM 57 [2017] PIERM 56 [2017] PIERM 55 [2017] PIERM 54 [2017] PIERM 53 [2017] PIERM 52 [2016] PIERM 51 [2016] PIERM 50 [2016] PIERM 49 [2016] PIERM 48 [2016] PIERM 47 [2016] PIERM 46 [2016] PIERM 45 [2016] PIERM 44 [2015] PIERM 43 [2015] PIERM 42 [2015] PIERM 41 [2015] PIERM 40 [2014] PIERM 39 [2014] PIERM 38 [2014] PIERM 37 [2014] PIERM 36 [2014] PIERM 35 [2014] PIERM 34 [2014] PIERM 33 [2013] PIERM 32 [2013] PIERM 31 [2013] PIERM 30 [2013] PIERM 29 [2013] PIERM 28 [2013] PIERM 27 [2012] PIERM 26 [2012] PIERM 25 [2012] PIERM 24 [2012] PIERM 23 [2012] PIERM 22 [2012] PIERM 21 [2011] PIERM 20 [2011] PIERM 19 [2011] PIERM 18 [2011] PIERM 17 [2011] PIERM 16 [2011] PIERM 14 [2010] PIERM 13 [2010] PIERM 12 [2010] PIERM 11 [2010] PIERM 10 [2009] PIERM 9 [2009] PIERM 8 [2009] PIERM 7 [2009] PIERM 6 [2009] PIERM 5 [2008] PIERM 4 [2008] PIERM 3 [2008] PIERM 2 [2008] PIERM 1 [2008]
2011-04-07
Flexible Array Beampattern Synthesis Using Hypergeometric Functions
By
Progress In Electromagnetics Research M, Vol. 18, 1-15, 2011
Abstract
For array beampattern synthesis, it is possible to simplify the model and reduce the computational load by formulating it to be a Quadratic Programming (QP) problem. The QP method is conceptually simple and imposes no restriction on array geometry. In the QP method, a key component is the template function which describes the desired beampattern as a deterministic function of direction. In this paper, the template functions in the form of Hypergeometric Function corresponding to Legendre arrays and Dolph-Chebyshev arrays, namely Legendre Hypergeometric Function (LHF) and Dolph-Chebyshev Hypergeometric Function (DCHF), are derived and the synthesis procedures are also presented. The simulation results show that the DCHF and LHF work in the QP method and provide the exactly synthesized beampattern. Moreover, another synthesis method using a Gegenbauer polynomial to synthesize the beampattern of a Uniform Linear Array, is proposed. This method gives rise to the Gegenbauer arrays. Gegenbauer arrays are very generalized and Legendre arrays and Dolph-Chebyshev arrays are considered as its special cases. Using the Gegenbauer array synthesis method, one is able to further adjust the beam efficiency and the directivity when the Side-Lobe Level and the element number are specified. As well as Dolph-Chebyshev arrays and Legendre arrays, its template function for the QP method, Gegenbauer Hypergeometric Function, is also derived.
Citation
Lei Tu, and Boon Ng, "Flexible Array Beampattern Synthesis Using Hypergeometric Functions," Progress In Electromagnetics Research M, Vol. 18, 1-15, 2011.
doi:10.2528/PIERM10120803
References

1. Dolph, C. L., "A current distribution for broadside arrays which optimizes the relationship between beamwidth and side-lobe level," Proc. IRE, Vol. 34, 335-348, Jun. 1946.
doi:10.1109/JRPROC.1946.225956

2. Qu, L., W. Ser, and Z. H. Shao, "An efficient adaptive beamforming technique with pattern control ability," IEEE 64th Vehicular Technology Conference, 479-483, 2006.

3. Qu, L., W. Ser, and Z. H. Shao, "Beam pattern synthesis in the presence of interference and multipath," International Symposium International Symposium, 267-271, 2006.

4. Keizer, W. P. M. N., "Fast low-sidelobe synthesis for large planar array antennas utilizing successive fast Fourier transforms of the array factor," IEEE Trans. Antennas Propagat., Vol. 55, 715-722, 2007.
doi:10.1109/TAP.2007.891511

5. Wang, F., V. Balakrishnan, and P. Y. Zhou, "Optimal array pattern synthesis using semidefinite programming," IEEE Trans. Antennas Propagat., Vol. 51, 1172-1183, 2003.

6. Corcoles, J., M. A. Gonzalez, and J. Rubio, "Mutual coupling compensation in arrays using a spherical wave expansion of the radiated field," IEEE Trans. Antennas Propagat., Vol. 8, 108-111, 2009.

7. Corcoles, J., M. A. Gonzalez, and J. Rubio, "Array design for different SLL and null directions with an interior-point optimization method from the generalized-scattering-matrix and spherical modes," 3rd European Conference on Antannas and Propagation, 1319-1323, 2009.

8. Bucci, O. M., D. D'Elia, G. Mazzarella, and G. Panatiello, "Antenna pattern synthesis: A new general approach," Proc. IEEE, Vol. 82, 358-371, Mar. 1994.
doi:10.1109/5.272140

9. Lebret, H. and S. Boyd, "Antenna array pattern synthesis via convex optimization," IEEE Trans. on Signal Processing, Vol. 45, No. 3, 526-532, Mar. 1997.
doi:10.1109/78.558465

10. Bucci, O. M., M. D'Urso, and T. Isernia, "Exploiting convexity in array antenna synthesis problems," Radar Conference 2008, Roma, Italy, Proceedings of the Conference, May 26-30, 2008.

11. Rocca, P., L. Manica, R. Azaro, and A. Massa, "A Hybrid approach to the synthesis of subarrayed monopulse linear arrays," IEEE Trans. Antennas Propagat., Vol. 57, No. 1, 280-283, Jan. 2009.
doi:10.1109/TAP.2008.2009776

12. Ng, , B. P., M. H. Er, C. Kot, "A flexible array synthesis method using quadratic programming," IEEE Trans. Antennas Propagat.,, Vol. 41, 1541-1550, Nov. 1993.

13. Phongcharoenpanich, C., M. Krairiksh, K. Meksamoot, and T. Wakabayashi, "Legendre array," Proc. TJSAP, 197-201, May 1997.

14. Goto, N., "A synthesis of array antennas for high directivity and low sidelobes," IEEE Trans. Antennas Propagat., Vol. 20, No. 4, 427-431, Jul. 1972.
doi:10.1109/TAP.1972.1140239

15. Abramowitz, M. and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, , Dover, New York, 1965.

16. Bailey, W. N., Generalised Hypergeometric Series, University Press, Cambridge, England, 1935.

17. Balanis, C. A., Antenna Theory Analysis and Design, John Wiley and Sons, New York, 1997.

18. Suetin, P. K., "Encyclopaedia of Mathematics," Springer, 2001.

19. Er, M. H. and A. Cantoni, "A new set of linear constraints for broadband time domain element space processors," IEEE Trans. Antennas Propagat., Vol. 34, No. 3, 320-329, Mar. 1986.
doi:10.1109/TAP.1986.1143834

20. Ng, B. P., "Generalised approach to the design of narrowband antenna array processors with broadband capability," IEE Proc. F, Vol. 137, No. 1, 41-47, Feb. 1990.