Vol. 168
Latest Volume
All Volumes
PIERC 168 [2026] PIERC 167 [2026] PIERC 166 [2026] PIERC 165 [2026] PIERC 164 [2026] PIERC 163 [2026] PIERC 162 [2025] PIERC 161 [2025] PIERC 160 [2025] PIERC 159 [2025] PIERC 158 [2025] PIERC 157 [2025] PIERC 156 [2025] PIERC 155 [2025] PIERC 154 [2025] PIERC 153 [2025] PIERC 152 [2025] PIERC 151 [2025] PIERC 150 [2024] PIERC 149 [2024] PIERC 148 [2024] PIERC 147 [2024] PIERC 146 [2024] PIERC 145 [2024] PIERC 144 [2024] PIERC 143 [2024] PIERC 142 [2024] PIERC 141 [2024] PIERC 140 [2024] PIERC 139 [2024] PIERC 138 [2023] PIERC 137 [2023] PIERC 136 [2023] PIERC 135 [2023] PIERC 134 [2023] PIERC 133 [2023] PIERC 132 [2023] PIERC 131 [2023] PIERC 130 [2023] PIERC 129 [2023] PIERC 128 [2023] PIERC 127 [2022] PIERC 126 [2022] PIERC 125 [2022] PIERC 124 [2022] PIERC 123 [2022] PIERC 122 [2022] PIERC 121 [2022] PIERC 120 [2022] PIERC 119 [2022] PIERC 118 [2022] PIERC 117 [2021] PIERC 116 [2021] PIERC 115 [2021] PIERC 114 [2021] PIERC 113 [2021] PIERC 112 [2021] PIERC 111 [2021] PIERC 110 [2021] PIERC 109 [2021] PIERC 108 [2021] PIERC 107 [2021] PIERC 106 [2020] PIERC 105 [2020] PIERC 104 [2020] PIERC 103 [2020] PIERC 102 [2020] PIERC 101 [2020] PIERC 100 [2020] PIERC 99 [2020] PIERC 98 [2020] PIERC 97 [2019] PIERC 96 [2019] PIERC 95 [2019] PIERC 94 [2019] PIERC 93 [2019] PIERC 92 [2019] PIERC 91 [2019] PIERC 90 [2019] PIERC 89 [2019] PIERC 88 [2018] PIERC 87 [2018] PIERC 86 [2018] PIERC 85 [2018] PIERC 84 [2018] PIERC 83 [2018] PIERC 82 [2018] PIERC 81 [2018] PIERC 80 [2018] PIERC 79 [2017] PIERC 78 [2017] PIERC 77 [2017] PIERC 76 [2017] PIERC 75 [2017] PIERC 74 [2017] PIERC 73 [2017] PIERC 72 [2017] PIERC 71 [2017] PIERC 70 [2016] PIERC 69 [2016] PIERC 68 [2016] PIERC 67 [2016] PIERC 66 [2016] PIERC 65 [2016] PIERC 64 [2016] PIERC 63 [2016] PIERC 62 [2016] PIERC 61 [2016] PIERC 60 [2015] PIERC 59 [2015] PIERC 58 [2015] PIERC 57 [2015] PIERC 56 [2015] PIERC 55 [2014] PIERC 54 [2014] PIERC 53 [2014] PIERC 52 [2014] PIERC 51 [2014] PIERC 50 [2014] PIERC 49 [2014] PIERC 48 [2014] PIERC 47 [2014] PIERC 46 [2014] PIERC 45 [2013] PIERC 44 [2013] PIERC 43 [2013] PIERC 42 [2013] PIERC 41 [2013] PIERC 40 [2013] PIERC 39 [2013] PIERC 38 [2013] PIERC 37 [2013] PIERC 36 [2013] PIERC 35 [2013] PIERC 34 [2013] PIERC 33 [2012] PIERC 32 [2012] PIERC 31 [2012] PIERC 30 [2012] PIERC 29 [2012] PIERC 28 [2012] PIERC 27 [2012] PIERC 26 [2012] PIERC 25 [2012] PIERC 24 [2011] PIERC 23 [2011] PIERC 22 [2011] PIERC 21 [2011] PIERC 20 [2011] PIERC 19 [2011] PIERC 18 [2011] PIERC 17 [2010] PIERC 16 [2010] PIERC 15 [2010] PIERC 14 [2010] PIERC 13 [2010] PIERC 12 [2010] PIERC 11 [2009] PIERC 10 [2009] PIERC 9 [2009] PIERC 8 [2009] PIERC 7 [2009] PIERC 6 [2009] PIERC 5 [2008] PIERC 4 [2008] PIERC 3 [2008] PIERC 2 [2008] PIERC 1 [2008]
2026-04-14
Efficient Reconfigurable Synthesis of Sparse Arrays with Minimum Spacing Constraints via Group off-Grid Orthogonal Matching Pursuit
By
Progress In Electromagnetics Research C, Vol. 168, 230-236, 2026
Abstract
To reduce the implementation complexity of reconfigurable sparse arrays, this study proposes a low-complexity group-sparse orthogonal matching pursuit (G-OMP) algorithm with a minimum spacing constraint for synthesizing sparse arrays with multiple beam-shared element positions. An off-grid OMP algorithm with a minimum spacing constraint can mitigate the accuracy degradation caused by fixed-grid discretization, thereby ensuring the practical feasibility of engineering implementations. To enable beam reconfigurability, a group-sparse structure is incorporated into the off-grid OMP algorithm, and a multi-beam group-sparse reconstruction algorithm based on a dynamic grouping strategy is proposed, allowing multiple beams to share sparse array element positions. Simulation results show that, under the simulation parameters, the proposed algorithm achieves low computational complexity while maintaining good radiation pattern performance.
Citation
Kunyu Gao, Yong Lv, Zixuan Wang, and Mingwei Shen, "Efficient Reconfigurable Synthesis of Sparse Arrays with Minimum Spacing Constraints via Group off-Grid Orthogonal Matching Pursuit," Progress In Electromagnetics Research C, Vol. 168, 230-236, 2026.
doi:10.2528/PIERC26021302
References

1. Van Trees, Harry L., Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory, John Wiley & Sons, 2002.

2. Eisenbeis, Joerg, Tobias Mahler, Pablo Ramos Lopez, and Thomas Zwick, "Channel estimation method for subarray based hybrid beamforming systems employing sparse arrays," Progress In Electromagnetics Research C, Vol. 87, 25-38, 2018.
doi:10.2528/pierc18062506        Google Scholar

3. Tang, Qi, Bin Wang, and Xue Tian, "Synthesis of antenna array based on hybrid improved sparrow search algorithm and convex programming," Progress In Electromagnetics Research C, Vol. 153, 247-255, 2025.
doi:10.2528/pierc25011903        Google Scholar

4. Zhao, Xiaowen and Yunhua Zhang, "An off-grid compressed sensing method for synthesis of maximally sparse arrays with arbitrary beampatterns," Progress In Electromagnetics Research C, Vol. 126, 227-241, 2022.
doi:10.2528/pierc22092702        Google Scholar

5. Wang, Lanmei, Xin-Kuan Wang, Guibao Wang, and Jian-Ke Jia, "A two-step method for the low-sidelobe synthesis of uniform amplitude planar sparse arrays," Progress In Electromagnetics Research M, Vol. 86, 153-162, 2019.
doi:10.2528/pierm19080612        Google Scholar

6. Battaglia, Giada M., Andrea Francesco Morabito, Gino Sorbello, and Tommaso Isernia, "Mask-constrained power synthesis of large and arbitrary arraysas a few-samples global optimization," Progress In Electromagnetics Research C, Vol. 98, 69-81, 2020.
doi:10.2528/pierc19082904        Google Scholar

7. Ullah, Naveed, Zhao Huiling, Tariq Rahim, Saeed Ur Rahman, and Mian MuhammadKamal, "Reduced side lobe level of sparse linear antenna array by optimized spacing and excitation amplitude using particle swarm optimization," 2017 7th IEEE International Symposium on Microwave, Antenna, Propagation, and EMC Technologies (MAPE), 96-99, Xi'an, China, 2017.
doi:10.1109/MAPE.2017.8250806

8. Chen, Kesong, Xiaohua Yun, Zishu He, and Chunlin Han, "Synthesis of sparse planar arrays using modified real genetic algorithm," IEEE Transactions on Antennas and Propagation, Vol. 55, No. 4, 1067-1073, 2007.
doi:10.1109/tap.2007.893375        Google Scholar

9. Wang, X. P., P. F. Gu, D. Z. Ding, and R. S. Chen, "Unitary matrix pencil method for multi-beam sparse linear array pattern synthesis," 2017 International Applied Computational Electromagnetics Society Symposium (ACES), 1-2, Suzhou, China, 2017.

10. Candes, Emmanuel J. and Michael B. Wakin, "An introduction to compressive sampling," IEEE Signal Processing Magazine, Vol. 25, No. 2, 21-30, 2008.
doi:10.1109/msp.2007.914731        Google Scholar

11. Oliveri, Giacomo and Andrea 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, Feb. 2011.
doi:10.1109/tap.2010.2096400        Google Scholar

12. Zhou, Wenjing, Mingwei Shen, Di Wu, and Daiyin Zhu, "Efficient beam-scanning wideband sparse array synthesis with minimum element spacing control," Signal Processing, Vol. 238, 110194, 2026.
doi:10.1016/j.sigpro.2025.110194        Google Scholar

13. Wang, Zhongyuan, Min Xu, Mingwei Shen, and Yipin Shen, "Pattern-reconfigurable sparse array synthesis with minimum element spacing constraint," Journal of Electromagnetic Waves and Applications, Vol. 39, No. 7, 810-821, 2025.
doi:10.1080/09205071.2025.2477662        Google Scholar

14. Yang, Zai, Lihua Xie, and Cishen Zhang, "Off-grid direction of arrival estimation using sparse Bayesian inference," IEEE Transactions on Signal Processing, Vol. 61, No. 1, 38-43, Jan. 2013.
doi:10.1109/tsp.2012.2222378        Google Scholar