Accurate Approximation of QAM Error Probability on Quasi-Static MIMO Channels and Its Application to Adaptive Modulation

An accurate approximation for the conditional error probability on quasi-static multiple-input multiple-output (MIMO) antenna channels is proposed. For a fixed channel matrix, it is possible to accurately predict the performance of quadrature amplitude modulations (QAM) transmitted over the MIMO channel in presence of additive white Gaussian noise. The tight approximation is based on a simple Union bound for the point error probability in the n-dimensional real space. Instead of making an exhaustive evaluation of all pairwise error probabilities (intractable in many cases), a Pohst or a Schnorr-Euchner lattice enumeration is used to limit the local theta series inside a finite radius sphere. The local theta series is derived from the original lattice theta series and the point position within the finite multidimensional QAM constellation. In particular, we take into account the number of constellation facets (hyperplanes) that are crossing the sphere center. As a direct application to the accurate approximation for the conditional error probability, we describe a new adaptive QAM modulation for quasi-static multiple antenna channels

[1]  C. Tellambura,et al.  An efficient generalized sphere decoder for rank-deficient MIMO systems , 2004 .

[2]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[3]  Emanuele Viterbo,et al.  Computing the Voronoi cell of a lattice: the diamond-cutting algorithm , 1996, IEEE Trans. Inf. Theory.

[4]  Giorgio Taricco,et al.  Exact pairwise error probability of space-time codes , 2002, IEEE Trans. Inf. Theory.

[5]  A. Tulino,et al.  Decoding space-time codes with BLAST architectures , 2002, Proceedings IEEE International Symposium on Information Theory,.

[6]  Chintha Tellambura,et al.  An efficient generalized sphere decoder for rank-deficient MIMO systems , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[7]  Andrea J. Goldsmith,et al.  Degrees of freedom in adaptive modulation: a unified view , 2001, IEEE Trans. Commun..

[8]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[9]  Andrea J. Goldsmith,et al.  Variable-rate variable-power MQAM for fading channels , 1997, IEEE Trans. Commun..

[10]  Loïc Brunel,et al.  Soft-input soft-output lattice sphere decoder for linear channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[12]  H. Sampath,et al.  Adaptive modulation for multiple antenna systems , 2000, Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154).

[13]  J. Cremona,et al.  ALGORITHMIC ALGEBRAIC NUMBER THEORY (Encyclopedia of Mathematics and its Applications) , 1991 .

[14]  Alexander Vardy,et al.  Universal Bound on the Performance of Lattice Codes , 1999, IEEE Trans. Inf. Theory.

[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]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[17]  Robert W. Heath,et al.  Antenna selection for spatial multiplexing systems based on minimum error rate , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[18]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[19]  G. David Forney,et al.  Coset codes-I: Introduction and geometrical classification , 1988, IEEE Trans. Inf. Theory.

[20]  Antonia Maria Tulino,et al.  Decoding space-time codes with BLAST architectures , 2002, IEEE Trans. Signal Process..

[21]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[22]  Emanuele Viterbo,et al.  Good lattice constellations for both Rayleigh fading and Gaussian channels , 1996, IEEE Trans. Inf. Theory.

[23]  AlDAN SCHOFIELD.  Algorithmic Algebraic Number Theory (encyclopedia of Mathematics and Its Applications) , 2006 .

[24]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[25]  Robert W. Heath,et al.  Antenna selection for spatial multiplexing systems with linear receivers , 2001, IEEE Communications Letters.

[26]  M. Pohst.  Computational Algebraic Number Theory , 1993 .

[27]  Michael E. Pohst,et al.  On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.

[28]  Giorgio Taricco,et al.  Correction to "exact pairwise error probability of space-time codes" , 2003, IEEE Trans. Inf. Theory.

[29]  Nihar Jindal,et al.  Information-Bearing Noncoherently Modulated Pilots for MIMO Training , 2007, IEEE Transactions on Information Theory.