Performance evaluation of a class of non-coherent unitary space-time codes

Abstract

In this paper we analytically consider the performance of a MIMO system which uses a family of non-coherent unitary space-time codes. This family of codes was proposed by V. Tarokh and I. M. Kim (2002). Using general properties of the unitary space-time codes proposed in Hochwald et al. (2000), we develop an upper bound on the symbol error probability of this system. Then by using the decoding method of this family of codes proposed in Tarokh, we derive a lower bound on the symbol error probability. After proposing the upper and lower bounds on the symbol error probability, we compare these bounds with each other for two different MIMO systems, and we observe that both are tight enough to predict symbol error probability of such a system.