Analytical tools for space-time codes over quasi-static fading channels

This paper proposes effective ways to reduce the complexity of computing the distance spectrum of space-time trellis codes. First the notion of Voronoi neighborhood is extended to space-time trellis codes. Next, only simple error events are used, then a stack algorithm is used to further reduce complexity. The obtained reduced spectra are then used in conjunction with some previously proposed upper bounds to predict the performance of some published codes over quasi-static fading channels. Of interest are published space-time codes for which only tentative performance characterization has been proposed so far. The numerical results show that indeed the performance of these codes only depends on their distance spectrum and that remarkably tight bounds can be obtained.

[1]  Gordon L. Stuber,et al.  Principles of Mobile Communication , 1996 .

[2]  Ran Gozali,et al.  Space-Time Codes for High Data Rate Wireless Communications , 2002 .

[3]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[4]  Tolga M. Duman,et al.  Performance analysis of space-time trellis codes over quasi-static fading channels , 2001, SPIE ITCom.

[5]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

[6]  D. K. Aktas.  The distance spectrum of space-time trellis coded modulations in quasi-static Rayleigh fading channels , 2000 .

[7]  John G. Proakis,et al.  Digital Communications , 1983 .

[8]  Scott L. Miller,et al.  Space-time code performance analysis for quasi-static fading channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[9]  J. Guey,et al.  Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels , 1996, Proceedings of Vehicular Technology Conference - VTC.

[10]  Gerhard Bauch,et al.  Improved codes for space-time trellis-coded modulation , 2000, IEEE Communications Letters.

[11]  Dariush Divsalar,et al.  Upper bounds to error probabilities of coded systems over AWGN and fading channels , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[12]  Rick S. Blum,et al.  Optimum space-time convolutional codes , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[13]  Andrej Stefanov,et al.  Performance bounds for space-time trellis codes , 2003, IEEE Trans. Inf. Theory.