Vol. 52
Latest Volume
All Volumes
PIERM 127 [2024] 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]
2016-12-05
Comparison Guidelines and Benchmark Procedure for Sparse Array Synthesis
By
Progress In Electromagnetics Research M, Vol. 52, 129-139, 2016
Abstract
A benchmarking procedure for sparse linear array synthesis methods is proposed. Our approach is based on the comparison of the performance of the array synthesis algorithm under test with the performance of a reference equispaced array. The benchmark procedure is discussed considering some examples regarding sparse synthesis method proposed in literature. Guidelines for the correct comparison of synthesis methods and some ``tough problems'' for the test of new sparse synthesis algorithms are also provided.
Citation
Daniele Pinchera, and Marco Donald Migliore, "Comparison Guidelines and Benchmark Procedure for Sparse Array Synthesis," Progress In Electromagnetics Research M, Vol. 52, 129-139, 2016.
doi:10.2528/PIERM16092503
References

1. Chen, K., Z. He, and C.-C. Han, "A modified real ga for the sparse linear array synthesis with multiple constraints," IEEE Transactions on Antennas and Propagation, Vol. 54, No. 7, 2169-2173, 2006.
doi:10.1109/TAP.2006.877211

2. Zhang, S., S.-X. Gong, Y. Guan, P.-F. Zhang, and Q. Gong, "A novel IGA-edsPSO hybrid algorithm for the synthesis of sparse arrays," Progress In Electromagnetics Research, Vol. 89, 121-134, 2009.
doi:10.2528/PIER08120806

3. Barott, W. C. and P. G. Steffes, "Grating lobe reduction in aperiodic linear arrays of physically large antennas," Antennas and Wireless Propagation Letters, IEEE, Vol. 8, 406-408, 2009.
doi:10.1109/LAWP.2008.2005364

4. Goudos, S. K., K. Siakavara, T. Samaras, E. E. Vafiadis, and J. N. Sahalos, "Sparse linear array synthesis with multiple constraints using differential evolution with strategy adaptation," Antennas and Wireless Propagation Letters, IEEE, Vol. 10, 670-673, 2011.
doi:10.1109/LAWP.2011.2161256

5. Leahy, R. M. and B. D. Jeffs, "On the design of maximally sparse beamforming arrays," IEEE Transactions on Antennas and Propagation, Vol. 39, No. 8, 1178-1187, 1991.
doi:10.1109/8.97353

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

7. Fuchs, B., "Synthesis of sparse arrays with focused or shaped beampattern via sequential convex optimizations," IEEE Transactions on Antennas and Propagation, Vol. 60, No. 7, 3499-3503, 2012.
doi:10.1109/TAP.2012.2196951

8. Pinchera, D. and M. D. Migliore, "Effective sparse array synthesis using a generalized alternate projection algorithm," 2014 IEEE Conference on Antenna Measurements & Applications (CAMA), 1-2, 2014.
doi:10.1109/CAMA.2014.7003322

9. Isernia, T., F. Ares, O. M. Bucci, M. D’Urso, J. F. Gomez, and J. Rodriguez, "A hybrid approach for the optimal synthesis of pencil beams through array antennas," IEEE Antennas and Propagation Society International Symposium, Vol. 3, 2301-2304, 2004.

10. Liu, Y., Z. Nie, and Q. H. Liu, "Reducing the number of elements in a linear antenna array by the matrix pencil method," IEEE Transactions on Antennas and Propagation, Vol. 56, No. 9, 2955-2962, 2008.
doi:10.1109/TAP.2008.928801

11. Manica, L., P. Rocca, and A. Massa, "Design of subarrayed linear and planar array antennas with sll control based on an excitation matching approach," IEEE Transactions on Antennas and Propagation, Vol. 57, No. 6, 1684-1691, 2009.
doi:10.1109/TAP.2009.2019914

12. Liu, Y., Q. H. Liu, and Z. Nie, "Reducing the number of elements in the synthesis of shapedbeam patterns by the forward-backward matrix pencil method," IEEE Transactions on Antennas and Propagation, Vol. 58, No. 2, 604-608, 2010.
doi:10.1109/TAP.2009.2037709

13. Nai, S. E., W. Ser, Z. L. Yu, and H. Chen, "Beampattern synthesis for linear and planar arrays with antenna selection by convex optimization," IEEE Transactions on Antennas and Propagation, Vol. 58, No. 12, 3923-3930, 2010.
doi:10.1109/TAP.2010.2078446

14. Dolph, C., "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, 335-348, 1946.
doi:10.1109/JRPROC.1946.225956

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

16. Isernia, T., O. Bucci, and N. Fiorentino, "Shaped beam antenna synthesis problems: Feasibility criteria and new strategies," Journal of Electromagnetic Waves and Applications, Vol. 12, No. 1, 103-138, 1998.
doi:10.1163/156939398X00098

17. Isernia, T., 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, 1837-1847, Dec. 2000.
doi:10.1109/8.901272

18. Fuchs, J.-J. and B. Fuchs, "Synthesis of optimal narrow beam low sidelobe linear array with constrained length," Progress In Electromagnetics Research B, Vol. 25, 315-330, 2010.
doi:10.2528/PIERB10070607

19. Bucci, O. M., T. Isernia, S. Perna, and D. Pinchera, "Isophoric sparse arrays ensuring global coverage in satellite communications," IEEE Transactions on Antennas and Propagation, Vol. 62, No. 4, 1607-1618, 2014.
doi:10.1109/TAP.2013.2287901

20. Kelley, D. F. and W. L. Stutzman, "Array antenna pattern modeling methods that include mutual coupling effects," IEEE Transactions on Antennas and Propagation, Vol. 41, No. 12, 1625-1632, 1993.
doi:10.1109/8.273305

21. Hui, H. T., "Decoupling methods for the mutual coupling effect in antenna arrays: A review," Recent Patents on Engineering, Vol. 1, No. 2, 187-193, 2007.
doi:10.2174/187221207780832200

22. "Cvx: Matlab software for disciplined convex programming,", [Online]. Available: http://cvxr.com/cvx/.