.png){kind=icon}
返回
Further Complexity Reduction for Antenna Selection in Spatial Modulation Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2015.2417884.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, the transmit antenna selection in the spatial modulation system is studied. First, the computational complexity of the transmit antenna selection algorithm previously proposed elsewhere is reduced through an alternative computation of the singular value. Second, theminimum distance ascent (MDA) search is proposed to reduce the search complexity, where the initial antenna subset is acquired through the greedy incremental algorithm. Simulation results show that, compared with the exhaustive search, the proposed MDA search reduces the search complexity enormously with only slight performance loss.
Keyword:
Spatial modulation
antenna selection
greedy algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Spatial Modulation for Generalized MIMO: Challenges, Opportunities, and Implementation.png)
PROCEEDINGS OF THE IEEE
OAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAI分享收藏
查看更多内容