Precoding aided generalized spatial modulation with an iterative greedy algorithm

Yuwen Cao, Tomoaki Ohtsuki, Xue Qin Jiang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper divides antennas at the transmitter into several transmit antenna groups (TAGs) and extends the generalized spatial modulation (GSM) idea to a new precoding-aided multiple-input multiple-output system, which is referred to as precoding-aided GSM (PGSM) system. To mitigate the influence caused by correlated channels, we consider the interleaved grouping scheme which leads to a minimum antenna correlation within the same TAG. To select the receive antenna subset with low complexity, we propose an iterative greedy (IG) algorithm that contributes to a maximum equivalent channel gain with low-computational complexity. To reduce the complexity of maximum likelihood (ML) detector, a low complexity IG algorithm-based ML (IG-ML) detector is also derived. Simulation results show that the bit error rate (BER) performance gain up to 3.5 dB is obtained by the proposed PGSM with IG-ML detector over the PGSM with an ordered block minimum mean-squared error detector at a given BER of 10-4. It is also shown that the proposed PGSM with the IG-ML detector achieves a similar BER performance in a high signal-to-noise power ratio region compared with that of an ideal precoding for the GSM with an optimal ML detector.

Original languageEnglish
Article number8544100
Pages (from-to)72449-72457
Number of pages9
JournalIEEE Access
Volume6
DOIs
Publication statusPublished - 2018 Jan 1

Fingerprint

Maximum likelihood
Modulation
Detectors
Antennas
Global system for mobile communications
Bit error rate
Transmitters
Computational complexity

Keywords

  • iterative greedy (IG) algorithm
  • maximum likelihood (ML)
  • precoding aided GSM (PGSM)
  • Transmit antenna groups (TAGs)

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

Precoding aided generalized spatial modulation with an iterative greedy algorithm. / Cao, Yuwen; Ohtsuki, Tomoaki; Jiang, Xue Qin.

In: IEEE Access, Vol. 6, 8544100, 01.01.2018, p. 72449-72457.

Research output: Contribution to journalArticle

@article{216ab775979e46049e44595054326f4a,
title = "Precoding aided generalized spatial modulation with an iterative greedy algorithm",
abstract = "This paper divides antennas at the transmitter into several transmit antenna groups (TAGs) and extends the generalized spatial modulation (GSM) idea to a new precoding-aided multiple-input multiple-output system, which is referred to as precoding-aided GSM (PGSM) system. To mitigate the influence caused by correlated channels, we consider the interleaved grouping scheme which leads to a minimum antenna correlation within the same TAG. To select the receive antenna subset with low complexity, we propose an iterative greedy (IG) algorithm that contributes to a maximum equivalent channel gain with low-computational complexity. To reduce the complexity of maximum likelihood (ML) detector, a low complexity IG algorithm-based ML (IG-ML) detector is also derived. Simulation results show that the bit error rate (BER) performance gain up to 3.5 dB is obtained by the proposed PGSM with IG-ML detector over the PGSM with an ordered block minimum mean-squared error detector at a given BER of 10-4. It is also shown that the proposed PGSM with the IG-ML detector achieves a similar BER performance in a high signal-to-noise power ratio region compared with that of an ideal precoding for the GSM with an optimal ML detector.",
keywords = "iterative greedy (IG) algorithm, maximum likelihood (ML), precoding aided GSM (PGSM), Transmit antenna groups (TAGs)",
author = "Yuwen Cao and Tomoaki Ohtsuki and Jiang, {Xue Qin}",
year = "2018",
month = "1",
day = "1",
doi = "10.1109/ACCESS.2018.2880844",
language = "English",
volume = "6",
pages = "72449--72457",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Precoding aided generalized spatial modulation with an iterative greedy algorithm

AU - Cao, Yuwen

AU - Ohtsuki, Tomoaki

AU - Jiang, Xue Qin

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This paper divides antennas at the transmitter into several transmit antenna groups (TAGs) and extends the generalized spatial modulation (GSM) idea to a new precoding-aided multiple-input multiple-output system, which is referred to as precoding-aided GSM (PGSM) system. To mitigate the influence caused by correlated channels, we consider the interleaved grouping scheme which leads to a minimum antenna correlation within the same TAG. To select the receive antenna subset with low complexity, we propose an iterative greedy (IG) algorithm that contributes to a maximum equivalent channel gain with low-computational complexity. To reduce the complexity of maximum likelihood (ML) detector, a low complexity IG algorithm-based ML (IG-ML) detector is also derived. Simulation results show that the bit error rate (BER) performance gain up to 3.5 dB is obtained by the proposed PGSM with IG-ML detector over the PGSM with an ordered block minimum mean-squared error detector at a given BER of 10-4. It is also shown that the proposed PGSM with the IG-ML detector achieves a similar BER performance in a high signal-to-noise power ratio region compared with that of an ideal precoding for the GSM with an optimal ML detector.

AB - This paper divides antennas at the transmitter into several transmit antenna groups (TAGs) and extends the generalized spatial modulation (GSM) idea to a new precoding-aided multiple-input multiple-output system, which is referred to as precoding-aided GSM (PGSM) system. To mitigate the influence caused by correlated channels, we consider the interleaved grouping scheme which leads to a minimum antenna correlation within the same TAG. To select the receive antenna subset with low complexity, we propose an iterative greedy (IG) algorithm that contributes to a maximum equivalent channel gain with low-computational complexity. To reduce the complexity of maximum likelihood (ML) detector, a low complexity IG algorithm-based ML (IG-ML) detector is also derived. Simulation results show that the bit error rate (BER) performance gain up to 3.5 dB is obtained by the proposed PGSM with IG-ML detector over the PGSM with an ordered block minimum mean-squared error detector at a given BER of 10-4. It is also shown that the proposed PGSM with the IG-ML detector achieves a similar BER performance in a high signal-to-noise power ratio region compared with that of an ideal precoding for the GSM with an optimal ML detector.

KW - iterative greedy (IG) algorithm

KW - maximum likelihood (ML)

KW - precoding aided GSM (PGSM)

KW - Transmit antenna groups (TAGs)

UR - http://www.scopus.com/inward/record.url?scp=85057889420&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057889420&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2018.2880844

DO - 10.1109/ACCESS.2018.2880844

M3 - Article

AN - SCOPUS:85057889420

VL - 6

SP - 72449

EP - 72457

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8544100

ER -