arrow
Return

Low-Complexity Sparse Compensation MRC Detection Algorithm for OTSM Systems

delete2025-02-01
delete0
PRE
AI
S
Shiya Hao
H
Hua Li
Q
Qianqian Li
J
Jiaqi Feng
戴晓明 (Xiaoming Dai) *
DOI:10.1109/LCOMM.2024.3521045delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Orthogonal time sequency multiplexing (OTSM) has recently attracted significant attention due to its enhanced robustness in doubly selective fading channels. However, the computational complexity of conventional OTSM receivers increases significantly in scenarios with fractional Doppler shifts. In this work, we first analyze the effects of inter-Doppler interference on the performance of OTSM systems. We then propose a sparse compensation maximum ratio combining (SC-MRC) detection algorithm to mitigate computational complexity. Specifically, a channel sparsification procedure is implemented by eliminating amplitude values that fall below a predetermined threshold, thereby substantially reducing the computational complexity associated with matrix multiplication. A low-complexity adaptive compensation scheme is introduced to mitigate the associated performance degradation. Simulation results demonstrate that the proposed SC-MRC algorithm achieves superior performance compared to the conventional MRC algorithm while offering reduced computational complexity.
Keywords:
Symbols
Vectors
Delays
Detection algorithms
Doppler shift
Detectors
Interference
Computational complexity
Time-domain analysis
Standards
OTSM
MRC
sparse compensation

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

No organization information available