Abstract
The Orthogonal Time Frequency Space (OTFS) modulation has been identified as a promising modulation scheme for wireless communications with high mobility. As for data detection of OTFS symbols, most existing detectors rely on the sophisticated message passing (MP) algorithm and its variants. In particular, the classic sum-product (SP)-MP algorithm can achieve a good detection performance with high complexity, while the Gaussian approximation-based (GA)-MP detector reduces the complexity significantly at the cost of performance degradation. In order to achieve a more flexible detection framework, we propose to adopt the Gaussian mixture distribution (GMD) for representing messages on the factor graph. The proposed scheme can behave as either the classic SP-MP algorithm or the GA-MP algorithm by varying the number of adopted Gaussian components. The simulation results show the proposed scheme can strike a good tradeoff between the error performance and complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 178-182 |
| Number of pages | 5 |
| Journal | IEEE Communications Letters |
| Volume | 28 |
| Issue number | 1 |
| Early online date | 25 Sept 2023 |
| DOIs | |
| Publication status | Published - Jan 2024 |
| Externally published | Yes |
Bibliographical note
The associate editor coordinating the review of this letter and approving it for publication was L. Dai.Funding
This work is supported in part by National Natural Science Foundation of China under Grant 62101232, in part by Guangdong Provincial Natural Science Foundation under Grant 2022A1515011257, and in part by Shenzhen Science and Technology Program under Grant JCYJ20220530114412029.
Keywords
- detector
- Gaussian mixture distribution
- message passing
- Orthogonal time frequency space (OTFS)