Abstract
The $l_{1}$ -norm-based sparse signal reconstruction has relatively satisfactory performance for near-field parameter estimation. However, its computational complexity is still much higher than that of most other near-field parameter estimation algorithms. In this letter, a reweighted smoothed $l_{0}$ -norm near-field parameter estimation algorithm is proposed based on the fourth-order cumulant statistics (FOC). The direction of arrival (DOA) and range parameters are solved respectively in the reweighted smoothed $l_{0}$ -norm sparse reconstruction method by a steepest ascent method. According to the numerical simulations, the proposed algorithm can achieve low-complexity and fast sparse parameter estimation. Finally the superiority of the proposed algorithm is proved through the comparison of simulation and calculation.
| Original language | English |
|---|---|
| Pages (from-to) | 74-78 |
| Number of pages | 5 |
| Journal | IEEE Communications Letters |
| Volume | 26 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2022 |
Keywords
- and sparse parameter estimation
- FOC
- low-complexity
- l₀-norm
- Near-filed localization
Fingerprint
Dive into the research topics of 'Fast Reweighted Smoothed l-Norm Near-Field Source Localization Based on Fourth-Order Statistics'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver