.png){kind=icon}
.png){kind=icon}
Return
Efficient Compressive Sensing Detectors for Generalized Spatial Modulation Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2016.2558205.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Generalized spatial modulation (GSM) is a novel multiple-input-multiple-output (MIMO) technique, which relies on a sparse use of radio-frequency (RF) front ends at the transmitter. In this paper, low-complexity and compressive-sensing (CS)-based detectors for GSM systems are proposed. First, an extension of the normalized CS detector (E-NCS) based on the orthogonal matching pursuit (OMP) algorithm is proposed, which is shown to be suitable for large-scale GSM implementations, due to its low complexity. Furthermore, to mitigate the error floor effect of the E-NCS detector, two efficient CS (ECS) detectors based on the OMP algorithm are designed with the aid of a preset threshold. Specifically, different searching algorithms are designed, whose objective is to balance computational complexity and system performance. An upper bound for the average bit error probability (ABEP) of the first ECS detector is derived and used to optimize the preset threshold. Simulation results show that the proposed ECS detectors are capable of achieving a considerable reduction in computational complexity, compared with other near-optimal algorithms, with a negligible performance loss.
Keywords:
Compressive sensing (CS)
generalized spatial modulation (GSM)
sparse radio-frequency (RF) front-end implementations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W