Fast Beampattern Synthesis Algorithm for Flexible Conformal Array

Tian, Xiang; Chen, Hui; He, Mengmeng; Wang, Wen-Qin

doi:10.1109/lsp.2022.3223804

Cited by 8 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where g ∈ R (2M−2)×1 , U ∈ R 2M×(2M−2) , and A SL ∈ R 2M×2N SL . By substituting (20), (21), and ( 35)-( 37) into (34), it can be rewritten as min g,r 1 2…”

Section: Algorithm 1 : Admm-rcbmentioning

confidence: 99%

“…The interior-point method used in CVX suffers from a high computational burden, so it is not applicable in the scenario of 2D beampattern optimization. To alleviate the complexity arising from additional computation, recently, the alternating-direction method of multipliers (ADMM) [30] has attracted much attention and has been applied to RCB [31] and beampattern synthesis [32][33][34][35][36], as well as other areas of signal processing [37,38]. The ADMM decouples the global problem into several more local subproblems that are easier to solve, and it obtains the solution of the global problem by coordinating the solutions to the subproblems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the 2D Beampattern Optimization of Sparse Group-Constrained Robust Capon Beamforming with Conformal Arrays

Dai,

Sun,

Liu

2024

Remote Sensing

View full text Add to dashboard Cite

To overcome the problems of the high sidelobe levels and low computational efficiency of traditional Capon-based beamformers in optimizing the two-dimensional (elevation–azimuth) beampatterns of conformal arrays, in this paper, we propose a robust Capon beamforming method with sparse group constraints that is solved using the alternating-direction method of multipliers (ADMM). A robustness constraint based on worst-case performance optimization (WCPO) is imposed on the standard Capon beamformer (SCB) and then the sparse group constraints are applied to reduce the sidelobe level. The constraints are two sparsity constraints: the group one and the individual one. The former was developed to exploit the sparsity between groups based on the fact that the sidelobe can be divided into several different groups according to spatial regions in two-dimensional beampatterns, rather than different individual points in one-dimensional (azimuth-only) beampatterns. The latter is considered to emphasize the sparsity within groups. To solve the optimization problem, we introduce the ADMM to obtain the closed-form solution iteratively, which requires less computational complexity than the existing methods, such as second-order cone programming (SOCP). Numerical examples show that the proposed method can achieve flexible sidelobe-level control, and it is still effective in the case of steering vector mismatch.

show abstract

“…where g ∈ R (2M−2)×1 , U ∈ R 2M×(2M−2) , and A SL ∈ R 2M×2N SL . By substituting (20), (21), and ( 35)-( 37) into (34), it can be rewritten as min g,r 1 2…”

Section: Algorithm 1 : Admm-rcbmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the 2D Beampattern Optimization of Sparse Group-Constrained Robust Capon Beamforming with Conformal Arrays

Dai,

Sun,

Liu

2024

Remote Sensing

View full text Add to dashboard Cite

show abstract

“…Tese excellent properties have made it the subject of intensive investigations in recent years [1][2][3][4]. In particular, array synthesis patterns with arbitrary element positions have attracted more attention [5,6]. Compared with a uniform array antenna with the same aperture, the sparse array antenna can achieve the same resolution with fewer array elements; then, the cost of the antenna system is reduced [7].…”

Section: Introductionmentioning

confidence: 99%

Synthesis of Sparse Uniformly Excited Concentric Ring Arrays Using the Chaos Sparrow Search Algorithm

Wang

Tian

Tao

2023

International Journal of Antennas and Propagation

View full text Add to dashboard Cite

In this paper, an effective synthesis method for sparse uniformly excited concentric ring array (CRA) element positions featuring a minimum sidelobe level (SLL) is presented. This method is based on the chaos sparrow search algorithm (CSSA), which can search for the optimal solution under multiple constraints. By improving the constraint on the number of array elements on each ring, the solution range of the optimal solution is further reduced, and the global search ability of the algorithm is effectively improved by introducing tent mapping into the algorithm to initialize the population. Numerical examples are presented to assess the effectiveness and reliability of the proposed method, showing that it can achieve better results than existing methods in the design of sparse concentric ring array arrangements.

show abstract

Low-rank tensor recovery for 2-D DOA estimation using cylindrical nested conformal array

Fu,

Zheng

2023

Digital Signal Processing

View full text Add to dashboard Cite

Fast Beampattern Synthesis Algorithm for Flexible Conformal Array

Cited by 8 publications

References 20 publications

On the 2D Beampattern Optimization of Sparse Group-Constrained Robust Capon Beamforming with Conformal Arrays

On the 2D Beampattern Optimization of Sparse Group-Constrained Robust Capon Beamforming with Conformal Arrays

Synthesis of Sparse Uniformly Excited Concentric Ring Arrays Using the Chaos Sparrow Search Algorithm

Low-rank tensor recovery for 2-D DOA estimation using cylindrical nested conformal array

Contact Info

Product

Resources

About