Coded Modulation for OTFS: The Delay-Doppler Grid

When OFDM Breaks Down: Doubly-Selective Channels

The point is that OFDM's parallel-channel decomposition assumes a STATIC channel over the OFDM symbol duration. For a vehicle at 500 km/h and a 30 GHz carrier, the Doppler spread Ξ½max⁑\nu_{\max} can exceed Ξ”f\Delta f, which breaks subcarrier orthogonality and causes inter-carrier interference (ICI). OTFS (Orthogonal Time Frequency Space) modulation works in the delay-Doppler domain, where the channel is SPARSE and QUASI-STATIC β€” ideal for high-mobility scenarios. BICM over the delay-Doppler grid harvests diversity analogously to BICM-OFDM over subcarriers.

Definition:

Delay-Doppler Grid

The delay-Doppler domain represents a doubly-selective channel as a 2D function h(Ο„,Ξ½)h(\tau, \nu) of delay Ο„\tau and Doppler Ξ½\nu. For a channel with PP distinct physical paths, each path pp contributes a Dirac impulse: h(Ο„,Ξ½)=βˆ‘p=1Pgp δ(Ο„βˆ’Ο„p) δ(Ξ½βˆ’Ξ½p).h(\tau, \nu) = \sum_{p=1}^P g_p\, \delta(\tau - \tau_p)\, \delta(\nu - \nu_p). OTFS symbols X[β„“,k]X[\ell, k] are placed on an Nτ×NΞ½N_\tau \times N_\nu delay-Doppler grid. The channel h(Ο„,Ξ½)h(\tau, \nu) acts on this grid as a 2D convolution β€” much simpler than the time-varying convolution that a receiver sees in the time-frequency domain.

Definition:

Zak Transform

The Zak transform converts a time-domain signal x(t)x(t) to the delay-Doppler domain: Zx(Ο„,Ξ½)=Tβˆ‘n=βˆ’βˆžβˆžx(Ο„+nT) eβˆ’j2πνnT,Ο„βˆˆ[0,T),ν∈[0,1/T).Z_x(\tau, \nu) = \sqrt{T} \sum_{n=-\infty}^\infty x(\tau + nT)\, e^{-j 2\pi \nu n T}, \quad \tau \in [0, T), \nu \in [0, 1/T). It is invertible: x(t)=∫01/TZx(t,Ξ½) dΞ½x(t) = \int_0^{1/T} Z_x(t, \nu)\, d\nu. OTFS places data on the delay-Doppler grid, applies the inverse Zak transform to produce a time-domain signal, and inverts at the receiver. The key property: the channel, which is time-varying in the time-frequency domain, becomes a static 2D convolution in the delay-Doppler domain.

Theorem: OTFS Absorbs Doppler into a Sparse 2D Channel

Let a doubly-selective channel have PP physical paths with delays {Ο„p}\{\tau_p\} and Dopplers {Ξ½p}\{\nu_p\}. Then OTFS produces a 2D delay-Doppler channel with support concentrated on PP grid points (plus a small spread from pulse-shaping windowing). The received OTFS symbols satisfy Y[β„“,k]=βˆ‘pgp X[β„“βˆ’β„“p,kβˆ’kp]+W[β„“,k]Y[\ell, k] = \sum_p g_p\, X[\ell - \ell_p, k - k_p] + W[\ell, k] with (β„“p,kp)(\ell_p, k_p) the discretised delay-Doppler position of path pp.

OTFS Delay-Doppler Grid for a Sparse Channel

Visualise a 3-5 path physical channel mapped onto the delay-Doppler grid. As terminal velocity increases, paths spread along the Doppler axis but remain distinct grid points.

Parameters
3
300

BICM Over the Delay-Doppler Grid

BICM on OTFS works just like BICM on OFDM, with the grid dimension replaced. Each coded bit is mapped to a delay-Doppler grid point; an interleaver spreads successive bits over different (β„“,k)(\ell, k) positions. The diversity harvested is min⁑(dH, P)\min(d_H,\, P) where PP is the number of delay-Doppler resolvable paths β€” typically much larger than the OFDM LL at high mobility, because each physical path contributes a SEPARATE grid point rather than collapsing into the LL delay taps.

Example: OTFS Diversity on a 4G/5G High-Speed Rail Channel

A high-speed rail scenario at 350 km/h, carrier 3.5 GHz, has P=6P = 6 physical multipath components spread across delays Ο„βˆˆ[0,3 μs]\tau \in [0, 3\,\mu\mathrm{s}] and Dopplers βˆ£Ξ½βˆ£β‰€1100 Hz|\nu| \le 1100\,\mathrm{Hz}. Compare the diversity achievable by BICM-OFDM (subcarrier spacing 15 kHz) and BICM-OTFS (delay-Doppler grid 64Γ—864 \times 8) using an outer code with dH=8d_H = 8.

Common Mistake: OTFS Has Higher Receiver Complexity

Mistake:

Assuming OTFS is a "drop-in replacement" for OFDM: "we just swap the OFDM modulator for OTFS and everything else stays the same."

Correction:

OTFS receiver is 2D: symbols are detected on a delay-Doppler grid, and the channel matrix couples them through a 2D convolution. ML detection is exponential in the grid size; message-passing or iterative detectors are required for practical implementations. OTFS memory and processing grow by NgridN_{\rm grid} vs OFDM's NscN_{\rm sc} β€” typically 4-8Γ— more expensive per symbol.

πŸ”§Engineering Note

OTFS in Research and Early Deployment

OTFS was proposed by Hadani and Rakib (2017) and is currently in the research-and-prototype stage:

  • 5G NR: NOT standardised (OFDM with flexible numerology is used instead); OTFS proposed for 6G.
  • 3GPP study items: OTFS discussed for non-terrestrial networks (NTN) and high-speed rail in Rel-17 onward.
  • Prototypes: Cohere Technologies, Qualcomm, and others have demonstrated OTFS at 500+ km/h and in airborne NTN links.
  • Standards path: likely 6G around 2030 for specific mobility use cases (V2X, HSR, NTN).

Key Takeaway

OTFS converts a doubly-selective channel into a sparse, quasi-static 2D channel on the delay-Doppler grid. BICM on the OTFS grid achieves min⁑(dH,P)\min(d_H, P) diversity, where PP is the number of physical multipath components β€” smaller than OFDM's LL but without ICI losses. OTFS wins at high mobility (500+ km/h), where OFDM breaks down.