Open AccessSynthesising multiple‐pattern sparse linear array with accurate sidelobe control by the extended reweighted L1‐norm minimisation
Author(s) -
Ma Xinyu,
Liu Yanhui,
Xu Kai Da,
Zhu Chunhui,
Liu Qing Huo
Publication year - 2018
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2018.0333
Subject(s) - minimisation (clinical trials) , compressed sensing , algorithm , norm (philosophy) , regular polygon , mathematics , minification , computer science , mathematical optimization , statistics , geometry , political science , law
The problem of synthesising a sparse linear array with multiple patterns is formulated as an extended reweighted ℓ 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.