A Novel Low-Complexity Dual-Domain Expectation Propagation Detection Aided AFDM for Future Communications
Qin Yi, Ping Yang, Zilong Liu, Zeping Sui, Yue Xiao, and Gang Wu

TL;DR
This paper introduces a low-complexity dual-domain expectation propagation detection framework for AFDM systems, exploiting domain-specific sparsity to reduce computational complexity while maintaining performance.
Contribution
It develops novel EP-based detectors for AFDM that leverage quasi-banded sparsity in time and frequency domains, significantly reducing matrix inversion complexity.
Findings
EP-AF detector achieves near-identical error rate to conventional methods.
EP-T detector offers a good trade-off between performance and complexity.
Proposed methods reduce matrix inversion complexity from cubic to linear.
Abstract
This paper presents a dual-domain low-complexity expectation propagation (EP) detection framework for affine frequency division multiplexing (AFDM) systems. By analyzing the structural properties of the effective channel matrices in both the time and affine frequency (AF) domains, our key observation is the domain-specific quasi-banded sparsity patterns, including AF-domain sparsity under frequency-selective channels and time-domain sparsity under doubly-selective channels. Based on these observations, we develop an AF-domain EP (EP-AF) detector for frequency-selective channels and a time-domain EP (EP-T) detector for doubly-selective channels, respectively. By performing iterative inference in the time domain using the Gaussian approximation, the proposed EP-T detector avoids inverting the dense channel matrix in the AF domain. Furthermore, the proposed EP-AF and EP-T detectors…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
