Open AccessSimple near‐maximum‐likelihood low‐complexity detection scheme for Alamouti space‐time block coded spatial modulation
Author(s) -
Xu Hongjun,
Pillay Narushan
Publication year - 2014
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2013.1086
Subject(s) - space–time block code , quadrature amplitude modulation , algorithm , block code , qam , computational complexity theory , rayleigh fading , modulation (music) , computer science , fading , detector , spatial modulation , mathematics , bit error rate , telecommunications , decoding methods , mimo , physics , beamforming , acoustics
Space‐time block coded spatial modulation (STBC–SM) has been proposed to exploit the advantages of both spatial modulation and space‐time block codes. The first objective of this study is to introduce a very simple near‐maximum‐likelihood (ML) low‐complexity detection scheme for N t × N r M‐ary quadrature amplitude modulation (M‐QAM) STBC–SM. Simulation results validate that the proposed simple detection scheme achieves near‐ML detection error performance. Furthermore, in comparison to existing schemes, the computational complexity of the proposed detector was demonstrated to be independent of the modulation size, hence exhibiting a very low computational complexity. The second objective of this study is to present an asymptotic bound to quantify the average bit‐error rate performance of M‐QAM STBC–SM over independent and identically distributed Rayleigh flat fading channels. The analytical frameworks are validated by Monte Carlo simulations.