Pith. sign in

REVIEW 2 major objections 5 minor 41 references

Inter-frame Channel Prediction for Zak-OTFS

T0 review · 2 major / 5 minor · reviewed 2026-07-13 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Zak-OTFS channel filters evolve by deterministic phases across frames, so an ESPRIT-type method can predict them tens of frames ahead from training pilots alone.

desk verdict Clean algebraic solution to inter-frame Zak-OTFS prediction that actually works under its stated assumptions; stationarity is the only real soft spot. read the letter →

arxiv 2607.09184 v1 pith:XYCVMXLC submitted 2026-07-10 eess.SP cs.ITmath.IT

Muhammad Ubadah , Saif Khan Mohammed This is my paper · ORCID
classification eess.SPcs.ITmath.IT
keywords Zak-OTFSdelay-Dopplerchannelinter-framepredictionESPRITpilotoverheadhigh-mobilitychannelsspectralefficiency
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Zak-OTFS already lets a receiver recover every carrier response inside one frame from a single pilot. This paper shows the same predictability extends across frames. The effective delay-Doppler filter of any later frame is exactly the filter of a reference frame multiplied, path by path, by two unit-modulus phases that advance linearly with frame index in time and in frequency. Because consecutive filter matrices therefore share a rotationally invariant subspace, a short ESPRIT-style procedure recovers those phases and the underlying path signatures from a few training frames that still carry pilots. The recovered parameters then synthesize the filter for any future or frequency-offset frame, so those frames need no pilots at all. Numerical results on a vehicular channel confirm that the prediction remains accurate more than 100 ms and several hundred megahertz away, raising the spectral efficiency of the predicted frames by roughly 30 percent.

What carries the argument

The deterministic factorization h_{n,m}[k,l] = sum_i alpha_i^n beta_i^m A_i[k,l] together with the rotational invariance of the time- and frequency-phase Vandermonde matrices; these two facts turn inter-frame prediction into a standard ESPRIT eigen-decomposition of stacked training filters.

What would settle it

Measure the normalized mean-squared prediction error on a vehicular channel whose relative velocity produces a 1 kHz Doppler shift every few tens of milliseconds; if the error rises sharply once the physical paths begin to migrate across bins, the stationarity premise is falsified.

Watch

Extended reading notes

Core claim

The effective discrete delay-Doppler channel filter of the (n,m)-th Zak-OTFS frame factors exactly as a sum over paths of alpha_i^n beta_i^m A_i[k,l], where the complex scalars alpha_i and beta_i are deterministic unit-modulus phases fixed by the physical path delay and Doppler. Consequently the column space of successive filter matrices is rotationally invariant, and an ESPRIT-type algorithm recovers the phases and the signatures A_i from Q training frames, after which any later filter is obtained by simple powering.

Load-bearing premise

The physical multipath delays and Dopplers themselves must stay fixed for the whole prediction window; if any path drifts by one delay or Doppler bin the fixed signatures A_i change and the phase-only forecast fails.

Editorial extensions

If this is right

  • Prediction frames need no pilot or guard carriers, so their spectral efficiency rises by the pilot overhead fraction (observed ~30 percent).
  • Downlink precoding can be computed from uplink training alone, eliminating CSI feedback in both TDD and FDD.
  • Pilot power and PAPR are reduced because only a sparse set of training frames carries pilots.
  • Resource allocation and beam management can be planned tens of milliseconds and hundreds of megahertz ahead of the current frame.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same phase-tracking idea may apply to any modulation whose effective channel is a twisted convolution with a slowly varying delay-Doppler kernel.
  • If path birth/death or large angular turns are detected by a sudden rank change in the training matrices, the algorithm can trigger a fresh training epoch automatically.
  • Extending the method to multi-antenna arrays would couple the spatial steering vectors into the same ESPRIT step, potentially yielding joint angle-delay-Doppler prediction.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper shows that inter-frame channel prediction is possible for Zak-OTFS. From the multi-frame I/O relation (Theorems 1–3), the effective DD-domain filter of the (n,m)-th frame factors exactly as h_{n,m}[k,l] = sum_i alpha_i^n beta_i^m A_i[k,l], where the unit-modulus phases alpha_i = exp(j 2 pi nu_i T') and beta_i = exp(-j 2 pi tau_i B') are determined by the physical path delays and Dopplers. Lemmas 1–3 establish that consecutive-frame filter matrices share a rotationally invariant column space. An ESPRIT-type procedure recovers the phases and the DD signature matrix A from Q training frames (past frames in time and frequency) and predicts the filter for future frames via Eq. (72). Monte-Carlo results on the six-path Vehicular-A channel report normalized prediction error of roughly -14 dB at (n,m)=(120,120) under 15 dB pilot SNR, and a 30 percent SE gain for prediction frames that omit pilots.

Significance. If the stationarity assumption holds over the claimed horizon, the result is a concrete, low-complexity alternative to AR or DNN CSI predictors for high-mobility Zak-OTFS. The algebraic factorization is derived from first principles rather than fitted, the ESPRIT step is deterministic, and the complexity is only O(N_t Q^3). The SE gains from pilot-free prediction frames and the potential reduction of FDD CSI feedback are practically relevant. Strengths include clean twisted-convolution derivations, explicit rank conditions, CRLB comparisons, and extensive Vehicular-A Monte-Carlo evidence under the stated assumptions.

major comments (2)
  1. Assumption 1 (Sections V-A and V-D) is load-bearing: the physical spreading function h_phy is required to remain essentially stationary over the entire prediction horizon (tens of ms and hundreds of MHz). Section V-D supplies only order-of-magnitude arguments (c/(v B) and angle-change estimates). No numerical experiment injects continuous path drift (linear acceleration, gradual angle change, or mild birth/death) and measures the resulting NMSPE degradation. Without such a stress test the claimed 60–120 ms / several-hundred-MHz horizon remains unquantified for realistic non-stationary channels.
  2. All numerical results (Figs. 4–10) use a single synthetic six-path Vehicular-A model with fixed relative powers and i.i.d. angles. There is no evaluation on other standardized profiles (e.g., TDL, CDL), measured outdoor traces, or hardware-in-the-loop data. Consequently the reported NMSPE floors and SE gains cannot yet be taken as representative of practical deployment conditions.
minor comments (5)
  1. The abstract and introduction claim prediction “several tens of frames” away; the body (Figs. 5–6) shows usable accuracy out to n=m=120. Align the wording so that the abstract does not understate the demonstrated horizon.
  2. Section V-E: the support-set threshold X = 0.01 E[|h_P|^2]/E[|h_1|^2] is stated for Vehicular-A but never varied. A short sensitivity plot of NMSPE versus X would strengthen the claim that the rule is robust.
  3. Typographical consistency: “ESPIRIT” appears throughout; the conventional acronym is ESPRIT. Also “Vehicular-A” vs “Veh-A” in Table I.
  4. Fig. 3 caption refers to “our work in [31]”; a self-contained description of the pilot/guard layout would improve readability for readers who do not consult the reference.
  5. The complexity claim O(N_t Q^3) is stated after Step 5; a brief breakdown of the dominant SVD and Hungarian steps would help implementers.

Circularity Check

1 steps flagged · score 1.0 of 10

No significant circularity: the inter-frame factorization and ESPRIT recovery are derived from the physical multi-path model and are not forced by construction or by self-citation of the prediction result itself.

  1. self citation load bearing [Section I and Theorem 2 (I/O relation), citing [25]-[27]]
    "Zak-OTFS is known to be more robust to channel delay and Doppler spread when compared to OFDM. This is because, even in doubly-spread channels, the channel response to a Zak-OTFS pulsone can be accurately estimated from the known channel response to another pulsone in the same frame. ... the Zak-OTFS I/O relation is non-selective even in doubly-spread channels"

    The intra-frame predictability and twisted-convolution I/O model are taken from the authors' prior Zak-OTFS papers. Those citations are load-bearing for the system model, but they do not contain or force the inter-frame phase factorization or the ESPRIT prediction procedure; the latter are new derivations. The circularity is therefore minor and non-central.

full rationale

The central claim (Theorem 3) follows by direct expansion of the twisted-convolution I/O relation under the standard physical DD spreading function h_phy = sum h_i delta(tau-tau_i)delta(nu-nu_i). The resulting factorization h_{n,m}[k,l] = sum_i alpha_i^n beta_i^m A_i[k,l] is an algebraic identity, not a fit to the prediction target. Lemmas 1-3 then obtain the Vandermonde structure and rotational invariance of consecutive-frame matrices from that identity under the stated rank and distinctness assumptions; ESPRIT recovers the phases from independent training-frame observations and extrapolates. Self-citations supply only the intra-frame Zak-OTFS I/O model and pulse-shaping definitions; they do not embed or presuppose the inter-frame prediction result. The sole load-bearing limitation is the explicit stationarity assumption on h_phy, which is openly stated rather than circularly hidden. Numerical MSE/CRLB comparisons and SE gains are external checks, not tautologies. Hence the derivation is self-contained against its own inputs.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central claim rests on four domain assumptions about the physical multipath channel (stationarity, resolvability, distinctness, non-integer spacing) plus standard linear-algebra facts used by ESPRIT. No free parameters are fitted to the prediction error itself; design choices such as Q and the energy threshold X are stated explicitly and do not enter the algebraic derivation.

free parameters (2)
  • Q (number of training frames per axis)
    Chosen by the designer (typical value 30); larger Q improves estimation but reduces spectral efficiency of the training set. Not fitted to the final NMSPE curves.
  • X (energy threshold for support set S)
    Set to -40 dB relative to strongest tap, motivated by the Veh-A power ratio; if the true weakest path is weaker, N_t may be under-estimated.
assumptions (4)
  • domain assumption Physical DD spreading function h_phy(tau,nu) is stationary over the prediction horizon (tens of ms / hundreds of MHz).
    Assumption 1, Sections V-A and V-D; required for A_i to be constant.
  • domain assumption Channel paths are distinct and produce fractional delays/Dopplers so that the DD-signature matrix A has full column rank P and N_t >= P.
    Assumptions 2-3, Eqs. (27)-(29).
  • domain assumption No two path delays differ by an integer multiple of 1/B' and no two Dopplers by an integer multiple of 1/T', guaranteeing distinct alpha_i and beta_i.
    Assumption 4, Eq. (30).
  • standard math Standard ESPRIT rotational-invariance algebra (eigenvalues of the shift operator recover the phases).
    Used in Steps 2-3 of the algorithm; classical result of Roy & Kailath 1989.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Inter-frame Channel Prediction for Zak-OTFS." pith.science (2026). https://pith.science/paper/XYCVMXLC

@misc{pith2026260709184,
  author       = {Pith},
  title        = {Pith review of: Inter-frame Channel Prediction for Zak-OTFS},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XYCVMXLC}},
  note         = {Machine review of arXiv:2607.09184}
}
read the original abstract

Zak-Orthogonal Time Frequency Space (OTFS) modulation is known to be robust to Doppler spread in high mobility scenarios when compared to Orthogonal Frequency Division Multiplexing (OFDM). This is due to the fact that the channel response to a Zak-OTFS carrier within a frame can be accurately estimated from the channel response to another carrier within the same frame. However, an important open problem and question is whether inter-frame channel prediction is possible with Zak-OTFS, i.e., is it possible to accurately predict the channel response to a Zak-OTFS carrier in a frame based on knowledge of the channel response to some Zak-OTFS carrier in \emph{another} frame (i.e., not the same frame). In this paper we show that indeed inter-frame channel prediction is possible. We show that the effective DD domain channel filter coefficients vary in a deterministic manner as we move from current to future frames in time and frequency. We also show that the subspace spanned by channel filter coefficients of consecutive frames in time/frequency is invariant to discrete shifts in time and frequency. We exploit the deterministic variation and subspace invariance to propose a novel deterministic ESPIRIT-type method which uses the effective DD domain channel filter taps/coefficients estimated in training frames (i.e., current/past frames in time and frequency having both pilot and data carriers) to predict the effective DD domain channel filter for frames which are several tens of frames in future and several tens of frames away in frequency.

Figures

Figures reproduced from arXiv: 2607.09184 by the authors.

Figure 1
Figure 1. Transceiver signal processing in multi-frame Zak-OTFS. [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Multi-frame Zak-OTFS and inter-frame prediction. [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Zak-OTFS frame in DD domain with single pilot (depicted by a red [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: MSE error of the proposed estimation of the time-phase, frequency [PITH_FULL_IMAGE:figures/full_fig_p010_4.png]
Figure 5
Figure 5. Figure 5: Heatmap of the normalized mean squared prediction error (NMSPE) b [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]
Figure 7
Figure 7. Figure 7: , we plot the NMSPE as a function of increasing Q for a 5 In the current simulations, the number of parameters to be estimated is 2P + NtP = 372, and the number of observations (i.e., DD channel taps estimated from the training frames) is (2Q + 1)Nt = 3660 which is onl…
Figure 8
Figure 8. Figure 8: NMSPE vs νmax (in kHz). Q = 30. Other parameters are same as in [PITH_FULL_IMAGE:figures/full_fig_p012_8.png]
Figure 9
Figure 9. Figure 9: NMSPE vs τmax (in µs). Fixed νmax = 1 kHz. Other parameters are same as in [PITH_FULL_IMAGE:figures/full_fig_p012_9.png]
Figure 10
Figure 10. Figure 10: Effective Spectral Efficiency (bits/s/Hz) vs TPNR (in dB). Fixed [PITH_FULL_IMAGE:figures/full_fig_p012_10.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 1 canonical work pages

  1. [1]

    6G wireless systems: Vision, requirements, challenges, insights, and opportunities,

    H. Tataria, M. Shafi, A. F. Molisch, M. Dohler, H. Sj ¨oland, and F. Tufves- son, “6G wireless systems: Vision, requirements, challenges, insights, and opportunities,”Proceedings of the IEEE, vol. 109, no. 7, pp. 1166-1199, Jul. 2021

    2021

  2. [2]

    On the road to 6G: Visions, requirements, key technologies, and testbeds,

    C. -X. Wang, X. You, X. Gao, X. Zhu, Z. Li, C. Zhang, H. Wang, Y . Huang, Y . Chen, H. Haas, J. S. Thompson, E. G. Larsson, M. Di Renzo, W. Tong, P. Zhu, X. Shen, H. V . Poor, and L. Hanzo, “On the road to 6G: Visions, requirements, key technologies, and testbeds,”IEEE Commun. Surveys & Tuts., vol. 25, no. 2, pp. 905-974, 2023

    2023

  3. [3]

    Framework and overall objectives of the future development of IMT for 2030 and beyond,

    “Framework and overall objectives of the future development of IMT for 2030 and beyond,”Recommendation ITU-R M.2160-0, International Telecommunication Union (ITU) - R, Nov. 2023

  4. [4]

    Q. Wang, Y . Wang, L. Zhou, J. H. Song, Z. Li and J. Wang, ”The O- RAN Evolution Path Toward 6G AI-Native RAN,”IEEE Communications Standards Magazine

  5. [5]

    Abouelmaati, A

    D. Abouelmaati, A. Esfahani, S. Goudarzi and S. Mumtaz, ”Empowering Next-Gen Networks: AI-Driven Autonomy in O-RAN and SON Archi- tectures,”IEEE Access, vol. 13, pp. 186903-186936, 2025

    2025

  6. [6]

    AI-based CSI Prediction for 5G-Advance and 6G Net- works,

    X. Wei et al., “AI-based CSI Prediction for 5G-Advance and 6G Net- works,”2024 IEEE Globecom Workshops (GC Wkshps), Cape Town, South Africa, 2024, pp. 1-6

    2024

  7. [7]

    A Tensor-Structured Approach to Dynamic Channel Prediction for Massive MIMO Systems With Temporal Non-Stationarity,

    H. Hou et al., “A Tensor-Structured Approach to Dynamic Channel Prediction for Massive MIMO Systems With Temporal Non-Stationarity,” IEEE Transactions on Wireless Communications, vol. 25, pp. 6869-6886, 2026

    2026

  8. [8]

    Large Language Model- Driven Channel Prediction in Cell-Free mMIMO Systems,

    B. Chong, H. Lu, D. Niyato and A. Nallanathan, “Large Language Model- Driven Channel Prediction in Cell-Free mMIMO Systems,”IEEE Journal on Selected Areas in Communications, vol. 44, pp. 3412-3426, 2026

    2026

Show all 41 references
  1. [9]

    Mitigating the Impact of Channel Aging in Cell-Free MIMO Systems Using a Channel Predictor Based on Extended Kalman Filter,

    A. R. L. Paiva, W. C. Freitas, R. P. Antonioli, Y . C. B. Silva and G. Fodor, “Mitigating the Impact of Channel Aging in Cell-Free MIMO Systems Using a Channel Predictor Based on Extended Kalman Filter,” IEEE Transactions on Vehicular Technology, vol. 74, no. 6, pp. 8544- 8560...

    2025

  2. [10]

    Z. Chen, X. Gao, W. Liu, D. Yu and G. Yue, ”Channel Prediction for Millimeter-Wave V2V Communication Using Autoregressive Models,” 2021 13th International Symposium on Antennas, Propagation and EM Theory (ISAPE), Zhuhai, China, 2021

    2021

  3. [11]

    Channel Prediction Using Ordinary Differential Equations for MIMO Systems,

    L. Wang, G. Liu, J. Xue and K. -K. Wong, “Channel Prediction Using Ordinary Differential Equations for MIMO Systems,”IEEE Transactions on Vehicular Technology, vol. 72, no. 2, pp. 2111-2119, Feb. 2023

    2023

  4. [12]

    Orthogonal time frequency space modulation,

    R. Hadani et al., “Orthogonal time frequency space modulation,”Proc. IEEE WCNC’2017, pp. 1-6, Mar. 2017

    2017

  5. [13]

    Orthogonal time-frequency space modulation: a promising next- generation waveform,

    Z. Wei, W. Yuan, S. Li, J. Yuan, G. Bharatula, R. Hadani and L. Hanzo, “Orthogonal time-frequency space modulation: a promising next- generation waveform,”IEEE Wireless Commun. Mag., vol. 28, no. 4, pp. 136-144, Aug. 2021

    2021

  6. [14]

    Best readings in orthogonal time frequency space (OTFS) and delay Doppler signal processing,

    W. Yuan et al., “Best readings in orthogonal time frequency space (OTFS) and delay Doppler signal processing,” Jun. 2022. https://www.comsoc.org/publications/best-readings/orthogonal-time- frequency-space-otfs-and-delay-doppler-signal-processing

    2022

  7. [15]

    OTFS - orthogonal time frequency space: a novel modulation meeting 5G high mobility and massive MIMO challenges,

    A. Monk, R. Hadani, M. Tsatsanis, and S. Rakib, “OTFS - orthogonal time frequency space: a novel modulation meeting 5G high mobility and massive MIMO challenges,” arXiv:1608.02993 [cs.IT] 9 Aug. 2016

    2016 arXiv

  8. [16]

    Embedded pilot aided channel estimation for OTFS in delay-Doppler channels,

    P. Raviteja, K. T. Phan, Y . Hong, and E. Viterbo, “Embedded pilot aided channel estimation for OTFS in delay-Doppler channels,”IEEE Trans. Veh. Tech., vol. 68, no. 5, pp. 4906-4917, May 2019

    2019

  9. [17]

    Practical pulse-shaping waveforms for reduced-cyclic-prefix OTFS,

    P. Raviteja, Y . Hong, E. Viterbo, and E. Biglieri, “Practical pulse-shaping waveforms for reduced-cyclic-prefix OTFS,”IEEE Trans. Veh. Tech., vol. 68, no. 1, pp. 957-961, Jan. 2019

    2019

  10. [18]

    Error performance of rectangular pulse- shaped OTFS with practical receivers,

    C. Shen, J. Yuan, and H. Lin, “Error performance of rectangular pulse- shaped OTFS with practical receivers,”IEEE Wireless Commun. Lett., vol. 11, no. 12, pp. 2690-2694, Dec. 2022

    2022

  11. [19]

    Finite translations in solid state physics,

    J. Zak, “Finite translations in solid state physics,”Phy. Rev. Lett., 19, pp. 1385-1387, 1967

    1967

  12. [20]

    The Zak transform: a signal transform for sampled time-continuous signals,

    A. J. E. M. Janssen, “The Zak transform: a signal transform for sampled time-continuous signals,”Philips J. Res., 43, pp. 23-69, 1988

    1988

  13. [21]

    Derivation of OTFS modulation from first princi- ples,

    S. K. Mohammed, “Derivation of OTFS modulation from first princi- ples,”IEEE Trans. Veh. Tech., vol. 70, no. 8, pp. 7619-7636, Aug. 2021

    2021

  14. [22]

    Time-domain to delay-Doppler domain conversion of OTFS signals in very high mobility scenarios,

    S. K. Mohammed, “Time-domain to delay-Doppler domain conversion of OTFS signals in very high mobility scenarios,”IEEE Trans. Veh. Tech., vol. 70, no. 6, pp. 6178-6183, Jun. 2021

    2021

  15. [23]

    ESPRIT-estimation of signal parameters via rotational invariance techniques,

    R. Roy and T. Kailath, “ESPRIT-estimation of signal parameters via rotational invariance techniques,” inIEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 37, no. 7, pp. 984-995, July 1989

    1989

  16. [24]

    Joint channel estimation, equalization, and data detection for OFDM systems in the presence of very high mobility,

    E. Panayirci, H. Senol, and H. V . Poor, “Joint channel estimation, equalization, and data detection for OFDM systems in the presence of very high mobility,”IEEE Trans. Signal Process., vol. 58, no. 8, pp. 4225-4238, Aug. 2010

    2010

  17. [25]

    OTFS Modulation: Theory and Applications,

    S. K. Mohammed, R. Hadani and A. Chockalingam, “OTFS Modulation: Theory and Applications,” IEEE Press and Wiley, Nov. 2024

    2024

  18. [26]

    OTFS – A mathematical foundation for communication and radar sensing in the delay-Doppler domain,

    S. K. Mohammed, R. Hadani, A. Chockalingam, and R. Calderbank, “OTFS – A mathematical foundation for communication and radar sensing in the delay-Doppler domain,”IEEE BITS the Information Theory Magazine, vol. 2, no. 2, pp. 36-55, 1 Nov. 2022

    2022

  19. [27]

    OTFS – Predictability in the delay-Doppler domain and its value to communications and radar sensing,

    S. K. Mohammed, R. Hadani, A. Chockalingam, and R. Calderbank, “OTFS – Predictability in the delay-Doppler domain and its value to communications and radar sensing,”IEEE BITS the Information Theory Magazine, IEEE early access, doi: 10.1109/MBITS.2023.3319595, Sep. 2023

    2023 doi

  20. [28]

    Characterization of Randomly Time-Variant Linear Chan- nels,

    P. A. Bello, “Characterization of Randomly Time-Variant Linear Chan- nels,”IEEE Trans. Comm. Syst., vol. 11, pp. 360-393, 1963

    1963

  21. [29]

    Matrix Computations,

    G. H. Golub and C. F. Van Loan, “Matrix Computations,” 4th Ed. John Hopkins University Press, 2013

    2013

  22. [30]

    Matrix Analysis,

    R. A. Horn and C. R. Johnson, “Matrix Analysis,” 2nd Ed. Cambridge University Press, 2013

    2013

  23. [31]

    Zak-OTFS with Interleaved Pilots to Extend the Region of Predictable Operation,

    J. Jayachandran, I. A. Khan, S. K. Mohammed, R. Hadani, A. Chock- alingam and R. Calderbank, “Zak-OTFS with Interleaved Pilots to Extend the Region of Predictable Operation,”IEEE Transactions on Vehicular Technology, Early access, June 2025. 15

    2025

  24. [32]

    Zak-OTFS for integration of sensing and communi- cation,

    M. Ubadah, S. K. Mohammed, R. Hadani, S. Kons, A. Chockalingam, and R. Calderbank, “Zak-OTFS for integration of sensing and communi- cation,” available online: arXiv:2404.04182v1 [eess.SP] 5 Apr 2024

    2024 arXiv

  25. [33]

    Optimal zak-OTFS receiver and its relation to the radar matched filter,

    S. Gopalam, H. Inaltekin, I. B. Collings and S. V . Hanly, “Optimal zak-OTFS receiver and its relation to the radar matched filter,” TechRxiv preprint, May 2024

    2024

  26. [34]

    Guidelines for evaluation of radio transmission tech- nologies for IMT-2000,

    ITU-R M.1225, “Guidelines for evaluation of radio transmission tech- nologies for IMT-2000,”International Telecommunication Union Radio communication, 1997

    2000

  27. [35]

    Note on the Generalized Inverse of a Matrix Product,

    T. N. E. Greville,“Note on the Generalized Inverse of a Matrix Product,” SIAM Review. 8 (4): 518–521, 1966. Doi:10.1137/1008107

    1966 doi

  28. [36]

    Haykin,Digital Communication Systems, John Wiley & Sons, 2014

    S. Haykin,Digital Communication Systems, John Wiley & Sons, 2014

    2014

  29. [37]

    Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems,

    J. Edmonds and R. M. Karp, “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems,”Journal of the ACM., 19 (2): 248–264, April 1972

    1972

  30. [38]

    Fundamentals of Statistical Signal Processing: V olume I:Estimation Theory,

    S. M. Kay, “Fundamentals of Statistical Signal Processing: V olume I:Estimation Theory,” Pearson, 1993

    1993

  31. [39]

    Performance analysis of the total least squares ESPRIT algorithm,

    B. Ottersten, M. Viberg and T. Kailath, “Performance analysis of the total least squares ESPRIT algorithm,”IEEE Transactions on Signal Processing, vol. 39, no. 5, pp. 1122-1135, May 1991

    1991

  32. [40]

    NR; Physical Channels and Modulation,

    3GPP TS 38.211, “NR; Physical Channels and Modulation,” Release 15, 2018

    2018

  33. [41]

    NR; Multiplexing and Channel Coding,

    3GPP TS 38.212, “NR; Multiplexing and Channel Coding,” Release 15, 2018

    2018

Pith tools

Reviewed July 13, 2026 · model on record in the stance chip above.