Array pattern nulling by operating on the roots of the array polynomial in the complex plane using a genetic algorithm (GA) is demonstrated. A pattern envelope constraint and an array efficiency criterion are applied. The algorithm is much faster than a similar GA operating on the complex weights of the array factor.
No takes yet. Share an insight, caveat, or question.
Mitchell et al. (1996) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: