Prerequisites & Notation
Prerequisites for This Chapter
This chapter applies sparse recovery algorithms to the RF imaging model . The algorithms themselves (ISTA, FISTA, ADMM) were derived in RFI Ch 04 and Telecom Ch 03; here we focus on RF-imaging-specific applications, parameter selection strategies, and extensions including group sparsity, total variation, greedy methods, and gridless super-resolution.
- Proximal gradient methods (ISTA, FISTA)(Review RFI Ch 04 / Telecom Ch 03)
Self-check: Can you write the FISTA update for the composite objective ?
- ADMM derivation and convergence(Review RFI Ch 04 / Telecom Ch 03)
Self-check: Can you derive the ADMM updates for s.t. ?
- RIP and LASSO recovery guarantees(Review RFI Ch 11 / FSI Ch 13)
Self-check: Can you state the RIP-based bound for LASSO estimation error?
- RF sensing matrix Kronecker structure(Review RFI Ch 08)
Self-check: Can you explain how Kronecker structure accelerates and ?
- Matched filter baseline(Review RFI Ch 13)
Self-check: Why does the matched filter produce sidelobe artifacts?
Notation and Conventions
Notation used throughout this chapter. All algorithms operate on the linear imaging model .
| Symbol | Meaning | Introduced |
|---|---|---|
| Discretized reflectivity vector (scene to recover) | ||
| Measurement vector | ||
| Sensing / measurement matrix | ||
| Regularization parameter | ||
| Additive noise vector | ||
| Noise variance | ||
| Soft-thresholding operator at level | ||
| Lipschitz constant of , equal to | ||
| ADMM penalty parameter | ||
| Discrete gradient operator (finite differences) | ||
| Total variation semi-norm | ||
| Mixed norm (group / row sparsity) | ||
| Atomic norm | ||
| Hard-thresholding operator keeping largest entries |