Chapter Summary

Chapter Summary

Key Points

  • 1.

    The symplectic Fourier transform (SFT) links DD and TF. The continuous SFT is a 2D Fourier transform with a symplectic sign pattern: FsF(f,t)=∬F(Ο„,Ξ½) eβˆ’j2Ο€(Ξ½tβˆ’fΟ„) dτ dΞ½\mathcal{F}_s F(f, t) = \iint F(\tau, \nu)\,e^{-j 2\pi (\nu t - f \tau)}\,d\tau\,d\nu. The sign choice makes the SFT intertwine delay-Doppler translations with time-frequency modulations β€” the Heisenberg-Weyl covariance we need.

  • 2.

    The ISFFT and SFFT are 2D DFTs. The discrete forms, XTF=ISFFT(XDD)X_{TF} = \text{ISFFT}(X_{DD}) and XDD=SFFT(XTF)X_{DD} = \text{SFFT}(X_{TF}), are inverse unitary 2D transforms computable in O(MNlog⁑(MN))O(MN\log(MN)) operations. At the OTFS transmitter, the ISFFT is a precoder on top of standard OFDM; at the receiver, the SFFT is a postcoder. Both are software-only additions to existing OFDM silicon.

  • 3.

    The discrete DD grid is a finite-dimensional signal space. An OTFS frame of duration TT and bandwidth WW has an MΓ—NM \times N DD grid with resolutions Δτ=1/W\Delta\tau = 1/W and Δν=1/T\Delta\nu = 1/T. Total grid size MN=TWMN = TW β€” the time-bandwidth product determines the dimensionality of the signal space. Path resolution requires βˆ£Ο„iβˆ’Ο„j∣β‰₯1/W|\tau_i - \tau_j| \geq 1/W or ∣νiβˆ’Ξ½j∣β‰₯1/T|\nu_i - \nu_j| \geq 1/T.

  • 4.

    OTFS = ISFFT precoder + OFDM modulator. The full OTFS transmit waveform is x(t)=βˆ‘β„“,kXDD[β„“,k] ϕℓ,k(t)x(t) = \sum_{\ell, k} X_{DD}[\ell, k]\,\phi_{\ell, k}(t) where Ο•β„“,k(t)\phi_{\ell, k}(t) is a delay-Doppler-shifted prototype pulse. This is exactly the Gabor expansion on the critical lattice. The ISFFT-plus-OFDM construction is the FFT-friendly implementation; the underlying structure is a Gabor frame.

  • 5.

    Each DD symbol is spread over the entire TF grid. The ISFFT of a single-impulse DD grid is a 2D complex exponential on the TF grid: one data symbol is transmitted through every TF cell. This spreading is the root of OTFS's full delay-Doppler diversity β€” a DD symbol survives a wide range of TF-grid erasures, and only fails when the channel simultaneously erases an entire plane wave, which is far less likely than erasing one subcarrier (OFDM's failure mode).

  • 6.

    OTFS deploys as a software precoder on OFDM hardware. With M,NM, N aligned to 5G NR numerology, OTFS can be deployed without changes to the RF front end, ADC/DAC, or OFDM baseband β€” only the digital baseband ISFFT/SFFT blocks must be added. This is a concrete path to deploying OTFS in standards.

Looking Ahead

With the Zak transform (Chapter 2) and the symplectic Fourier transform (Chapter 3) in hand, we are ready to derive the DD-domain input-output relation. Chapter 4 will prove that the DD channel acts as a 2D convolution with a sparse kernel β€” the formal sense in which the OTFS modulation "diagonalizes" the doubly-selective channel. Chapter 5 will then revisit OFDM through the DD lens, making precise why OFDM struggles with high Doppler. By Chapter 6, we will assemble the full OTFS transceiver, and the mathematical story begun in this chapter will close: data symbols placed on the DD grid arrive, after the channel, as data symbols on a shifted and attenuated DD grid β€” which a DD-domain detector (Chapter 8) can recover.