Predicting Approximate Performance Bounds for Space–Time Codes Over Quasi-Static Fading Channels

This paper provides a useful method for predicting the approximate performance of space time codes over quasi-static fading channels. Based on evaluating the signal-to-noise ratios (SNR) of the extrinsic information in the minimum mean-square error (MMSE) detector, we obtain upper and lower bounds on SNR, which are the convergent limits of the SNR evolution of the extrinsic information between the MMSE detector and the a posteriori probability decoder. Based on the SNR bounds the upper and lower bounds of frame-error-rate and bit-error-rate can be assessed by averaging over the fading coefficients. The results of numerical simulations are found to be in excellent agreement with the semi-analytic bounds.

[1]  H. Vincent Poor,et al.  Probability of error in MMSE multiuser detection , 1997, IEEE Trans. Inf. Theory.

[2]  Steven D. Blostein,et al.  Minimum BER power allocation for MIMO spatial multiplexing systems , 2007, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[3]  Cong Ling,et al.  Gallager Bounds for Noncoherent Decoders in Fading Channels , 2007, IEEE Transactions on Information Theory.

[4]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[5]  Pramod K. Varshney,et al.  A wavelet domain diversity method for transmission of images over wireless channels , 2000, IEEE Journal on Selected Areas in Communications.

[6]  Ali Ghrayeb,et al.  Performance bounds for combined channel coding and space-time block coding with receive antenna selection , 2006, IEEE Transactions on Vehicular Technology.

[7]  Xiaodong Wang,et al.  Iterative receivers for multiuser space-time coding systems , 2000, IEEE Journal on Selected Areas in Communications.

[8]  Scott L. Miller,et al.  An upper bound on turbo codes performance over quasi-static fading channels , 2003, IEEE Communications Letters.

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

[10]  H. Vincent Poor,et al.  Iterative (turbo) soft interference cancellation and decoding for coded CDMA , 1999, IEEE Trans. Commun..

[11]  Cong Ling,et al.  Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration , 2008, IEEE Transactions on Information Theory.

[12]  Dariush Divsalar,et al.  Iterative turbo decoder analysis based on density evolution , 2001, IEEE J. Sel. Areas Commun..

[13]  Andrej Stefanov,et al.  Performance bounds for turbo-coded multiple antenna systems , 2003, IEEE J. Sel. Areas Commun..

[14]  Rick S. Blum,et al.  Improved space-time codes using serial concatenation , 2000, IEEE Communications Letters.

[15]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[16]  Cong Ling,et al.  New Gallager Bounds in Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

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