z-logo
open-access-imgOpen Access
Performance of multiple active‐spatial modulation: information theoretic criteria over correlated Rayleigh fading channels
Author(s) -
Akuon Peter Odero,
Xu Hongjun
Publication year - 2016
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.2015.0822
Subject(s) - rayleigh fading , mathematics , algorithm , probability density function , detector , statistics , mutual information , fading , bit error rate , mimo , spectral efficiency , computer science , decoding methods , telecommunications , beamforming
In this study, symbol error probability of transmitted modulation signals for a single‐input–multiple‐output system is used to derive overall average bit error probability (ABEP) of multiple active‐spatial modulation (MA‐SM) system as a function of the number density of bits in error. Specifically, a theoretic method of determining the number density of bits in error in the joint detector of MA‐SM is proposed. Sample variance (SV) criterion uses the sample covariance of detector noise data, while mutual information (MI) criterion uses relative entropy derived from the Kullback–Liebler distance to compute the number density of bits in error. The choice for the better criterion is formulated as a model selection problem between the SV and the MI criteria. Analytical results for ABEP are tightly verified from simulations, which are carried out under arbitrarily correlated flat Rayleigh fading channels. Various data rates, antenna spacing and number of transmit and receive antenna configurations are tested, where it is also shown that SM is a special case of MA‐SM. Moreover, a basis spectral efficiency (BSE) formula for MA‐SM systems is proposed, which can be used to select a preferred antenna configuration without the need for simulations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here