Chapter Summary
Chapter 6 Summary: Caire's Unified Forward Model
Key Points
- 1.
The Born-approximation scattering integral can be analyzed in two equivalent ways: View A (Diffraction Tomography) — each measurement samples the scene's spatial Fourier transform at a k-space point; View B (Radar/Wireless) — each Tx-Rx pair performs matched filtering and coherent combination. Both derive from the same physics.
- 2.
Scene discretization on a grid of voxels converts the continuous Born integral into the linear observation model , where is the sensing matrix encoding all propagation physics. This is the central equation of the book.
- 3.
A first-order Taylor expansion of the propagation distances around the target center decomposes the round-trip phase into transmitter and receiver wavenumber vectors and . The combined wavenumber identifies the k-space point sampled by each measurement.
- 4.
The Ewald sphere gives the geometric locus of accessible k-space points: a sphere of radius for each transmitter direction. Multi-static, multi-frequency configurations tile k-space by sweeping over different Ewald spheres.
- 5.
The Fourier Diffraction Theorem states that each Born-approximation measurement directly equals (up to known factors) the spatial Fourier transform of the reflectivity at the corresponding k-space point — the RF analogue of the Fourier Slice Theorem in X-ray CT.
- 6.
Range resolution is (determined by bandwidth), while cross-range resolution is (determined by angular aperture). The diffraction limit is achieved only with full angular coverage.
- 7.
The imaging grid spacing is bounded by the spatial Nyquist condition , but in practice is set to the achievable resolution to balance accuracy and computational cost. The Manzoni-Caire tessellation analysis provides systematic tools for designing the array geometry to maximize k-space coverage.
Looking Ahead
Chapter 7 examines the Kronecker structure of the sensing matrix when the transmit array, receive array, and frequency sampling have separable geometries, and analyzes its spectral properties (singular values, condition number, coherence). This structure is what makes efficient matrix-vector products and GPU implementations possible, and determines which reconstruction algorithms will succeed.