2018
DOI: 10.1109/tap.2018.2842258
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Programming Applied to Large Circular Arrays Thinning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 32 publications
0
11
0
Order By: Relevance
“…Since we have known the quantized weights , the subsequent procedures can be performed similarly to [ 9 , 11 , 32 ]. We first divide the whole circular aperture by concentric circle, with being defined as where represents the ceiling function.…”
Section: The Proposed Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Since we have known the quantized weights , the subsequent procedures can be performed similarly to [ 9 , 11 , 32 ]. We first divide the whole circular aperture by concentric circle, with being defined as where represents the ceiling function.…”
Section: The Proposed Methodsmentioning
confidence: 99%
“…We emphasize more the sum of the distribution in a narrow ring within a certain radius range. On the other hand, to prevent adverse clustering that further deteriorates the azimuthal symmetric property, the most reasonable way is to space the weights uniformly in the ring [ 11 ]. Then, the problem becomes how to space (at most) two kinds of weights into a ring and make the ring satisfy the rotational symmetry property as much as possible.…”
Section: The Proposed Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…arrays [1]- [8]. Particular attention was paid to array pattern synthesis by using a deterministic approach [9]- [16], statistic or heuristic approach by natural algorithm [17], mathematical approach [18], [19], as well as quasi brute force method by evaluating all possible combinations [20]- [22]. Synthesis results have subsequently been applied in more recent years to designs of planar and linear arrays [23]- [33].…”
Section: Introductionmentioning
confidence: 99%
“…The optimization process is performed under the constraint of maintaining the amplitude response error in the main beam, and the attenuation in the side lobe region within predetermined levels. In [9], a dynamic programming algorithm for large circular antenna arrays (CAAs) thinning using reduced number of antenna elements is introduced. It divides the CAA into several rings and the optimization problem is confined to the determination of the number of active elements in each ring and turning off the non-active elements.…”
Section: Introductionmentioning
confidence: 99%