Performance analysis on coded system over quasi-static (MIMO) fading channels

In this paper, we derive closed-form upper bounds on the error probability of coded modulation schemes used for multi-input multi-output (MIMO) quasi-static fading channels. The bounds are obtained from new tight union-bound techniques, and can be readily calculated when the distance spectrum is given. In deriving the bounds for the MIMO system, we assume the use of orthogonal space-time block code (OSTBC) as the inner code. The outer code is the block code. We obtain an equivalent single-input single-output (SISO) channel model for this concatenated coded-modulation system. The upper bounds derived here indicate good match with the simulation results of the complete transceiver the system in which the turbo-iterative decoding algorithm is employed at the receiver.

[1]  Meir Feder,et al.  Random coding techniques for nonrandom codes , 1999, IEEE Trans. Inf. Theory.

[2]  D. Divsalar.  A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .

[3]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[4]  Branka Vucetic,et al.  Space-Time Coding , 2003 .

[5]  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).

[6]  Branka Vucetic,et al.  Space-Time Coding , 2003 .

[7]  T. Gulliver,et al.  Capacity and error probability analysis for orthogonal space-time block codes over fading channels , 2005, IEEE Transactions on Wireless Communications.

[8]  G. A. Barnard,et al.  Transmission of Information: A Statistical Theory of Communications. , 1961 .

[9]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[10]  Shlomo Shamai,et al.  Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels , 2003, IEEE Trans. Commun..

[11]  Fulvio Babich,et al.  Analysis and simulation of turbo codes performance over Rice fading channels , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[12]  J. Craig.  A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations , 1991, MILCOM 91 - Conference record.

[13]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

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

[15]  Dariush Divsalar,et al.  Upper bounds to error probabilities of coded systems beyond the cutoff rate , 2003, IEEE Trans. Commun..

[16]  Amiel Feinstein,et al.  Transmission of Information. , 1962 .

[17]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

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

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

[20]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[21]  Scott L. Miller,et al.  Distance spectra and performance bounds of space-time trellis codes over quasistatic fading channels , 2004, IEEE Transactions on Information Theory.

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

[24]  Shlomo Shamai,et al.  Variations on the Gallager bounds, connections, and applications , 2002, IEEE Trans. Inf. Theory.

[25]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[26]  Scott L. Miller,et al.  An improved upper bound on the performance of convolutional codes over quasistatic fading channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[27]  Masoud Salehi,et al.  The union bound for turbo-coded modulation systems over fading channels , 1999, IEEE Trans. Commun..

[28]  Heung-No Lee,et al.  Combinatorial Union-Bound Analysis on the Concatenation of LDPC/Turbo Codes and Space-Time Codes over Fast Fading MIMO Channels , 2006, 2006 IEEE International Conference on Communications.

[29]  Masoud Salehi,et al.  New performance bounds for turbo codes , 1998, IEEE Trans. Commun..

[30]  Mohamed-Slim Alouini,et al.  Digital Communication Over Fading Channels: A Unified Approach to Performance Analysis , 2000 .

[31]  Masoud Salehi,et al.  Performance bounds for turbo-coded modulation systems , 1999, IEEE Trans. Commun..

[32]  Tadeusz A. Wysocki,et al.  Fading characteristics for indoor wireless channels at 5 GHz unlicensed bands , 2003, SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications.

[33]  Simon Litsyn,et al.  On ensembles of low-density parity-check codes: Asymptotic distance distributions , 2002, IEEE Trans. Inf. Theory.