Photo from academic.microsoft.com
The problem of synthesising a sparse linear array with multiple patterns is formulated as an extended reweighted l 1 -norm minimisation with multiple convex constraints. Synthesis results show that the… Click to show full abstract
The problem of synthesising a sparse linear array with multiple patterns is formulated as an extended reweighted l 1 -norm minimisation with multiple convex constraints. Synthesis results show that the proposed method can find the common sparse element positions with optimised excitations for multiple-pattern requirements, and the mainlobe, sidelobe as well as nulling region for each pattern can be accurately controlled.
Keywords:
sparse linear;
norm minimisation;
extended reweighted;
linear array;
reweighted norm;
multiple pattern
Journal Title: Electronics Letters
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Electronics Letters
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!