返回
Efficient Memory-Bounded Optimal Detection for GSM-MIMO Systems
DOI:10.1109/TCOMM.2022.3176649.png)
摘要
En 中文
We investigate the optimal signal detection problem in large-scale multiple-input multiple-output (MIMO) system with the generalized spatial modulation (GSM) scheme, which can be formulated as a closest lattice point search (CLPS). To identify invalid signals, an efficient pruning strategy is needed while searching on the GSM decision tree. However, the existing algorithms have exponential complexity, whereas they are infeasible in large-scale GSM-MIMO systems. In order to tackle this problem, we propose a memory-efficient pruning strategy by leveraging the combinatorial nature of the GSM signal structure. Thus, the required memory size is squared to the number of transmit antennas. We further propose an efficient memory-bounded maximum likelihood (ML) search (EM-MLS) algorithm by jointly employing the proposed pruning strategy and the memory-bounded best-first algorithm. Theoretical and simulation results show that our proposed algorithm can achieve the optimal bit error rate (BER) performance, while its memory size can be bounded. Moreover, the expected time complexity decreases exponentially with increasing the signal-to-noise ratio (SNR) as well as the system's excess degree of freedom, and it often converges to squared time under practical scenarios.
Keyword:
GSM
MIMO communication
Transmitting antennas
Symbols
Modulation
Maximum likelihood detection
Indexes
Signal detection
MIMO
maximum likelihood detection
generalized spatial modulation
tree search algorithm
sphere decoding
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
A Joint Data Mapping and Detection for High Performance Generalized Spatial Modulation高性能广义空间调制的联合数据映射和检测
A Survey on Spatial Modulation in Emerging Wireless Systems: Research Progresses and Applications新兴无线系统空间调制研究进展与应用综述
Ordering- and Partitioning-Aided Sphere Decoding fur Generalized Spatial Modulation排序和分区辅助球形解码fur广义空间调制

