.png){kind=icon}
Return
Improved Low-Complexity Sphere Decoding for Generalized Spatial Modulation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2818706.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, two kinds of improved sphere decoding (SD) algorithms for generalized spatial modulation (GSM), termed the tree search SD (T-SD) and the path search SD (P-SD), are proposed to provide greater complexity reduction compared with the conventional SD algorithms by merging the repeating elements of the vectors. Simulation results show that the proposed T-SD and P-SD can reduce the complexity dramatically while maintaining the optimum bit-error-ratio performance, especially for high spectral efficiency GSM. Furthermore, P-SD breaks the limitation on the number of transmit antennas and receive antennas.
Keywords:
Complexity
generalized spatial modulation (GSM)
sphere decoding (SD)
path search sphere decoding (P-SD)
tree search sphere decoding (T-SD)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more