
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Efficient Sphere Decoding Based on a Regular Detection Tree for Generalized Spatial Modulation MIMO Systems
HyeYeon YOON GwangHo LEE TaeHwan KIM
Publication
IEICE TRANSACTIONS on Communications
Vol.E101B
No.1
pp.223231 Publication Date: 2018/01/01
Online ISSN: 17451345 Type of Manuscript: PAPER Category: Wireless Communication Technologies Keyword: multipleinput multipleoutput, generalized spatial modulation, sphere decoding, symbol detection, maximum likelihood,
Full Text: PDF(1.8MB) >>Buy this Article
Summary:
The generalized spatial modulation (GSM) is a new transmission technique that can realize highperformance multipleinput multipleoutput (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) multipleinput multipleoutput (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 mathematicallyequivalent cost metric, the efficiency of the sphere decoding is improved while the biterror 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 GSMMIMO 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.

