.png){kind=icon}
返回
Improved Low-Complexity Sphere Decoding for Generalized Spatial Modulation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2818706.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Complexity
generalized spatial modulation (GSM)
sphere decoding (SD)
path search sphere decoding (P-SD)
tree search sphere decoding (T-SD)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
Reduced-Complexity ML Detection and Capacity-Optimized Training for Spatial Modulation Systems空间调制系统的低复杂度ML检测和容量优化训练
OAAI
OAAI分享收藏分享收藏
查看更多内容