Abstract

In this paper, we analyze the performance of convolutionally coded space-shift keying (SSK) modulation on block-fading channels. We derive the transfer function bound for the conditional error performance of coded SSK modulation. Existing works on SSK error performance focus mostly either on uncoded systems or on coded systems with independent fading between successive symbols. Code performance analysis is complicated by the fact that SSK modulation does not yield a uniform symbol, i.e., the error probability of a bit in a symbol is not independent of the position of the bit in the label. Furthermore, there are no nearest neighbors in the SSK constellation. The code and modulation must be jointly analyzed. We show techniques that can be employed to derive the error transfer function of the convolutional code. The degrees of separation in SSK modulation are accurately represented. The diversity order achieved by the system can be predicted. We also show a technique that can simplify analysis of the coded system. We present simulation results that demonstrate the asymptotic accuracy of the derived transfer function bound.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call