Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array
Sparse-array synthesis can considerably reduce the number of sensor elements while optimizing the beam-pattern response performance. The sparsity of an array is related to the degrees of freedom of the array elements. A sparse-array method based on iterative convex optimization and a simulated-annea...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-03-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/12/6/1401 |
| _version_ | 1797612170374021120 |
|---|---|
| author | Boxuan Gu Rongxin Jiang Xuesong Liu Yaowu Chen |
| author_facet | Boxuan Gu Rongxin Jiang Xuesong Liu Yaowu Chen |
| author_sort | Boxuan Gu |
| collection | DOAJ |
| description | Sparse-array synthesis can considerably reduce the number of sensor elements while optimizing the beam-pattern response performance. The sparsity of an array is related to the degrees of freedom of the array elements. A sparse-array method based on iterative convex optimization and a simulated-annealing expanded array is proposed in this paper. This method transforms the sparse-array problem into a minimum <i>l</i><sub>1</sub> norm problem and obtains the sparse array by solving the convex optimization problem using the primal-dual algorithm. Meanwhile, to improve the degree of freedom, array elements are expanded using stochastic perturbation. According to the simulated-annealing algorithm, the closed array elements are reopened with a specific probability, which is iteratively thinned and expanded. The results show that the proposed method can obtain an extremely sparse array, which is better than that obtained using the existing methods. |
| first_indexed | 2024-03-11T06:38:30Z |
| format | Article |
| id | doaj.art-14158d4a30df413290e3ddd559f78ba7 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-11T06:38:30Z |
| publishDate | 2023-03-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-14158d4a30df413290e3ddd559f78ba72023-11-17T10:45:01ZengMDPI AGElectronics2079-92922023-03-01126140110.3390/electronics12061401Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded ArrayBoxuan Gu0Rongxin Jiang1Xuesong Liu2Yaowu Chen3Institute of Advanced Digital Technology and Instrumentation, Zhejiang University, Hangzhou 310027, ChinaZhejiang Provincial Key Laboratory for Network Multimedia Technologies, Zhejiang University, Hangzhou 310027, ChinaState Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, ChinaEngineering Research Center of Embedded Systems Education Department, Zhejiang University, Hangzhou 310027, ChinaSparse-array synthesis can considerably reduce the number of sensor elements while optimizing the beam-pattern response performance. The sparsity of an array is related to the degrees of freedom of the array elements. A sparse-array method based on iterative convex optimization and a simulated-annealing expanded array is proposed in this paper. This method transforms the sparse-array problem into a minimum <i>l</i><sub>1</sub> norm problem and obtains the sparse array by solving the convex optimization problem using the primal-dual algorithm. Meanwhile, to improve the degree of freedom, array elements are expanded using stochastic perturbation. According to the simulated-annealing algorithm, the closed array elements are reopened with a specific probability, which is iteratively thinned and expanded. The results show that the proposed method can obtain an extremely sparse array, which is better than that obtained using the existing methods.https://www.mdpi.com/2079-9292/12/6/1401sparse arrayconvex optimizationsimulated annealing |
| spellingShingle | Boxuan Gu Rongxin Jiang Xuesong Liu Yaowu Chen Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array Electronics sparse array convex optimization simulated annealing |
| title | Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array |
| title_full | Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array |
| title_fullStr | Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array |
| title_full_unstemmed | Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array |
| title_short | Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array |
| title_sort | extreme sparse array synthesis via iterative convex optimization and simulated annealing expanded array |
| topic | sparse array convex optimization simulated annealing |
| url | https://www.mdpi.com/2079-9292/12/6/1401 |
| work_keys_str_mv | AT boxuangu extremesparsearraysynthesisviaiterativeconvexoptimizationandsimulatedannealingexpandedarray AT rongxinjiang extremesparsearraysynthesisviaiterativeconvexoptimizationandsimulatedannealingexpandedarray AT xuesongliu extremesparsearraysynthesisviaiterativeconvexoptimizationandsimulatedannealingexpandedarray AT yaowuchen extremesparsearraysynthesisviaiterativeconvexoptimizationandsimulatedannealingexpandedarray |