Time-Invariance of the DD Channel
Why Time-Invariance Matters
The physical channel is manifestly time-varying — reflectors move, paths come and go within a single OTFS frame. Yet the DD channel matrix has no time argument. The channel, viewed through the DD lens, is effectively time-invariant over the frame duration.
This is not a coincidence of notation. It is a structural property with direct engineering consequences: one channel estimate suffices for the whole frame (Chapter 7); one detector configuration works for all DD cells (Chapter 8); diversity order is determined by the path count, not by the fading realization over time (Chapter 9). In this section we make the time-invariance claim precise and compare it rigorously to the OFDM case.
Definition: DD Time-Invariance
DD Time-Invariance
A channel is said to be DD time-invariant over a frame of duration if the input-output relation in the DD domain has the form where is a fixed (not time-dependent) 2D kernel that can be identified from any portion of the frame.
By contrast, the TF channel of Bello's framework (Chapter 1) has an explicit argument and is therefore TF time-varying. Time-invariance is a property of a representation, not of the physical channel.
Theorem: The Physical Multipath Channel Is DD Time-Invariant
A physical multipath channel with constant over an observation window of duration is DD time-invariant with kernel .
In particular, for any two disjoint subframes and within the frame, the DD channel kernels estimated from each subframe are identical (in the absence of noise).
The Zak transform converts the time-domain delay-and-Doppler-shift operator into a pure translation on the DD plane. Multiple paths sum to a linear combination of translations, which is a 2D convolution with a fixed kernel. Since the kernel does not carry a argument, the channel is DD time-invariant.
This is the DD analog of what the LTI assumption buys for FIR filters: a fixed impulse response characterizes the entire system's action on any input. Here the "impulse response" is 2D.
Channel parameters constant over the frame
By hypothesis, do not vary over . This is the block-fading assumption — reasonable when the path geometry changes slowly compared to the frame duration. For realistic OTFS frames ( ms) and physical reflector velocities ( km/h), it is an excellent approximation.
Zak transform of the output
From Theorem TContinuous DD Input-Output Relation, . The coefficients , shifts are constants of the subframe — the expression has no explicit .
Sub-frame comparison
If the frame is split into two subframes and each is analyzed by computing its Zak transform, both analyses produce the same kernel (plus independent noise). This is what "DD time-invariant" means operationally — the channel estimate is the same regardless of which subframe yields it.
Contrast with TF
In the TF domain, at time and are related by per path — different snapshots of a time-varying transfer function. No fixed 1D kernel suffices. Only the full 2D kernel is invariant.
Key Takeaway
One DD channel for the whole frame. Under the block-fading assumption (stable path geometry over ms), the DD kernel is constant. A pilot that identifies at the start of the frame yields a valid channel estimate for the entire frame — no tracking, no per-symbol updates. This is the structural reason OTFS is robust to mobility: mobility makes the channel's TF representation change rapidly, but does not change the DD kernel itself within the frame. Only path geometry evolution (over tens of ms at typical velocities) changes .
A Moving Reflector: TF Changes, DD Stays Put
When Block-Fading Fails
The DD time-invariance claim requires constant path geometry over the frame. This fails for:
- Very long frames (): the reflectors move enough within the frame to change or appreciably.
- Accelerating vehicles: drifts if is not constant. A vehicle accelerating at over a 10 ms frame changes velocity by 0.1 m/s — negligible. A hypersonic missile at 100 m/s² changes velocity by 1 m/s, producing a Doppler drift of Hz at 10 GHz — non-negligible.
- LEO satellites with fast arc traversal: the angle to the UE can sweep several degrees per second, producing a that is quasi-linearly varying over a 10 ms frame.
For these regimes, basis expansion models (BEMs) represent the paths as slow time-varying with known trajectories. See Chapter 10 and Chapter 18. The block-fading assumption used in this chapter remains a useful first-order model for most terrestrial mobility.
TF Matrix Drifts; DD Matrix Stays Sparse
For a three-path channel over an OTFS frame of duration , plot the magnitude of the TF transfer function (as a function of time across the frame) and the DD spreading function (static). A time slider lets you scrub through the frame: notice that visibly changes along the slider, while is fixed.
Parameters
Example: Block-Fading Validity at Urban Vehicular Scales
A vehicle at km/h experiences reflectors at delays . The OTFS frame duration is ms at carrier GHz. Verify that (a) the delay change over the frame is negligible, (b) the Doppler change due to possible angle change is negligible.
Delay change
Position change over the frame: m. Delay change: s = 0.46 ns. Delay resolution at MHz: ns. Ratio: . Delay is effectively constant.
Doppler change
Assume the angle to a reflector changes by at most 1° over the frame (a strict upper bound for a 140-m displacement relative to a 100-m-away reflector). Doppler change: Hz. Doppler resolution: Hz. Ratio: — small but non-negligible; flat block-fading is a reasonable but not perfect approximation.
Conclusion
For urban vehicular mobility with ms, block-fading is accurate to within a few percent of the DD grid resolution. Longer frames (or higher mobility / carrier) require the basis-expansion refinement of Chapter 10.
Crystal Symmetry of the DD-Domain Channel
Mohammed–Hadani–Chockalingam–Caire (2022) framed the DD time-invariance property in a language borrowed from solid-state physics: the DD channel admits a "crystalline" structure in which the spreading function plays the role of a unit cell, tiled across the torus by the quasi-periodic extension. The analogy is precise — the Zak transform, after all, originated as a tool for Bloch-type periodicity in crystals.
The CommIT contribution here is threefold: (i) formalizing the DD channel as a convolution on the fundamental domain of a discrete symmetry group (the Heisenberg–Weyl lattice), (ii) clarifying when block-fading holds at the level of the crystalline symmetry, and (iii) providing a single unifying framework for both the communication and radar-sensing aspects of OTFS — a conceptual bridge exploited in Chapter 12 of this book (OTFS-ISAC).
Why This Matters: Link to Information Theory
The DD time-invariance we establish here is the structural reason the capacity analysis of Chapter 9 works. In the ITA book, Chapter 13 derived the ergodic capacity of a fading channel by averaging over random channel realizations. For OTFS the analysis is per-realization — the channel is fixed over the frame, so within the frame we have a deterministic linear channel with known (or estimated) kernel. The full diversity and capacity results of Chapter 9 follow from this fixed-kernel structure.
Common Mistake: DD Time-Invariance Physical Time-Invariance
Mistake:
Concluding that "OTFS eliminates the time-variation of the channel." It does not. The physical channel is still time-varying — paths still have Doppler shifts, reflectors still move. OTFS just represents the channel in a domain (DD) where the time-variation collapses into a fixed 2D kernel.
Correction:
The right statement is: the channel's effect on data symbols is, in the DD domain, a fixed 2D convolution. The Doppler shifts haven't disappeared — they are encoded in the kernel's Doppler axis. What OTFS buys is a representation in which the same equalization or detection works for all DD cells, rather than a TF representation where each cell experiences a different time-varying gain.