References & Further Reading

References

1. P. Raviteja, K. T. Phan, Y. Hong, E. Viterbo, Interference Cancellation and Iterative Detection for Orthogonal Time Frequency Space Modulation, 2018

   The foundational OTFS detection paper. Develops the discrete DD channel matrix, linear MMSE, and message-passing detector. §VI is the core reference for MP-OTFS.

2. T. Thaj and E. Viterbo, Low-Complexity Linear Diversity-Combining Detector for OTFS Modulation, 2020

   Develops the LCD detector we follow in §4. Demonstrates near-ML BER at LMMSE-like complexity.

3. W. Yuan, Z. Wei, Y. Liu, R. Schober, S. Li, L. Hanzo, Orthogonal Time Frequency Space Modulation — Part II: Receiver Design, 2023

   Part II of the Yuan-Schober tutorial series. §IV covers iterative detection-decoding in the OTFS context.

4. G. D. Surabhi, R. Madhava Augustine, A. Chockalingam, On the Diversity of Uncoded OTFS Modulation in Doubly-Dispersive Channels, 2019

   Establishes the diversity-order result for OTFS detection. Used in §4 and Chapter 9.

5. S. ten Brink, Convergence behavior of iteratively decoded parallel concatenated codes, 1999

   The classical EXIT chart analysis. Basis for the IDD convergence theorem in §5.

6. E. Agrell, T. Eriksson, A. Vardy, K. Zeger, Closest Point Search in Lattices, 2002

   The authoritative sphere-decoding reference. Establishes the average-case complexity claims referenced in §1.

7. S. Li, W. Yuan, Z. Wei, J. Yuan, Cross-Domain Iterative Detection for OTFS Modulation, 2023

   Develops the cross-domain fusion framework of §5, combining TF- and DD-domain detectors.

8. R. Hadani, S. Rakib, M. Tsatsanis, A. Monk, A. J. Goldsmith, A. F. Molisch, R. Calderbank, Orthogonal Time Frequency Space Modulation, 2017

   The OTFS modulation framework. Receiver perspective is §V.

9. M. Mohammadi, H. Q. Ngo, M. Matthaiou, G. Caire, Cell-Free Massive MIMO with OTFS Modulation, 2023

   CommIT contribution referenced in §5. Extends MP-OTFS to cell-free networks with distributed message passing.

10. F. R. Kschischang, B. J. Frey, H.-A. Loeliger, Factor Graphs and the Sum-Product Algorithm, 2001

    The foundational reference for factor-graph message passing. Used for the DD factor graph derivation in §3.

11. M. K. Ramachandran, A. Chockalingam, MIMO-OTFS in High-Doppler Fading Channels: Signal Detection and Channel Estimation, 2018

    Extends the OTFS detector framework to MIMO. Relevant to Chapter 16.

12. L. Chu, W. Yuan, S. Li, J. Yuan, Approximate Message Passing for OTFS, 2022

    AMP framework for OTFS. State evolution analysis matches the Raviteja-Viterbo simulation results.

Further Reading

• Belief propagation in structured graphs

  Kschischang, Frey, Loeliger, 'Factor Graphs and the Sum-Product Algorithm' (IEEE TIT 2001)

  The mathematical foundation of the MP-OTFS detector. Clean exposition of message-passing on factor graphs.

• Approximate message passing (AMP)

  Donoho, Maleki, Montanari, 'Message-Passing Algorithms for Compressed Sensing' (PNAS 2009)

  AMP is the asymptotic version of MP for dense matrices. Useful context for understanding MP-OTFS's theoretical framework.

• Iterative detection and decoding

  Wymeersch, *Iterative Receiver Design* (Cambridge Univ. Press 2007)

  Comprehensive treatment of IDD schemes. Specializes to OTFS IDD in the final chapters.

• OTFS detector complexity analysis

  Yuan, Schober, Caire, 'OTFS — Part II: Receiver Design' (IEEE Comm. Mag. 2023)

  Practical analysis of detection complexity and implementation trade-offs, aligned with the landscape of §4.

• Cross-domain detection and sensing

  Li, Yuan, Wei, 'Cross-Domain Iterative Detection' (IEEE TCOM 2023)

  Deeper coverage of cross-domain fusion, a research-level topic for dense channels.