Inter-Doppler Interference (IDI)

The IDI Effect on the Input-Output Relation

Section 1 established that a single fractional-Doppler path smears its DD response across multiple bins via the IDI kernel. This section extends the full PP-path input-output relation to account for fractional offsets. The result is a sparse-but-extended channel model: instead of PP path taps, we have PΓ—(2kIDI+1)P \times (2k_{\text{IDI}} + 1) effective taps, where kIDIk_{\text{IDI}} is the number of neighboring Doppler bins with significant leakage.

The point is that the input-output relation remains linear β€” the IDI kernel is a fixed function of (k,Ο΅)(k, \epsilon), so the DD output is still a sparse 2D convolution. The convolution kernel is just richer (multi-tap instead of single-tap per path).

Theorem: DD Input-Output Under Fractional Doppler

For a channel with PP paths where each path ii has integer delay β„“i\ell_i, integer Doppler kik_i, and fractional offset Ο΅i\epsilon_i, the discrete DD input-output relation is YDD[β„“,k]β€…β€Š=β€…β€Šβˆ‘i=1Pβˆ‘q∈Nihi KIDI(q,Ο΅i) XDD[(β„“βˆ’β„“i)β€Šmodβ€ŠM, (kβˆ’kiβˆ’q)β€Šmodβ€ŠN]β€…β€Š+β€…β€ŠWDD[β„“,k],Y_{DD}[\ell, k] \;=\; \sum_{i=1}^{P}\sum_{q \in \mathcal{N}_i} h_i\,K_{\text{IDI}}(q, \epsilon_i)\,X_{DD}[(\ell-\ell_i)\bmod M,\,(k-k_i-q)\bmod N] \;+\; W_{DD}[\ell, k], where Ni={βˆ’kIDI,…,kIDI}\mathcal{N}_i = \{-k_{\text{IDI}}, \ldots, k_{\text{IDI}}\} is the effective IDI support per path, typically kIDI=2k_{\text{IDI}} = 2 for ϡ≀0.5\epsilon \leq 0.5.

The equivalent extended channel matrix HDDext\mathbf{H}_{DD}^{\text{ext}} is sparse with Pβ‹…(2kIDI+1)P \cdot (2 k_{\text{IDI}} + 1) taps per row β€” a modest expansion from the integer-case PP taps.

Each physical path contributes not a single DD-convolution tap but a small cluster of taps (the IDI kernel). The total number of taps is Pβ‹…(2kIDI+1)P \cdot (2 k_{\text{IDI}} + 1); for P=10P = 10 and kIDI=2k_{\text{IDI}} = 2, this is 50 taps β€” still far less than the dense MNMN taps of OFDM. OTFS sparsity is preserved, just at a larger effective PP.

,

Key Takeaway

Fractional Doppler widens the channel, not its density class. The OTFS channel under fractional offsets has P(2kIDI+1)P(2k_{\text{IDI}} + 1) effective taps, typically 5P∼505P \sim 50. Still far sparser than OFDM's MN∼104MN \sim 10^4 dense matrix. The detectors of Chapter 8 (MP, LCD) remain applicable; they just operate on a slightly richer sparse factor graph.

IDI Power vs Fractional Offset Ο΅\epsilon

Plot the IDI power fraction β€” energy leaked to neighboring Doppler bins β€” as a function of ϡ∈[0,0.5]\epsilon \in [0, 0.5]. At Ο΅=0\epsilon = 0: zero leakage (integer case). At Ο΅=0.5\epsilon = 0.5: worst case, ~60% of energy in the main lobe, 40% leaked to neighbors. Quantifies when fractional effects matter.

Parameters
32
3

Theorem: Extended Channel Matrix Structure

The extended channel matrix HDDext∈CMNΓ—MN\mathbf{H}_{DD}^{\text{ext}} \in \mathbb{C}^{MN \times MN} can be written as HDDextβ€…β€Š=β€…β€Šβˆ‘i=1Pβˆ‘q=βˆ’kIDIkIDIhi KIDI(q,Ο΅i) Ψℓi,ki+q,\mathbf{H}_{DD}^{\text{ext}} \;=\; \sum_{i=1}^{P}\sum_{q=-k_{\text{IDI}}}^{k_{\text{IDI}}} h_i\,K_{\text{IDI}}(q, \epsilon_i)\,\boldsymbol{\Psi}_{\ell_i, k_i + q}, where Ξ¨β„“,k\boldsymbol{\Psi}_{\ell, k} is a sparse shift-phase matrix (one non-zero per row), so the total matrix has at most P(2kIDI+1)β‹…MNP(2k_{\text{IDI}} + 1) \cdot MN non-zeros. Like the integer-case matrix, HDDext\mathbf{H}_{DD}^{\text{ext}} is block-circulant with circulant blocks (with fractional-shifted eigenvalues).

The extended matrix has the same block-circulant structure as the integer case but with more non-zero entries per row. The 2D DFT still diagonalizes it (providing efficient MMSE and LCD), and message passing still works (factor-graph degree bounded by (2kIDI+1)P(2k_{\text{IDI}}+1)P).

Example: SNR Degradation From IDI

An OTFS system with N=32N = 32 Doppler bins receives a single path with Ο΅=0.4\epsilon = 0.4. Using a detector that assumes integer Doppler (no IDI handling), compute the effective SNR loss.

Extended DD Channel Matrix Sparsity Pattern

Extended DD Channel Matrix Sparsity Pattern
Sparsity pattern of the DD channel matrix under integer-Doppler (left) and fractional-Doppler (right) assumptions, for P=4P = 4 paths on an (M,N)=(16,8)(M, N) = (16, 8) grid. Integer case: Pβ‹…MN=512P \cdot MN = 512 nonzeros, density 1.6%1.6\%. Fractional case (kIDI=2k_{\text{IDI}} = 2): 5Pβ‹…MN=25605P \cdot MN = 2560 nonzeros, density 7.8%7.8\%. Still far sparser than OFDM's dense MNΓ—MNMN \times MN structure under high Doppler.

Fractional-Aware MMSE via Extended Matrix

Complexity: O(MNlog⁑(MN))O(MN\log(MN))
Input: Received yDD\mathbf{y}_{DD}, path parameters {(hi,β„“i,ki,Ο΅i)}i=1P\{(h_i, \ell_i, k_i, \epsilon_i)\}_{i=1}^P,
IDI support kIDIk_{\text{IDI}}, noise variance Οƒ2\sigma^2
Output: MMSE estimate X^DD\hat{X}_{DD}
1. Compute extended eigenvalues:
Ξ»[n,m]=βˆ‘i=1Pβˆ‘q=βˆ’kIDIkIDIhi KIDI(q,Ο΅i) ej2Ο€(ki+q)n/N eβˆ’j2Ο€β„“im/M\lambda[n, m] = \sum_{i=1}^P \sum_{q=-k_{\text{IDI}}}^{k_{\text{IDI}}} h_i\,K_{\text{IDI}}(q, \epsilon_i)\,e^{j 2\pi(k_i + q)n/N}\,e^{-j 2\pi \ell_i m/M}.
2. 2D FFT of received grid: y~=FyDD\tilde{\mathbf{y}} = \mathbf{F}\mathbf{y}_{DD}.
3. Element-wise Wiener:
x~[n,m]=Ξ»βˆ—[n,m] y~[n,m]/(∣λ[n,m]∣2+Οƒ2)\tilde{x}[n, m] = \lambda^*[n, m]\,\tilde{y}[n, m]/(|\lambda[n, m]|^2 + \sigma^2).
4. Inverse 2D FFT: X^DD=FHx~\hat{X}_{DD} = \mathbf{F}^H\tilde{\mathbf{x}}.
5. Quantize to QAM alphabet.
6. Return X^DD\hat{X}_{DD}.

The algorithm is structurally identical to integer-Doppler MMSE (Algorithm ADD-Domain MMSE Detection via 2D FFT) β€” only the eigenvalues Ξ»[n,m]\lambda[n, m] change. Fractional offsets affect only the pre-computed eigenvalue sum, not the runtime path. Total complexity: same O(MNlog⁑(MN))O(MN\log(MN)) as integer case.

Why This Matters: Message Passing With Fractional Doppler

The MP-OTFS algorithm of Chapter 8 extends to fractional Doppler with modest modifications: each factor node now has (2kIDI+1)β‹…P(2k_{\text{IDI}}+1)\cdot P incident variables (instead of PP). Messages still propagate; BP still converges in O(log⁑(MN))O(\log(MN)) iterations. Complexity goes up from O(Pβ‹…MN)O(P \cdot MN) to O((2kIDI+1)Pβ‹…MN)O((2k_{\text{IDI}}+1) P \cdot MN) β€” a constant factor (∼5\sim 5) for typical kIDI=2k_{\text{IDI}} = 2. Practical impact: 5Γ— more compute but same algorithmic framework.