A Low Complexity Detection Algorithm for Generalized Spatial Modulation System

As an extension of spatial modulation (SM) technology, generalized spatial modulation (GSM) is a promising technique for high data-rates systems. In GSM system, multiple antennas are activated in each time slot, which can greatly enhance the band efficiency. However, the usage of multiple active ant...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Engineering letters 2022-02, Vol.30 (1), p.250
Hauptverfasser: Zhang, Xinhe, Lv, Wenbo, Tan, Haoran
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:As an extension of spatial modulation (SM) technology, generalized spatial modulation (GSM) is a promising technique for high data-rates systems. In GSM system, multiple antennas are activated in each time slot, which can greatly enhance the band efficiency. However, the usage of multiple active antennas for transmission also brings difficulties of the demodulation at the receiver. The computational complexity of the traditional maximum likelihood (ML) detector is closely related to the modulation order. Based on this point, we propose an ordered block hard-limited maximum likelihood (OB-HLML) algorithm for MQAM constellation, which is independent of modulation order. OB-HLML algorithm first sorts the possibility of transmit antenna combinations (TACs), and then detects the possible signal vectors of each ordered TAC by HLML detector. Simulation results show that the proposed OB-HLML algorithm can provide almost the same bit error rate (BER) performance as the ML algorithm with greatly reduced computational complexity.
ISSN:1816-093X
1816-0948