Prerequisites & Notation

Before You Begin

This chapter turns the sparsity argument of Chapter 4 into practice: how to recover the PP-path DD channel from a received OTFS frame with minimal overhead. The two CommIT pilot designs β€” embedded and superimposed β€” are the central technical output.

  • DD channel model: PP paths, sparse 2D convolution(Review OTFS Ch. 4)

    Self-check: Can you state YDD[β„“,k]=βˆ‘ihi XDD[(β„“βˆ’β„“i)β€Šmodβ€ŠM,(kβˆ’ki)β€Šmodβ€ŠN]+WDD[β„“,k]Y_{DD}[\ell, k] = \sum_i h_i\,X_{DD}[(\ell - \ell_i)\bmod M, (k - k_i)\bmod N] + W_{DD}[\ell, k]?

  • OTFS transceiver chain (ISFFT, Heisenberg, SFFT)(Review OTFS Ch. 6)

    Self-check: Can you identify which block produces the DD-grid estimate X^DD\hat{X}_{DD} at the receiver?

  • LMMSE estimation(Review FSI Ch. 7)

    Self-check: Can you write the LMMSE estimator for a linear Gaussian observation y=Ax+wy = Ax + w?

  • OFDM pilot schemes (DMRS)(Review Telecom Ch. 14)

    Self-check: Do you remember that OFDM uses pilot subcarriers inserted at known positions in the TF grid?

  • Sparse signal recovery basics(Review FSI Ch. 13)

    Self-check: Do you recognize the PP-sparse signal-in-noise problem as the simplest setting of compressed sensing?

Notation for This Chapter

Symbols introduced in this chapter.

SymbolMeaningIntroduced
(β„“p,kp)(\ell_p, k_p)DD-grid location of the embedded pilots01
G\mathcal{G}Guard region surrounding the pilot (no data transmitted here)s01
Ξ±\alphaPilot amplitude: ∣XDD[β„“p,kp]∣=Ξ±|X_{DD}[\ell_p, k_p]| = \alphas01
Ξ³th\gamma_{\text{th}}Threshold used for path detection in the guard regions02
P^\hat{P}Estimated number of paths after threshold detections02
ηpilot\eta_{\text{pilot}}Pilot overhead fraction ∣G∣/(MN)|\mathcal{G}|/(MN)s03
ρp\rho_pPower fraction allocated to the pilot vs datas04
D\mathcal{D}Set of data-carrying DD-grid cellss01