Prerequisites & Notation

Prerequisites for This Chapter

This chapter applies sparse recovery algorithms to the RF imaging model y=Ac+w\mathbf{y} = \mathbf{A}\mathbf{c} + \mathbf{w}. 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 f+hf + h?

  • ADMM derivation and convergence(Review RFI Ch 04 / Telecom Ch 03)

    Self-check: Can you derive the ADMM updates for min⁑f(x)+g(z)\min f(\mathbf{x}) + g(\mathbf{z}) s.t. x=z\mathbf{x} = \mathbf{z}?

  • 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 Ac\mathbf{A}\mathbf{c} and AHy\mathbf{A}^{H}\mathbf{y}?

  • Matched filter baseline(Review RFI Ch 13)

    Self-check: Why does the matched filter AHy\mathbf{A}^{H}\mathbf{y} produce sidelobe artifacts?

Notation and Conventions

Notation used throughout this chapter. All algorithms operate on the linear imaging model y=Ac+w\mathbf{y} = \mathbf{A}\mathbf{c} + \mathbf{w}.

SymbolMeaningIntroduced
c\mathbf{c}Discretized reflectivity vector (scene to recover)
y\mathbf{y}Measurement vector
A\mathbf{A}Sensing / measurement matrix
Ξ»\lambdaRegularization parameter
w\mathbf{w}Additive noise vector
Οƒ2\sigma^2Noise variance
SΞ»(β‹…)\mathcal{S}_{\lambda}(\cdot)Soft-thresholding operator at level Ξ»\lambda
LfL_fLipschitz constant of βˆ‡f\nabla f, equal to Οƒmax⁑2(A)\sigma_{\max}^2(\mathbf{A})
ρ\rhoADMM penalty parameter
βˆ‡D\nabla_DDiscrete gradient operator (finite differences)
βˆ₯β‹…βˆ₯TV\|\cdot\|_{\text{TV}}Total variation semi-norm
βˆ₯Xβˆ₯2,1\|\mathbf{X}\|_{2,1}Mixed β„“2,1\ell_{2,1} norm (group / row sparsity)
βˆ₯β‹…βˆ₯A\|\cdot\|_{\mathcal{A}}Atomic norm
Hs(β‹…)\mathcal{H}_s(\cdot)Hard-thresholding operator keeping ss largest entries