2017
DOI: 10.1002/tee.22511
|View full text |Cite
|
Sign up to set email alerts
|

Synthesis of frequency‐invariant patterns by the fast multitask compressive sensing

Abstract: A new method for the synthesis of wideband frequency-invariant pencil-beam patterns with nonuniformly spaced linear arrays is proposed. This scheme is designed under the framework of fast multitask compressive sensing. The minimum spacing between antenna elements can be controlled to make sure that the obtained arrays are physically realizable. The results achieved are comparable to those obtained by the state-of-the-art techniques.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…To implement design verification of the proposed approach SSL-SA, the effectiveness performance of simultaneously structured approximation is evaluated based on sparse signals with transformation optimization. Our proposed method SSL-SA is compared with the similarly existing work for sparse approximation where the original Structured Sparse Models for l1 or l2 reweighting (SSM-1, SSM-2) [3] and the Bayesian Compressive Sensing (BCS) are included [5]. The number of initial random measurements N=40.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…To implement design verification of the proposed approach SSL-SA, the effectiveness performance of simultaneously structured approximation is evaluated based on sparse signals with transformation optimization. Our proposed method SSL-SA is compared with the similarly existing work for sparse approximation where the original Structured Sparse Models for l1 or l2 reweighting (SSM-1, SSM-2) [3] and the Bayesian Compressive Sensing (BCS) are included [5]. The number of initial random measurements N=40.…”
Section: Resultsmentioning
confidence: 99%
“…Various methods have been proposed including sparse subspace clustering, simultaneous sparse learning, and empirical Bayesian models [3][4][5]. To effectively deal with the miscellaneous issues for collections of high-dimension data in the real-world, sparse subspace clustering has an equal verification point that lies in a union of low-dimension subspaces.…”
Section: Introductionmentioning
confidence: 99%