wo kinds of improved SD algorithms for generalised spatial modulation (GSM), termed as the tree search SD (T-SD) and the path search SD (P-SD), are proposed to provide greater complexity reduction compared with the conventional SD algorithms by merging the repeating elements of the vectors. Simulation results show that the proposed T-SD and P-SD can reduce the complexity dramatically while maintaining the optimum bit-error-ratio(BER) performance, especially for high spectral efficiency GSM. Furthermore, P-SD breaks the limitation on the number of transmit antennas and receive antennas.

Dataset Files

You must be an IEEE Dataport Subscriber to access these files. Subscribe now or login.

Help us make IEEE DataPort better. Sign up to be a Beta Tester and receive a coupon code for a free subscription to IEEE DataPort! Learn More

Dataset Details

Citation Author(s):
Submitted by:
Yeqiu Lan
Last updated:
Sun, 11/26/2017 - 22:26
Data Format:

Categories & Keywords


[1] , "T-SD/P-SD ", IEEE Dataport, 2017. [Online]. Available: Accessed: Mar. 21, 2018.
doi = {10.21227/H2F93M},
url = {},
author = { },
publisher = {IEEE Dataport},
title = {T-SD/P-SD },
year = {2017} }
T1 - T-SD/P-SD
AU -
PY - 2017
PB - IEEE Dataport
UR - 10.21227/H2F93M
ER -
. (2017). T-SD/P-SD . IEEE Dataport.
, 2017. T-SD/P-SD . Available at:
. (2017). "T-SD/P-SD ." Web.
1. . T-SD/P-SD [Internet]. IEEE Dataport; 2017. Available from :
. "T-SD/P-SD ." doi: 10.21227/H2F93M