Chapter Summary

Chapter Summary

Key Points

  • 1.

    The DD channel acts by 2D convolution with a sparse kernel. The central structural result: yDD=h⋆⋆xDD+wDDy_{DD} = h \star\star x_{DD} + \mathbf{w}_{DD}, where h(Ο„,Ξ½)=βˆ‘i=1Phi δ(Ο„βˆ’Ο„i) δ(Ξ½βˆ’Ξ½i)h(\tau, \nu) = \sum_{i=1}^P h_i\,\delta(\tau - \tau_i)\,\delta(\nu - \nu_i). The 2D convolution is on the delay-Doppler torus and is doubly circular. The Zak covariance of Chapter 2 is what converts the time-domain channel's delay-and-Doppler-shift action into pure translations on the DD plane.

  • 2.

    Discrete form has PP taps per DD cell. On the (M,N)(M, N) grid with integer-indexed paths: YDD[β„“,k]=βˆ‘i=1Phi ejΞ±i(β„“,k) XDD[(β„“βˆ’β„“i)β€Šmodβ€ŠM,(kβˆ’ki)β€Šmodβ€ŠN]+WDD[β„“,k]Y_{DD}[\ell, k] = \sum_{i=1}^P h_i\,e^{j\alpha_i(\ell,k)}\,X_{DD}[(\ell-\ell_i)\bmod M, (k-k_i)\bmod N] + W_{DD}[\ell, k]. The equation has exactly PP terms β€” not MNMN. This is the concrete sparsity on the discrete grid.

  • 3.

    The DD channel matrix is a Kronecker sum of sparse shifts. HDD=βˆ‘ihi(Ξ NkiΞ”Nβ„“i)βŠ—Ξ Mβ„“i\mathbf{H}_{DD} = \sum_i h_i (\boldsymbol{\Pi}_N^{k_i}\boldsymbol{\Delta}_N^{\ell_i}) \otimes \boldsymbol{\Pi}_M^{\ell_i} has density P/(MN)β‰ͺ1P/(MN) \ll 1, is block circulant with circulant blocks, and is diagonalized by the 2D DFT. These three properties enable efficient detection algorithms with O(PMN)O(PMN) or O(MNlog⁑(MN))O(MN\log(MN)) complexity.

  • 4.

    The DD channel is time-invariant over one OTFS frame. Under block-fading (constant path geometry over T≀10T \leq 10 ms), the DD kernel h(Ο„,Ξ½)h(\tau, \nu) does not depend on time. One channel estimate suffices for the entire frame; one uniform detector works at every DD cell. Contrast with OFDM, where H(f,t)H(f, t) evolves visibly across a frame under mobility.

  • 5.

    Sparsity converts estimation from O(MN)O(MN)-dimensional to O(P)O(P)-dimensional. Pilot overhead drops from ∼10%\sim 10\% (per-subcarrier DMRS in OFDM) to ∼1%\sim 1\% (single embedded pilot + guard region in OTFS). Estimation MSE scales with PP, not with MNMN, because there are only PP unknowns. Detection complexity scales linearly in MNMN (up to log factors) rather than quadratically.

  • 6.

    Integer Doppler is a convenient fiction. Fractional Doppler offsets Ο΅=Ξ½iβˆ’ki/T\epsilon = \nu_i - k_i/T create inter-Doppler interference that spreads energy across neighboring cells. The exact treatment is in Chapter 10. For the analysis of Chapters 7-9, we assume integer indices and treat fractional effects as perturbations.

Looking Ahead

Having established the DD channel model, we now turn to OFDM β€” the waveform OTFS is designed to beat. Chapter 5 revisits OFDM through the DD lens: we will show that an OFDM symbol, viewed in the DD domain, spreads across every Doppler bin, and that this spreading is precisely why OFDM loses to OTFS under mobility. Seeing OFDM's failure mode will motivate the OTFS modulator of Chapter 6, which cleanly exploits the DD structure we have developed here.