From Born Approximation to the Discrete Sensing Matrix

From Continuous Integral to Matrix-Vector Product

The Born integral of the previous section is a continuous linear operator mapping the reflectivity function c(p)c(\mathbf{p}) to the measured data. In this section we discretize the scene on a grid and show, step by step, how the integral becomes a finite-dimensional matrix-vector product y=Ac+w\mathbf{y} = \mathbf{A}\mathbf{c} + \mathbf{w}. This is the central equation of the book. Every reconstruction algorithm in Parts IV-VII operates on this model.

Definition:

Scene Discretization

The target region Ω\Omega is discretized onto a uniform grid of QQ voxels (pixels in 2D), with centers {pq:q=1,,Q}\{\mathbf{p}_{q} : q = 1, \ldots, Q\} and voxel volume ΔV=Vol(Ω~)/Q\Delta V = \text{Vol}(\tilde{\Omega})/Q. The discretized reflectivity vector is

c={Vol(Ω~)Qc(pq):q=1,,Q}CQ,\mathbf{c} = \left\{\frac{\text{Vol}(\tilde{\Omega})}{Q} \, c(\mathbf{p}_{q}) : q = 1, \ldots, Q \right\} \in \mathbb{C}^Q,

where Ω~=Ωp0\tilde{\Omega} = \Omega - \mathbf{p}_{0} is the target region translated to the origin.

The factor Vol(Ω~)/Q=ΔV\text{Vol}(\tilde{\Omega})/Q = \Delta V absorbs the integration measure. As QQ \to \infty, the discretization error vanishes and we recover the continuous integral.

Theorem: Taylor Expansion and Wavenumber Decomposition

Let Ω\Omega be a target region centered at p0\mathbf{p}_{0}, small with respect to the distances d(s,p0)d(\mathbf{s}, \mathbf{p}_{0}) and d(p0,r)d(\mathbf{p}_{0}, \mathbf{r}). Then the round-trip phase κ(d(s,p)+d(p,r))\kappa(d(\mathbf{s}, \mathbf{p}) + d(\mathbf{p}, \mathbf{r})) can be decomposed as

κ(d(s,p)+d(p,r))κ(d(s,p0)+d(p0,r))+(κs+κr)T(pp0),\kappa\bigl(d(\mathbf{s}, \mathbf{p}) + d(\mathbf{p}, \mathbf{r})\bigr) \approx \kappa\bigl(d(\mathbf{s}, \mathbf{p}_{0}) + d(\mathbf{p}_{0}, \mathbf{r})\bigr) + (\boldsymbol{\kappa}_s + \boldsymbol{\kappa}_r)^\mathsf{T}(\mathbf{p} - \mathbf{p}_{0}),

where the transmitter wavenumber vector and receiver wavenumber vector are

κs=κp0sd(s,p0),κr=κp0rd(p0,r).\boldsymbol{\kappa}_s = \kappa \frac{\mathbf{p}_{0} - \mathbf{s}}{d(\mathbf{s}, \mathbf{p}_{0})}, \qquad \boldsymbol{\kappa}_r = \kappa \frac{\mathbf{p}_{0} - \mathbf{r}}{d(\mathbf{p}_{0}, \mathbf{r})}.

Defining the combined wavenumber κs,r=κs+κr\kappa_{\mathbf{s},\mathbf{r}} = \boldsymbol{\kappa}_s + \boldsymbol{\kappa}_r, the scattered field becomes

x(s,r;f)=GtxGrxejκ(d(s,p0)+d(p0,r))d(s,p0)d(p0,r)Ω~c(p~)ejκs,rTp~dp~.x(\mathbf{s}, \mathbf{r}; f) = \frac{\sqrt{G^{\text{tx}} G^{\text{rx}}} \, e^{-j\kappa(d(\mathbf{s}, \mathbf{p}_{0}) + d(\mathbf{p}_{0}, \mathbf{r}))}}{d(\mathbf{s}, \mathbf{p}_{0})\,d(\mathbf{p}_{0}, \mathbf{r})} \int_{\tilde{\Omega}} c(\tilde{\mathbf{p}}) \, e^{-j\kappa_{\mathbf{s},\mathbf{r}}^\mathsf{T} \tilde{\mathbf{p}}} \, d\tilde{\mathbf{p}}.

The first-order Taylor expansion replaces the exact spherical propagation phase with a plane-wave approximation local to the target. The error is second-order in pp0/d\|\mathbf{p} - \mathbf{p}_{0}\|/d, which is small by the far-field assumption. The key consequence: the integral over the target becomes a Fourier transform.

Definition:

The Sensing Matrix

Consider a system with MM transmitters T={s1,,sM}\mathcal{T} = \{\mathbf{s}_{1}, \ldots, \mathbf{s}_{M}\}, NN receivers R={r1,,rN}\mathcal{R} = \{\mathbf{r}_{1}, \ldots, \mathbf{r}_{N}\}, and KK frequency subcarriers F={f1,,fK}\mathcal{F} = \{f_1, \ldots, f_K\}. The scene is discretized into QQ voxels.

Define the transmitter steering vector and receiver steering vector for subcarrier kk and voxel qq:

ak,q={Gitxej2π(f0+fk)τiejκi,kTpqd(si,p0):i=1,,M},\mathbf{a}_{k,q} = \left\{\frac{\sqrt{G^{\text{tx}}_{i}} \, e^{-j2\pi(f_0 + f_k)\tau_i} \, e^{-j\boldsymbol{\kappa}_{i,k}^\mathsf{T} \mathbf{p}_{q}}}{d(\mathbf{s}_{i}, \mathbf{p}_{0})} : i = 1, \ldots, M\right\},

bk,q={Gjrxej2π(f0+fk)τ^jejκ^j,kTpqd(p0,rj):j=1,,N},\mathbf{b}_{k,q} = \left\{\frac{\sqrt{G^{\text{rx}}_{j}} \, e^{-j2\pi(f_0 + f_k)\hat{\tau}_j} \, e^{-j\hat{\boldsymbol{\kappa}}_{j,k}^\mathsf{T} \mathbf{p}_{q}}}{d(\mathbf{p}_{0}, \mathbf{r}_{j})} : j = 1, \ldots, N\right\},

where τi=d(si,p0)/c\tau_i = d(\mathbf{s}_{i}, \mathbf{p}_{0})/\text{c} and τ^j=d(p0,rj)/c\hat{\tau}_j = d(\mathbf{p}_{0}, \mathbf{r}_{j})/\text{c}.

The sensing matrix ACMNK×Q\mathbf{A} \in \mathbb{C}^{MNK \times Q} is constructed by stacking:

A=[A1;A2;;AK],Ak=[ak,1bk,1,,ak,Qbk,Q].\mathbf{A} = [\mathbf{A}_{1}; \mathbf{A}_{2}; \ldots; \mathbf{A}_{K}], \qquad \mathbf{A}_{k} = [\mathbf{a}_{k,1} \otimes \mathbf{b}_{k,1}, \ldots, \mathbf{a}_{k,Q} \otimes \mathbf{b}_{k,Q}].

The observation vector yCMNK\mathbf{y} \in \mathbb{C}^{MNK} satisfies

y=Ac+w,\boxed{\mathbf{y} = \mathbf{A}\mathbf{c} + \mathbf{w}},

where wCN(0,σ2I)\mathbf{w} \sim \mathcal{CN}(\mathbf{0}, \sigma^2\mathbf{I}) is AWGN.

The (m,q)(m,q)-th entry of A\mathbf{A} encodes all the physics: propagation phase, geometric spreading, antenna gains, and frequency dependence for the mm-th measurement and qq-th voxel.

Definition:

Backpropagation (Matched-Filter) Imaging

The standard baseline image formation is backpropagation (BP):

c^BP=AHD1y,\hat{\mathbf{c}}^{\text{BP}} = \mathbf{A}^{H} \mathbf{D}^{-1} \mathbf{y},

where D\mathbf{D} is a diagonal matrix that compensates for the distance-dependent power gains:

D=IKdiag ⁣(Gitxd(si,p0)2:i=1,,M)diag ⁣(Gjrxd(p0,rj)2:j=1,,N).\mathbf{D} = \mathbf{I}_K \otimes \text{diag}\!\left(\frac{G^{\text{tx}}_{i}}{d(\mathbf{s}_{i}, \mathbf{p}_{0})^2} : i = 1, \ldots, M\right) \otimes \text{diag}\!\left(\frac{G^{\text{rx}}_{j}}{d(\mathbf{p}_{0}, \mathbf{r}_{j})^2} : j = 1, \ldots, N\right).

Backpropagation coherently sums all measurements after rephasing and compensating for the known propagation losses. It is the adjoint (matched filter) applied to the data.

BP is fast and requires no matrix inversion, but its resolution is limited by the point-spread function AHA\mathbf{A}^{H} \mathbf{A} — it cannot super-resolve beyond the diffraction limit. All advanced reconstruction methods (regularized LS, LASSO, deep learning) attempt to improve upon BP by incorporating prior information about the scene.

,

Sensing Matrix Structure

Visualize the magnitude of the sensing matrix A|\mathbf{A}| as a heatmap. Observe how the structure changes with array geometry and frequency configuration.

Parameters
4
4
4
8

Example: Computing a Single Entry of the Sensing Matrix

A system has a single Tx at s=(0,20)\mathbf{s} = (0, -20) m and a single Rx at r=(10,15)\mathbf{r} = (10, -15) m. The target center is p0=(0,0)\mathbf{p}_{0} = (0, 0) and a voxel is at pq=(0.5,0.3)\mathbf{p}_{q} = (0.5, 0.3) m. The carrier frequency is f0=10f_0 = 10 GHz, the subcarrier offset is f=0f = 0. Antenna gains are Gtx=Grx=1G^{\text{tx}} = G^{\text{rx}} = 1 (isotropic). Compute the sensing matrix entry [A]1,q[\mathbf{A}]_{1,q}.

Quick Check

A system has M=4M = 4 transmitters, N=4N = 4 receivers, and K=8K = 8 OFDM subcarriers. The scene is discretized into Q=64×64=4096Q = 64 \times 64 = 4096 voxels. What are the dimensions of the sensing matrix A\mathbf{A}?

128×4096128 \times 4096

4096×1284096 \times 128

4096×40964096 \times 4096

16×409616 \times 4096

Sensing Matrix

The matrix ACMNK×Q\mathbf{A} \in \mathbb{C}^{MNK \times Q} that maps the discretized reflectivity vector c\mathbf{c} to the observation vector y\mathbf{y} via y=Ac+w\mathbf{y} = \mathbf{A}\mathbf{c} + \mathbf{w}. Each entry encodes the propagation physics (phase, attenuation, antenna gain) for one measurement-voxel pair.

Related: The Born Approximation, Backpropagation (Matched-Filter) Imaging

Why This Matters: The Sensing Matrix Is a Channel Matrix

The observation model y=Ac+w\mathbf{y} = \mathbf{A}\mathbf{c} + \mathbf{w} is structurally identical to the MIMO channel model y=Hx+w\mathbf{y} = \mathbf{H}\mathbf{x} + \mathbf{w} from Telecom Ch 15. The key difference is the interpretation: in communications, x\mathbf{x} is the transmitted signal (designed by us) and H\mathbf{H} is the unknown channel (estimated from pilots). In imaging, A\mathbf{A} is the known operator (computed from geometry) and c\mathbf{c} is the unknown scene (estimated from measurements). The mathematical tools — SVD, condition number, regularization — are the same, but applied to the dual problem.

See full treatment in Kronecker Product Structure of the Sensing Matrix