Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2109.10232 (cs)
[Submitted on 21 Sep 2021]

Title:A Low Complexity MAP Detector for OTFS Modulation in Logarithmic Domain

Authors:Haoyan Liu, Yanming Liu, Min Yang
View PDF
Abstract:Orthogonal time-frequency space (OTFS) has been confirmed to take advantage of full time-frequency diversity to significantly improve error performance in high-mobility scenarios. We found that the proposed message passing (MP) and variational Bayes (VB) detectors can achieve approximate maximum a posteriori (MAP) detection, the interferences cannot be completely eliminated in the absence of noise. To achieve near-optimal MAP detection, this letter proposes a novel detection method based on sum-product algorithm (SPA) with low complexity. Leveraging subtly factorized posteriori probabilities, the obtained pairwise interactions can effectively avoid enumeration of high-dimensional variables, thereby making it applicable to fractional Doppler cases. We further simplify the proposed algorithm in the logarithmic domain so that the message propagation processing only involves addition. Finally, simulations results demonstrate the superior error performance gains of our proposed algorithm at high signal-to-noise ratios (SNRs).
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2109.10232 [cs.IT]
  (or arXiv:2109.10232v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2109.10232

Submission history

From: Haoyan Liu [view email]
[v1] Tue, 21 Sep 2021 14:58:23 UTC (2,187 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2021-09
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Haoyan Liu
Yanming Liu
Min Yang
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)