.png){kind=icon}
.png){kind=icon}
Return
A Low-Complexity ML Detection Algorithm for Spatial Modulation Systems With M PSK Constellation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2331283.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Spatial modulation (SM), which is a novel transmission scheme, is employed for active transmit antenna indexes and modulated signals to convey the information. To recover the transmitted information bits, the maximum likelihood (ML) joint detector is often used. However, its complexity linearly grows with the number of transmit antennas and the size of the signal set. A reduced-complexity ML optimal algorithm for SM systems with M-QAM has been proposed. However, for M-PSK modulation, there are not similar low-complexity ML detection algorithms yet to our knowledge. In this paper, a low-complexity ML detection algorithm for SM systems with M-PSK modulation is proposed. By exploiting the features of M-PSK constellation, we give the ML-estimated values of the transmitted symbols. Therefore, the ML search complexity is independent of the constellation size. Simulation results show that the proposed algorithm has the same performance as the ML-optimum detector and significant reduction in computational complexity compared with existing detectors for SM systems with M-PSK modulation.
Keywords:
Spatial modulation (SM)
MPSK modulation
ML decoding
computational complexity
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