Fast Sidelobe Calculation and Suppression in Arbitrary Two-Dimensional Phased Arrays

Miao, Ke; Zhang, Yi; Sun, Houjun

doi:10.1109/lawp.2021.3067380

Cited by 3 publications

(8 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, some approximation is needed. Considering that (u(k), v(k)) are approaching the true extreme point (u m , v m ) after iterations, they can be used as the estimated sidelobe positions in [18] and the elements in the Hessian matrix can be approximated as,…”

Section: Newton's Iterative Methodsmentioning

confidence: 99%

“…We considered the result of the sampling number of 1000 to be the accurate value. We also applied the fast method in [18] for comparison.…”

Section: Sidelobe Calculation For Square Aperture Arraysmentioning

confidence: 99%

“…Previous studies for SLL calculation have employed two main kinds of method, the conventional method [4,6] and the fast formula method [18].…”

Section: Introductionmentioning

confidence: 99%

“…In numerical analysis, Newton's iterative method is a fast convergent, zero-finding algorithm [19]. Combining the approximate formula in [18] with Newton's iterative method, the proposed method adopts simple sampling of the angle domain to gradually approach the actual sidelobe positions. After comparison with the edge pattern level, the PSLL is finally obtained.…”

Section: Introductionmentioning

confidence: 99%

“…The novel features and contributions of this study can be summarized as follows, (1) The combination of Newton's iterative method and the approximate linear formula not only reduces the calculation pressure but also avoids the input of the estimated sidelobe positions in [18]. The linear formula facilitates the computing of second derivatives.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Fast Sidelobe Calculation for Planar Phased Arrays Using an Iterative Sidelobe Seeking Method

Miao¹,

Zhang²,

Jing³

et al. 2022

Electronics

Self Cite

View full text Add to dashboard Cite

Sidelobe level is a key parameter for phased array design. However, the conventional method for sidelobe level calculation is time-consuming due to the high sampling number of the radiation pattern. In this paper, an iterative sidelobe-seeking method for sidelobe calculation of arbitrarily distributed planar arrays is proposed to shorten the computing time. By applying Newton’s iterative method with an approximate formula, the proposed method uses less sampling to obtain the sidelobe positions and the peak sidelobe level. Numerical experiments were carried out and verified the effectiveness of the proposed method. Compared with the conventional method, the proposed method had a similar optimization effect but saved 80% of the algorithm time in the synthesis of a sparse planar array.

show abstract

Section: Newton's Iterative Methodsmentioning

confidence: 99%

“…We considered the result of the sampling number of 1000 to be the accurate value. We also applied the fast method in [18] for comparison.…”

Section: Sidelobe Calculation For Square Aperture Arraysmentioning

confidence: 99%

“…Previous studies for SLL calculation have employed two main kinds of method, the conventional method [4,6] and the fast formula method [18].…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning