Exercises
ex-otfs-ch06-01
EasyFor , compute where , zeros elsewhere.
ISFFT formula: .
With having two non-zeros, the sum has two terms.
Evaluate
.
Compute
. . . . So the ISFFT of this diagonal DD pattern is a diagonal TF pattern.
ex-otfs-ch06-02
EasyFor and rectangular pulse of width , compute for when for and zero elsewhere. Recognize the familiar result.
Heisenberg transform formula.
Sum of subcarrier tones over the first OFDM symbol.
Substitute
for .
Recognize
is the Dirichlet kernel of order 4 at . It peaks at (periodic).
Interpret
A 4-subcarrier OFDM symbol with all unit data is a time-compressed pulse at the start of each symbol interval β the classical "OFDM high PAPR symbol." OTFS has the same behavior.
ex-otfs-ch06-03
MediumShow that the ISFFT of the all-ones DD grid ( for all ) is a single TF-grid impulse at . What does this say about how an all-DC input transmits through the OTFS chain?
ISFFT of a constant signal should concentrate at DC.
Orthogonality of phases over a full period.
Apply ISFFT
.
Orthogonality sums
. .
Result
. A single non-zero TF cell β the DC component on the first OFDM symbol.
Through the channel
Through the Heisenberg transform, this produces a DC tone for one symbol duration. The channel shifts this DC content by the path Dopplers. The receiver recovers a single-tone structure, SFFT of which is the all-ones DD grid again. A perfectly symmetric example.
ex-otfs-ch06-04
MediumThe ISFFT-OFDM-Wigner-SFFT composition forms the OTFS transceiver. Show that this composition is the identity map on under the idealizing assumptions of the chapter.
ISFFT SFFT = Id, and Wigner Heisenberg = Id.
Composition
.
Middle: Heis + Wig
By Theorem THeisenberg-Wigner Roundtrip, . So .
End: SFFT
by Theorem TSFFT and ISFFT Are Inverses.
Conclude
. Under ideal pulses, no channel, and no noise, the OTFS transceiver is exact.
ex-otfs-ch06-05
MediumFor a rectangular prototype pulse, show that the Heisenberg transform reduces exactly to the standard OFDM IFFT + CP. Verify by writing out both operations side-by-side.
Heisenberg formula with rectangular .
OFDM IFFT formula.
Heisenberg with rectangular pulse
For : .
Sample at $t = n T_s + \ell \Delta t$
With (Nyquist): . This is exactly the -point inverse DFT of the -th column of (up to normalization).
CP prepending
The CP is added by copying the last samples of this IDFT output to the front β the standard OFDM practice.
Match
Heisenberg transform with rectangular pulse = OFDM IFFT + CP. This is the content of "OTFS is precoded OFDM."
ex-otfs-ch06-06
MediumCompute the PAPR of an OTFS frame with i.i.d. QPSK data on the DD grid, for . Compare with OFDM on the same grid.
OTFS transmit signal is a sum of complex-phase-shifted pulses.
Gaussian approximation via CLT gives PAPR .
Signal model
OTFS waveform: . With i.i.d. QPSK , each sample is a sum of i.i.d. phase-shifted terms.
Gaussian approx
By CLT, is approximately . Absolute value squared is Exponential(1).
PAPR
Peak over one frame of length samples: is the max of Exp(1) variables. (β9 dB).
OFDM comparison
Same calculation. Both OTFS and OFDM with i.i.d. QAM have PAPR dB. No advantage for either. Practical OFDM uses PAPR reduction techniques (clipping, tone reservation); OTFS can use the same techniques.
ex-otfs-ch06-07
MediumShow that the OTFS Heisenberg transform can be computed by independent -point IFFTs followed by CP prepending, for a total complexity of .
Each OFDM symbol in the Heisenberg sum is independent.
Per-symbol IFFT + CP is standard OFDM.
Structure
. The outer sum over decouples: each is a separate OFDM symbol supported on .
Per-symbol IFFT
Each OFDM symbol is an -point IFFT: per symbol.
Total
such IFFTs: . Add for CP prepending. Total: . With , this is ops per frame β comfortable realtime.
ex-otfs-ch06-08
HardA raised-cosine prototype pulse with roll-off has bounded by from below. Estimate the maximum cross-talk in the DD channel matrix from Theorem TResidual DD Cross-Talk From Non-Bi-Orthogonal Pulses for .
Use the bound from the theorem.
The deviation from identity is roughly .
Bound
From Theorem: . For raised-cosine with roll-off , the Zak-magnitude variation is roughly .
Estimate
Cross-talk , i.e., dB relative to the signal. Moderate. Acceptable for QPSK/16-QAM; marginal for 256-QAM.
Practical choice
(very narrow roll-off) gives cross-talk dB β adequate for most QAM orders. The trade-off is spectral containment: smaller means wider side-lobes in the frequency domain. Typical deployment chooses .
ex-otfs-ch06-09
HardDerive the average transmit power of the OTFS waveform as a function of the data symbol power and the grid size . Show that the power is preserved through the ISFFT and Heisenberg transforms.
Both ISFFT and Heisenberg are unitary.
Parseval's theorem.
DD-grid power
.
TF-grid power (after ISFFT)
Unitarity: .
Waveform power (after Heisenberg)
Unitarity of Heisenberg: . Frame duration: . Average power: . This is the same as OFDM with subcarriers β power is preserved by the precoder.
ex-otfs-ch06-10
MediumThe OTFS receiver can be viewed as an "OFDM receiver with SFFT post-processing." If the TF-domain channel matrix is diagonal (LTI assumption), what does the DD-domain channel matrix look like?
Diagonal TF matrix + SFFT something in DD.
Diagonal in TF = 2D convolution of the diagonal with a kernel.
LTI TF channel
β diagonal in both indices, independent of .
Apply SFFT
.
Factor
The sum separates into a TF-frequency-dependent factor times the contributions. Expanding fully, the DD matrix is a convolution matrix: with the inverse DFT of β the delay-axis taps of the LTI channel.
Interpretation
LTI in TF = delay-only convolution in DD (no Doppler coupling). This is the -path channel of Chapter 4 restricted to for all .
ex-otfs-ch06-11
MediumWrite pseudocode for a complete OTFS receiver that includes CP removal, FFT, SFFT, and MMSE detection. State the complexity per frame.
Follow the algorithm block of Section 4 + add MMSE.
MMSE in DD domain: via 2D FFT.
Pseudocode
function OTFS_receive(r, channel_estimate, noise_var):
# Stage 1: CP removal, segment into N OFDM symbols
symbols = segment(r, N, T_s, L_CP)
# Stage 2: per-symbol FFT (Wigner)
Y_TF = [fft(s, M) for s in symbols]
# Stage 3: SFFT
Y_DD = sfft(Y_TF, M, N) # 2D FFT, unitary
# Stage 4: MMSE detection in DD domain
# H_DD diagonalized: apply diag MMSE
H_freq = sfft_eigenvalues(channel_estimate, M, N)
X_DD_est = (conj(H_freq) * Y_DD) / (abs(H_freq)**2 + noise_var)
X_DD_hat = isfft(X_DD_est, M, N) # return to DD
return demap_qam(X_DD_hat)
Complexity per frame
Stage 1: . Stage 2 (N FFTs): . Stage 3 (SFFT): . Stage 4 (MMSE): for the 2D FFT; for the element-wise diag MMSE. Stage 5 (QAM demap): . Total: .
ex-otfs-ch06-12
HardCompare the block diagram of the OTFS transceiver with that of a DFT-s-OFDM transceiver (5G NR uplink). Identify similarities and the one essential difference.
DFT-s-OFDM: DFT precoder + OFDM mod.
OTFS: ISFFT precoder + OFDM mod.
DFT-s-OFDM
Transmitter: data β DFT (1D, length ) β OFDM mod. Receiver: OFDM demod β IDFT (1D) β detector.
OTFS
Transmitter: data β ISFFT (2D symplectic FFT) β OFDM mod. Receiver: OFDM demod β SFFT (2D) β detector.
Structural parallel
Both are "precoded OFDM": a linear transform of the data before OFDM, reversed at the receiver. The key difference is the dimensionality and sign structure of the precoder:
- DFT-s-OFDM: 1D DFT. Reduces PAPR; Doppler-agnostic.
- OTFS: 2D symplectic DFT. The symplectic sign pattern is what gives the DD-geometric interpretation; 2D is what enables the DD-grid packaging.
Essential difference
ISFFT is symplectic (mixed signs on the two axes); ordinary 2D DFT is not. The symplectic structure is what makes the DD-plane translations (channel action) correspond to TF modulations with the right signs. Without it, the 2D precoding does not give a DD-convolution channel. This is why DFT-s-OFDM does not solve mobility: it's not 2D, and it's not symplectic.
ex-otfs-ch06-13
HardDerive the power spectral density of the OTFS transmit signal as a function of the pulse shape and the data statistics. Identify how the pulse shape controls out-of-band emissions.
Assume i.i.d. QAM data.
The PSD is proportional to times a flat envelope.
Transmit signal
.
Mean PSD
For i.i.d. zero-mean QAM with unit power: after Fourier transform (roughly).
PSD
. The sum of shifted pulse spectra gives the full-bandwidth spectrum.
Out-of-band emissions
Determined by 's side lobes. Rectangular pulse: sinc-squared side lobes, slow roll-off. RRC pulse: very tight spectral containment, fast roll-off. Regulators require specific OOB emission masks; OTFS inherits the same pulse-shape considerations as OFDM.
ex-otfs-ch06-14
MediumIn the two-stage Hadani-Rakib construction, is the order "ISFFT then OFDM" the same as "OFDM then SFFT" in terms of the transmit waveform? Explain.
OFDM modulates a TF grid; SFFT maps TF to DD.
Two orders: data β ISFFT β TF β OFDM mod β waveform, vs data β OFDM mod β ?
First order
Data β ISFFT β β OFDM mod β . This is OTFS.
Second order
Data β OFDM mod (?!) β waveform. But OFDM mod expects a TF-grid input, not a DD grid; the signature would be wrong.
Resolution
The orders are not equivalent. The ISFFT converts a DD grid to a TF grid; only then can OFDM consume it. Applying OFDM directly to DD-grid data would treat the DD indices as if they were TF indices β a category error.
Lesson
OTFS's ISFFT is the semantic bridge: DD-grid data β TF-grid signal. Without it, the DD structure is lost. The order "precode-first, modulate-second" is essential.
ex-otfs-ch06-15
Challenge(Research-level.) The Zak-OTFS alternative computes the transmit waveform directly as an inverse discrete Zak transform of the DD grid. Show that under rectangular pulses, Zak-OTFS and Hadani-Rakib OTFS produce identical waveforms. Identify one scenario where they differ.
Inverse discrete Zak = reshape + length- IFFT.
Under rectangular + critical lattice, the two formulations coincide.
Zak-OTFS formula
Time signal: where (within-block) and (block index). Equivalently, time signal is the inverse discrete Zak transform.
Hadani-Rakib formula
Time signal: ISFFT of then IDFT over axis per block. Compose: time sample .
Equivalence
Expanding both and comparing exponents (critical lattice, rectangular pulse) reveals the same time-sample formula. Numerical verification: the two produce bit-identical output under these assumptions.
Divergence
Under non-rectangular pulses or non-critical lattices, the two formulations diverge. Zak-OTFS keeps the DD-plane interpretation cleanly; Hadani-Rakib may acquire residual cross-talk. For research purposes, Zak-OTFS is the preferred formulation (see Mohammed et al., 2022).