DocumentCode :
8200
Title :
Further Complexity Reduction for Antenna Selection in Spatial Modulation Systems
Author :
Jianping Zheng ; Jiajun Chen
Author_Institution :
State Key Lab. of ISN, Xidian Univ., Xi´an, China
Volume :
19
Issue :
6
fYear :
2015
fDate :
Jun-15
Firstpage :
937
Lastpage :
940
Abstract :
In this letter, the transmit antenna selection in the spatial modulation system is studied. First, the computational complexity of the transmit antenna selection algorithm previously proposed elsewhere is reduced through an alternative computation of the singular value. Second, the minimum distance ascent (MDA) search is proposed to reduce the search complexity, where the initial antenna subset is acquired through the greedy incremental algorithm. Simulation results show that, compared with the exhaustive search, the proposed MDA search reduces the search complexity enormously with only slight performance loss.
Keywords :
MIMO communication; antenna arrays; greedy algorithms; modulation; search problems; exhaustive search; further complexity reduction; greedy incremental algorithm; minimum distance ascent search; spatial modulation systems; transmit antenna selection algorithm; Computational complexity; Joints; Phase shift keying; Transmitting antennas; Spatial modulation; antenna selection; greedy algorithm;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2015.2417884
Filename :
7073602
Link To Document :
بازگشت