2019
DOI: 10.1109/access.2019.2932123
|View full text |Cite
|
Sign up to set email alerts
|

Grating Lobe Suppression of Non-Uniform Arrays Based on Position Gradient and Sigmoid Function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 23 publications
0
9
0
Order By: Relevance
“…[6], but weaker than that of Ref. [11]. The main reason is that the elements in the subarray in Ref.…”
Section: Optimisation and Test Resultsmentioning
confidence: 98%
See 2 more Smart Citations
“…[6], but weaker than that of Ref. [11]. The main reason is that the elements in the subarray in Ref.…”
Section: Optimisation and Test Resultsmentioning
confidence: 98%
“…The main reason is that the elements in the subarray in Ref. [11] are also optimised to aperiodic arrangement. Although this method enhances the ability of grating lobe suppression, it greatly increases the complexity of the system and the difficulty of engineering.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…If the value of N is large, the dimension of the search space will become high. Thus, efficient searching method should be used to reduce the calculation complexity [29][30][31].…”
Section: Figure 19 the Point Spread Function Of Optimal Phase Centermentioning
confidence: 99%
“…While some authors propose to engineer the element pattern such that radiation towards the arrayfactor-associated grating lobe would be minimized overall [12], [13], [16], this approach requires application-specific design of the active radiators, and is not always easy to apply for scanned array scenarios. Instead, most of the suggested methods use unequally spaced and non uniform excitation strategies to overcome the classical element-density/gratinglobes trade-off, and are generally based on optimization of a nonlinear cost function over some constraints which favor sparse arrays [9]- [11], [14], [15]. Usually, the solution relies on global optimization methods, giving rise to three main issues.…”
Section: Introductionmentioning
confidence: 99%