[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
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:2203.01875 (cs)
[Submitted on 3 Mar 2022 (v1), last revised 7 Mar 2022 (this version, v2)]

Title:Low complexity equalization for AFDM in doubly dispersive channels

Authors:Ali Bemani, Nassar Ksairi, Marios Kountouris
View PDF
Abstract:Affine Frequency Division Multiplexing (AFDM), which is based on discrete affine Fourier transform (DAFT), has recently been proposed for reliable communication in high-mobility scenarios. Two low complexity detectors for AFDM are introduced here. Approximating the channel matrix as a band matrix via placing null symbols in the AFDM frame in the DAFT domain, a low complexity MMSE detection is proposed by means of the $\rm{LDL}$ factorization. Furthermore, exploiting the sparsity of the channel matrix, we propose a low complexity iterative decision feedback equalizer (DFE) based on weighted maximal ratio combining (MRC), which extracts and combines the received multipath components of the transmitted symbols in the DAFT domain. Simulation results show that the proposed detectors have similar performance, while weighted MRC-based DFE has lower complexity than band-matrix-approximation LMMSE when the channel impulse response has gaps.
Comments: Accepted in 2022 IEEE International Conference on Acoustics, Speech and Signal Processing, IEEE ICASSP 2022
Subjects: Information Theory (cs.IT); Signal Processing (eess.SP)
Cite as: arXiv:2203.01875 [cs.IT]
  (or arXiv:2203.01875v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2203.01875

Submission history

From: Ali Bemani [view email]
[v1] Thu, 3 Mar 2022 17:32:25 UTC (205 KB)
[v2] Mon, 7 Mar 2022 08:54:18 UTC (205 KB)
Full-text links:

Access Paper:

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

References & Citations

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?)