2008 IEEE Antennas and Propagation Society International Symposium 2008
DOI: 10.1109/aps.2008.4619662
|View full text |Cite
|
Sign up to set email alerts
|

Subarray weighting method for sidelobe suppression of difference pattern based on genetic algorithm

Abstract: This paper studies the method for sidelobe suppression of difference pattern at subarray level in phased array. Sidelobe suppression of difference pattern by digital weighting at subarray level takes advantage that the hardware cost and complexity can be reduced effectively. The optimization method for subarray weights based on genetic algorithm is presented. In order to avoid being constrained on local optimal solution of genetic operation, we partition the genetic optimization process into two stages. Baylis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…The array elements are evenly spaced in the -axis and -axis directions. Using the method described in reference [ 27 ] to extract the gain pattern of each array element and the coupling matrix between them, bring the data into Equation (7) for simulation.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The array elements are evenly spaced in the -axis and -axis directions. Using the method described in reference [ 27 ] to extract the gain pattern of each array element and the coupling matrix between them, bring the data into Equation (7) for simulation.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…It is also possible to reduce SLL while maintaining high transmit and receive gains in desired directions. GA is a well-studied method of solving the issue of sidelobe suppression [ 27 ], array partitioning [ 28 ], and sparse arrays [ 29 , 30 ]. Therefore, this paper applies GA to the uniform planar phased array ALSTAR system to design shared aperture transmit and receive subarray under beam constraints.…”
Section: Sparse Shared Aperture For Alstar With Beam Constraintsmentioning
confidence: 99%
“…Referring to (10), we can obtain the weight w by the convex optimization algorithm (CVX). It is used to evaluate the contribution of each element in multiple given directions.…”
Section: B Optimize Excitation Valuementioning
confidence: 99%
“…Performance indicators such as sidelobe levels or beam widths are often used as optimization goals [8]. Genetic algorithm [9][10], differential evolution algorithm [11], convex optimization algorithm [12], sequential convex optimization algorithm [13], and particle swarm algorithm [14] are typical examples of heuristic algorithms. Although these algorithms can achieve narrow main lobes and low sidelobes in patterns, they usually require more computing resources than the excitation matching method.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, a genetic algorithm optimization is used to reduce the sidelobe level for linear array antennas [11,12,18,3,16,4,15]. Genetic algorithm is used for optimizing the array element position for planar array antenna [17,2], the array weighting for difference pattern antenna [8], and the array placement for circular array antenna [9]. This paper optimizes the array elements weights with −30 dB precision in order to reduce the sidelobe level of the radar phased array antenna.…”
Section: Introductionmentioning
confidence: 99%