Abstract
Compressed sensing techniques have extensive applications in radar signal processing. Convex optimization approaches, such as ℓ2,1 minimization, are used for multichannel sparse signal recovery. However, when jointly sparse signals also exhibit the constant modulus (CM) property, ℓ2,1 minimization cannot utilize this prior information. In this article, we focus on utilizing ℓ∞ 1 minimization to recover sparse signals with the CM property. We first establish a sufficient recovery condition for jointly sparse signals. Based on the duality theory, our main theorem sheds light on the superiority of ℓ∞ 1 minimization over ℓ2, 1 minimization in the CM signal recovery. In addition, we provide an average-case analysis for ℓ∞1 minimization. These results are applicable to the direction-of-arrival estimation with a nonuniform linear array and have practical relevance. A fast algorithm based on the alternating direction method of multipliers is proposed, and extensive numerical simulations are carried out to validate the results obtained.
| Original language | English |
|---|---|
| Pages (from-to) | 9761-9773 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Aerospace and Electronic Systems |
| Volume | 61 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2025 |
Keywords
- Average-case analysis
- compressed sensing
- constant modulus (CM)
- convex optimization
- direction-of-arrival (DOA) estimation
- multichannel sparse recovery
Fingerprint
Dive into the research topics of 'Multichannel Sparse Recovery for Constant Modulus Signals via ℓ∞ 1 Minimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver