The generalized spatial modulation (GSM) is a new transmission technique that can realize high-performance multiple-input multiple-output (MIMO) communication systems with a low RF complexity. This paper presents an efficient sphere decoding method used to perform the symbol detection for the generalized spatial modulation (GSM) multiple-input multiple-output (MIMO) systems. In the proposed method, the cost metric is modified so that it does not include the cancellation of the nonexistent interference. The modified cost metric can be computed by formulating a detection tree that has a regular structure representing the transmit antenna combinations as well as the symbol vectors, both of which are detected efficiently by finding the shortest path on the basis of an efficient tree search algorithm. As the tree search algorithm is performed for the regular detection tree to compute the modified but mathematically-equivalent cost metric, the efficiency of the sphere decoding is improved while the bit-error rate performance is not degraded. The simulation results show that the proposed method reduces the complexity significantly when compared with the previous method: for the 6×6 64QAM GSM-MIMO system with two active antennas, the average reduction rate of the complexity is as high as 45.8% in the count of the numerical operations.
Hye-Yeon YOON
Korea Aerospace University
Gwang-Ho LEE
Korea Aerospace University
Tae-Hwan KIM
Korea Aerospace University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hye-Yeon YOON, Gwang-Ho LEE, Tae-Hwan KIM, "Efficient Sphere Decoding Based on a Regular Detection Tree for Generalized Spatial Modulation MIMO Systems" in IEICE TRANSACTIONS on Communications,
vol. E101-B, no. 1, pp. 223-231, January 2018, doi: 10.1587/transcom.2017EBP3030.
Abstract: The generalized spatial modulation (GSM) is a new transmission technique that can realize high-performance multiple-input multiple-output (MIMO) communication systems with a low RF complexity. This paper presents an efficient sphere decoding method used to perform the symbol detection for the generalized spatial modulation (GSM) multiple-input multiple-output (MIMO) systems. In the proposed method, the cost metric is modified so that it does not include the cancellation of the nonexistent interference. The modified cost metric can be computed by formulating a detection tree that has a regular structure representing the transmit antenna combinations as well as the symbol vectors, both of which are detected efficiently by finding the shortest path on the basis of an efficient tree search algorithm. As the tree search algorithm is performed for the regular detection tree to compute the modified but mathematically-equivalent cost metric, the efficiency of the sphere decoding is improved while the bit-error rate performance is not degraded. The simulation results show that the proposed method reduces the complexity significantly when compared with the previous method: for the 6×6 64QAM GSM-MIMO system with two active antennas, the average reduction rate of the complexity is as high as 45.8% in the count of the numerical operations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2017EBP3030/_p
Copy
@ARTICLE{e101-b_1_223,
author={Hye-Yeon YOON, Gwang-Ho LEE, Tae-Hwan KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficient Sphere Decoding Based on a Regular Detection Tree for Generalized Spatial Modulation MIMO Systems},
year={2018},
volume={E101-B},
number={1},
pages={223-231},
abstract={The generalized spatial modulation (GSM) is a new transmission technique that can realize high-performance multiple-input multiple-output (MIMO) communication systems with a low RF complexity. This paper presents an efficient sphere decoding method used to perform the symbol detection for the generalized spatial modulation (GSM) multiple-input multiple-output (MIMO) systems. In the proposed method, the cost metric is modified so that it does not include the cancellation of the nonexistent interference. The modified cost metric can be computed by formulating a detection tree that has a regular structure representing the transmit antenna combinations as well as the symbol vectors, both of which are detected efficiently by finding the shortest path on the basis of an efficient tree search algorithm. As the tree search algorithm is performed for the regular detection tree to compute the modified but mathematically-equivalent cost metric, the efficiency of the sphere decoding is improved while the bit-error rate performance is not degraded. The simulation results show that the proposed method reduces the complexity significantly when compared with the previous method: for the 6×6 64QAM GSM-MIMO system with two active antennas, the average reduction rate of the complexity is as high as 45.8% in the count of the numerical operations.},
keywords={},
doi={10.1587/transcom.2017EBP3030},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Efficient Sphere Decoding Based on a Regular Detection Tree for Generalized Spatial Modulation MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 223
EP - 231
AU - Hye-Yeon YOON
AU - Gwang-Ho LEE
AU - Tae-Hwan KIM
PY - 2018
DO - 10.1587/transcom.2017EBP3030
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2018
AB - The generalized spatial modulation (GSM) is a new transmission technique that can realize high-performance multiple-input multiple-output (MIMO) communication systems with a low RF complexity. This paper presents an efficient sphere decoding method used to perform the symbol detection for the generalized spatial modulation (GSM) multiple-input multiple-output (MIMO) systems. In the proposed method, the cost metric is modified so that it does not include the cancellation of the nonexistent interference. The modified cost metric can be computed by formulating a detection tree that has a regular structure representing the transmit antenna combinations as well as the symbol vectors, both of which are detected efficiently by finding the shortest path on the basis of an efficient tree search algorithm. As the tree search algorithm is performed for the regular detection tree to compute the modified but mathematically-equivalent cost metric, the efficiency of the sphere decoding is improved while the bit-error rate performance is not degraded. The simulation results show that the proposed method reduces the complexity significantly when compared with the previous method: for the 6×6 64QAM GSM-MIMO system with two active antennas, the average reduction rate of the complexity is as high as 45.8% in the count of the numerical operations.
ER -