Performance analysis of some non-coherent space-time codes

In this paper we investigate single-input multiple-output non-coherent space-time schemes over the flat fading Rayleigh channel. First, we propose a simplified decoding algorithm for a unitary space-time code obtained via the exponential mapping. We analyze the performance of this scheme in terms of complexity and error probability. We compare this scheme to training-based schemes since they are one of the best available propositions in the literature.

[1]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[2]  Pranav Dayal,et al.  Leveraging coherent space-time codes for noncoherent communication via training , 2004, IEEE Transactions on Information Theory.

[3]  Jean-Claude Belfiore,et al.  A new family of Grassmann space-time codes for non-coherent MIMO systems , 2003, IEEE Communications Letters.

[4]  Matthias Brehler,et al.  Training-Codes for the Noncoherent Multi-Antenna Block-Rayleigh-Fading Channel , 2003 .

[5]  Matthias Brehler,et al.  Asymptotic error probability analysis of quadratic receivers in Rayleigh-fading channels with applications to a unified analysis of coherent and noncoherent space-Time receivers , 2001, IEEE Trans. Inf. Theory.

[6]  J. Belfiore,et al.  Grassmann-based signal design for non coherent reception , 2003, 2003 4th IEEE Workshop on Signal Processing Advances in Wireless Communications - SPAWC 2003 (IEEE Cat. No.03EX689).

[7]  Thomas L. Marzetta,et al.  Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading , 1999, IEEE Trans. Inf. Theory.

[8]  Jean-Claude Belfiore,et al.  Simplified decoding for some non-coherent codes over the Grassmannian , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[9]  Lizhong Zheng,et al.  Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel , 2002, IEEE Trans. Inf. Theory.