Abstract
The design of sparse array which is able to achieve good performance of beam-pattern satisfying the minimum peak sidelobe level (PSL) with the number of sensors as few as possible is a research area of increasing interest. This paper presents a method for planar optimization with sensor selection via convex optimization in condition of constrained beam-pattern. In the optimization procedure, the solution algorithm is based on convex optimization including a reweighted l 1-norm minimization. The objective is the minimum of the number of sensors and the PSL. Sparse array is obtained by removing those sensors with weights equal to zero or approximately equal to zero. In this paper, we also give the optimization algorithm respectively by row, column and the intersection on the basis of the linear array optimization. Numerical results are included, which illustrate the optimum method for planar arrays overall performs better than the other methods presented above for sensor selection.
Similar content being viewed by others
References
Chen, K., Yun, X., He, Z., et al. (2007). Synthesis of sparse planar arrays using modified real genetic algorithm. IEEE Transactions on Antennas and Propagation, 55(4), 1067–1073.
Orbanz, P., & Roy, D. M. (2013). Bayesian models of graphs, arrays and other exchangeable random structures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37, 437–461.
Viani, F., Oliveri, G., & Massa, A. (2013). Compressive sensing pattern matching techniques for synthesizing planar sparse arrays. IEEE Transactions on Antennas and Propagation, 61(9), 4577–4587.
Zhang, W., Li, L., & Li, F. (2011). Reducing the number of elements in linear and planar antenna arrays with sparseness constrained optimization. IEEE Transactions on Antennas and Propagation, 59(8), 3106–3111.
Ha, B. V., Zich, R. E. & Mussetta, M., et al. (2013). Synthesis of sparse planar array using modified Bayesian optimization algorithm. In 2013 international conference on electromagnetics in advanced applications (ICEAA) (pp. 1541–1543). IEEE.
Liu, J., Zhao, Z., Yuan, M., et al. (2014). The filter diagonalization method in antenna array optimization for pattern synthesis. IEEE Transactions on Antennas and Propagation, 62(12), 6123–6130.
Ha, B. V., Zich, R. E., & Mussetta, M., et al. (2013). Improved compact genetic algorithm for thinned array design. In 7th European conference on antennas and propagation (EuCAP), 2013 (pp. 1807–1808). IEEE.
He, X. H. (2010). Thinned array synthesis based on integer coded genetic algorithm. Journal of Electronics and Information Technology, 32(9), 2277–2281.
Chen, P., Zheng, Y., & Zhu, W. (2011). Optimized simulated annealing algorithm for thinning and weighting large planar arrays in both far-field and near-field. IEEE Journal of Oceanic Engineering, 36(4), 658–664.
Meijer, C. A. (1998). Simulated annealing in the design of thinned arrays having low sidelobe levels. In Proceedings of the 1998 South African Symposium on Communications and Signal Processing (pp. 361–366).
Chen, P. Y., & Selesnick, I. W. (2014). Group-sparse signal denoising: non-convex regularization, convex optimization. IEEE Transactions on Signal Processing, 62(13), 3464–3478.
Lebret, H., & Boyd, S. (1997). Antenna array pattern synthesis via convex optimization. IEEE Transactions on Signal Processing, 45(3), 526–532.
Fuchs, B. (2012). Synthesis of sparse arrays with focused or shaped beampattern via sequential convex optimizations. IEEE Transactions on Antennas and Propagation, 60(7), 3499–3503.
Chen, H., Wan, Q., Huang, A. M., et al. (2009). Array pattern synthesis via sparse weight vector finding and convex programming. In 5th international conference on wireless communications, networking and mobile computing, 2009. WiCom’09 (pp. 1–4). IEEE.
Prisco, G., & D’Urso, M. (2012). Maximally sparse arrays via sequential convex optimizations. IEEE Antennas and Wireless Propagation Letters, 11, 192–195.
Nai, S. E., Ser, W., Yu, Z. L., et al. (2010). Beampattern synthesis for linear and planar arrays with antenna selection by convex optimization. IEEE Transactions on Antennas and Propagation, 58(12), 3923–3930.
Li, Y. Q., Cichocki, A., & Amari, S. (2004). Analysis of sparse representation and blind source separation. Neural Computation, 16, 1193–1234.
Donoho, D. L., & Elad, M. (2003). Maximal sparsity representation vialminimization. Proceedings of the National Academy Sciences, 100, 2197–2202.
Cen, L., Ser, W., Cen, W., et al. (2010) Linear sparse array synthesis via convex optimization. In Proceedings of 2010 IEEE international symposium on circuits and systems (ISCAS) (pp. 4233–4236). IEEE.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Du, Y., Hu, F., Liu, X. et al. Planar Sparse Array Synthesis for Sensor Selection by Convex Optimization with Constrained Beam Pattern. Wireless Pers Commun 89, 1147–1163 (2016). https://doi.org/10.1007/s11277-016-3309-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-016-3309-6