.png){kind=icon}
Return
Low-Complexity Sparse Array Synthesis Based on Off-Grid Compressive Sensing
.png){kind=icon}
OA
AI
DOI：10.1109/LAWP.2022.3192308.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a novel sparse array synthesis method for nonuniform planar arrays is proposed, which belongs to compressive sensing (CS) based synthesis. Particularly, we propose an off-grid refinement technique to simultaneously optimize the antenna element positions and excitations with a low complexity, in response to the antenna position optimization problem that is difficult for standard CS. More importantly, we take into account the minimum interelement spacing constraint for ensuring the physically realizable solution. Specifically, the off-grid orthogonal match pursuit algorithm is first proposed with low complexity and then off-grid look ahead orthogonal match pursuit is designed with better synthesis performance but higher complexity. In addition, simulation results have shown that the proposed schemes have more advantages in computational complexity and synthesis performances compared with the related method.
Keywords:
Matching pursuit algorithms
Optimization
Pattern matching
Transmission line matrix methods
Sensors
Planar arrays
Manganese
Interelement spacing constraint
off-grid compressive sensing (CS)
sparse array synthesis
Journal
IF:
4.8
Papers:
1.0W
Citations:
2.8W
Organization
No organization information available
Cited Papers
Neuronal nicotinic acetylcholine receptor binding affinities of boron-containing nicotine analogues
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more