Chapter Summary
Chapter 15 Summary: Diffraction Tomography
Key Points
- 1.
CT as the canonical inverse problem. The Radon transform and Fourier slice theorem provide the mathematical template for tomographic imaging. Each projection fills a radial line in Fourier space; limited views create spectral gaps and streak artifacts. FBP inverts the Radon transform using a ramp filter and back-projection.
- 2.
The Fourier diffraction theorem. Under the Born approximation, scattered far-field data map to the object spectrum on Ewald circles (not straight lines as in CT). The Ewald vector links each measurement to a Fourier-space point. In the high-frequency limit, the FDT reduces to the Fourier slice theorem.
- 3.
Direct inversion. Gridding + inverse FFT provides fast reconstruction for well-sampled configurations. The density compensation function corrects for non-uniform k-space sampling. NUFFT provides guaranteed error bounds. Iterative methods (SIRT, ART, CGLS) handle incomplete angular coverage with implicit regularization.
- 4.
Multi-frequency coverage. Each frequency contributes an Ewald sphere of different radius. Bandwidth controls range resolution (); angular aperture controls cross-range resolution (). Both diversities are needed for high-quality reconstruction.
- 5.
Near-field diffraction tomography. Most RF imaging systems operate in the near field where spherical wavefront modeling is essential. The NF-FF transformation converts near-field data to far-field equivalent. XL-MIMO arrays have far-field distances of hundreds of meters, making near-field imaging the default regime. Evanescent waves enable sub-wavelength resolution at very short range.
Looking Ahead
This chapter has established the Fourier-based imaging framework for diffraction tomography, from the CT template through RF diffraction tomography to multi-frequency and near-field extensions.
The key remaining challenge is phase: all methods in this chapter assume access to the complex (amplitude + phase) scattered field. In many RF scenarios, only the magnitude is measurable -- phase is lost. Chapter 16 addresses this fundamental challenge through phase retrieval algorithms, which recover the missing phase from magnitude-only measurements.