Vol. 68
Latest Volume
All Volumes
PIERL 123 [2025] PIERL 122 [2024] PIERL 121 [2024] PIERL 120 [2024] PIERL 119 [2024] PIERL 118 [2024] PIERL 117 [2024] PIERL 116 [2024] PIERL 115 [2024] PIERL 114 [2023] PIERL 113 [2023] PIERL 112 [2023] PIERL 111 [2023] PIERL 110 [2023] PIERL 109 [2023] PIERL 108 [2023] PIERL 107 [2022] PIERL 106 [2022] PIERL 105 [2022] PIERL 104 [2022] PIERL 103 [2022] PIERL 102 [2022] PIERL 101 [2021] PIERL 100 [2021] PIERL 99 [2021] PIERL 98 [2021] PIERL 97 [2021] PIERL 96 [2021] PIERL 95 [2021] PIERL 94 [2020] PIERL 93 [2020] PIERL 92 [2020] PIERL 91 [2020] PIERL 90 [2020] PIERL 89 [2020] PIERL 88 [2020] PIERL 87 [2019] PIERL 86 [2019] PIERL 85 [2019] PIERL 84 [2019] PIERL 83 [2019] PIERL 82 [2019] PIERL 81 [2019] PIERL 80 [2018] PIERL 79 [2018] PIERL 78 [2018] PIERL 77 [2018] PIERL 76 [2018] PIERL 75 [2018] PIERL 74 [2018] PIERL 73 [2018] PIERL 72 [2018] PIERL 71 [2017] PIERL 70 [2017] PIERL 69 [2017] PIERL 68 [2017] PIERL 67 [2017] PIERL 66 [2017] PIERL 65 [2017] PIERL 64 [2016] PIERL 63 [2016] PIERL 62 [2016] PIERL 61 [2016] PIERL 60 [2016] PIERL 59 [2016] PIERL 58 [2016] PIERL 57 [2015] PIERL 56 [2015] PIERL 55 [2015] PIERL 54 [2015] PIERL 53 [2015] PIERL 52 [2015] PIERL 51 [2015] PIERL 50 [2014] PIERL 49 [2014] PIERL 48 [2014] PIERL 47 [2014] PIERL 46 [2014] PIERL 45 [2014] PIERL 44 [2014] PIERL 43 [2013] PIERL 42 [2013] PIERL 41 [2013] PIERL 40 [2013] PIERL 39 [2013] PIERL 38 [2013] PIERL 37 [2013] PIERL 36 [2013] PIERL 35 [2012] PIERL 34 [2012] PIERL 33 [2012] PIERL 32 [2012] PIERL 31 [2012] PIERL 30 [2012] PIERL 29 [2012] PIERL 28 [2012] PIERL 27 [2011] PIERL 26 [2011] PIERL 25 [2011] PIERL 24 [2011] PIERL 23 [2011] PIERL 22 [2011] PIERL 21 [2011] PIERL 20 [2011] PIERL 19 [2010] PIERL 18 [2010] PIERL 17 [2010] PIERL 16 [2010] PIERL 15 [2010] PIERL 14 [2010] PIERL 13 [2010] PIERL 12 [2009] PIERL 11 [2009] PIERL 10 [2009] PIERL 9 [2009] PIERL 8 [2009] PIERL 7 [2009] PIERL 6 [2009] PIERL 5 [2008] PIERL 4 [2008] PIERL 3 [2008] PIERL 2 [2008] PIERL 1 [2008]
2017-05-24
Fast Synthesis of Planar, Maximally Thinned Arrays
By
Progress In Electromagnetics Research Letters, Vol. 68, 47-52, 2017
Abstract
In this paper a method for a fast synthesis of planar, maximally thinned and steerable arrays is proposed and tested on several benchmarks available in literature. The method optimizes simultaneously the weight coefficients and sensor positions of a planar array without using global optimization schemes, properly exploiting convex optimization based algorithms. The resulting arrays are able to radiate a steerable beam pattern, satisfying a prescribed power mask and avoid to constraint the fitting of any a priori assigned reference field pattern. Although such a method takes into account the general case of sparse arrays, this letter is focused on the case of thinned arrays as a special case of sparse ones, since the initial grid to thin on has only half-wavelength distances. Such a feature allows a faster synthesis than in the general case of sparse arrays.
Citation
Roberto M. Tumolo, Michele D'Urso, Giancarlo Prisco, and Aniello Buonanno, "Fast Synthesis of Planar, Maximally Thinned Arrays," Progress In Electromagnetics Research Letters, Vol. 68, 47-52, 2017.
doi:10.2528/PIERL17021307
References

1. Prisco, G. and M. D'Urso, "Maximally sparse arrays via sequential convex optimizations," IEEE Trans. on Ant. and Wireless Propag. Letters, Vol. 11, 192-195, 2012.
doi:10.1109/LAWP.2012.2186626

2. Prisco, G., M. D'Urso, and R. M. Tumolo, "Maximally sparse, steerable and nonsuperdirective array antennas via convex optimizations," IEEE Trans. Antennas Propag., Vol. 64, No. 9, 3840-3849, September 2016.
doi:10.1109/TAP.2016.2586490

3. Hansen, C., Phased Array Antennas, John Wiley & Sons, Inc., 1998.
doi:10.1002/0471224219

4. Candes, E. J., M. Wakin, and S. Boyd, "Enhancing sparsity by reweighted ℓ1 minimization," Journal of Fourier Analysis and Application, Vol. 14, No. 5, 877-905, special issue on sparsity, December 2008.

5. Nai, S. E., W. Ser, Z. L. Yu, et al. "Beam pattern synthesis for linear and planar arrays with antenna selection by convex optimization," IEEE Trans. Antennas Propag., Vol. 58, No. 12, 3923-3930, 2010.
doi:10.1109/TAP.2010.2078446

6. Land, A. H. and A. G. Doig, "An automatic method of solving discrete programming problems," Econometrica, Vol. 28, No. 3, 497-520, July 1960.
doi:10.2307/1910129

7. Narendra, P. M. and K. Fukunaga, "A branch and bound algorithm for feature subset selection," IEEE Trans. Computers, Vol. 26, No. 9, 917-922, September 1977.
doi:10.1109/TC.1977.1674939

8. Gomory, R. E., "Outline of an algorithm for integer solutions to linear programs," Bulletin of the American Mathematical Society, Vol. 64, 275-278, 1958.
doi:10.1090/S0002-9904-1958-10224-4

9. Bixby, R. E., "A brief history of linear and mixed integer programming computation," Documenta Math., 2010.

10. Junger, M., T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, and G. Rinaldi, 50 Years of Integer Programming 1958-2008, From early years to ther State-of-the-art, Springer-Verlag Editor, 2010.
doi:10.1007/978-3-540-68279-0

11. Haupt, R. L., "Thinned arrays using genetic algorithms," IEEE Trans. Antennas Propag., Vol. 42, No. 7, 993-999, July 1994.
doi:10.1109/8.299602

12. Ha, B. V., M. Mussetta, P. Pirinoli, and R. E. Zich, "Modified compact genetic algorithm for thinned array synthesis," IEEE Antennas Wireless Propag. Lett., Vol. 15, 2016.

13. Trucco, A., "Thinning and weighting of large planar arrays by simulated annealing," IEEE Trans. Ultrason., Ferroelectr., Freq. Control., Vol. 46, No. 2, 347-355, March 1999.
doi:10.1109/58.753023

14. Trucco, A. and V. Murino, "Stochastic optimization of linear sparse arrays," IEEE J. Ocean. Eng., Vol. 24, No. 3, 291-299, July 1999.
doi:10.1109/48.775291

15. Oscar, Q. and E. Jajo, "Ant colony optimization in thinned array synthesis with minimum sidelobe level," IEEE Antennas Wireless Propag. Lett., Vol. 5, 349-352, 2006.

16. Mosca, S. and M. Ciattaglia, "Ant colony optimization to design thinned arrays," Proc. IEEE Antennas Propag. Soc. Int. Symp., 4675-4678, July 9-14, 2006.

17. Tropp, J. and S. Wright, "Computational methods for sparse solution of linear inverse problems," Proc. IEEE, Vol. 98, No. 6, 948-958, June 2010.
doi:10.1109/JPROC.2010.2044010

18. Oliveri, G. and A. Massa, "Bayesian compressive sampling for pattern synthesis with maximally sparse non-uniform linear arrays," IEEE Trans. Antennas Propag., Vol. 59, No. 2, 467-481, February 2011.
doi:10.1109/TAP.2010.2096400

19. Oliveri, G., M. Carlin, and A. Massa, "Complex-weight sparse linear array synthesis by Bayesian compressive sampling," IEEE Trans. Antennas Propag., Vol. 60, No. 5, 2309-2326, May 2012.
doi:10.1109/TAP.2012.2189742

20. Viani, F., G. Oliveri, and A. Massa, "Compressive sensing pattern matching techniques for synthesizing planar sparse arrays," IEEE Trans. Antennas Propag., Vol. 61, No. 9, 4577-4587, September 2013.
doi:10.1109/TAP.2013.2267195