Comparison of suboptimal iterative space-time receivers

At high spectral efficiencies, optimal decoding of space time block coded (STBC) multiple input multiple output (MIMO) systems has a critical complexity unless the space-time code structure offers simple optimal decoding, as is the case for space time orthogonal block codes (STOBC). Indeed, the complexity of true maximum likelihood (ML) decoding or a posteriori probability (APP) decoding of STBC increase exponentially with the spectral efficiency. As a soft input soft output (SISO) decoding scheme, APP space-time decoding is of special interest since it allows the space-time receiver to efficiently work with a channel decoder. Besides, it can advantageously be used in an iterative manner with a SISO channel decoder to approach the optimal joint receiver performance. List sphere decoding (LSD) provides a good approximation of APP decoding with reduced complexity and can therefore be considered as a performance reference. This paper presents a new suboptimal SISO space-time receiver based on MMSE using priors, which has significantly lower complexity than LSD but turns out to perform similarly when used in an iterative receiver. The system under consideration is first presented, followed by a detailed description of the new proposed MMSE based receiver and a brief description of the reference LSD receiver. These two schemes are then evaluated in iterative receivers in terms of performance and complexity.

[1]  Iterative Equalization Using Priors , 1998 .

[2]  Tadashi Matsumoto,et al.  Space-time turbo equalization and symbol detection in frequency selective MIMO channels , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[3]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[4]  Luc Vandendorpe,et al.  Turbo-equalization for multilevel modulation: an efficient low-complexity scheme , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[5]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[6]  A. Robert Calderbank,et al.  Space-time codes for high data rate wireless communication: performance criteria , 1997, Proceedings of ICC'97 - International Conference on Communications.

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

[8]  Robert W. Heath,et al.  Space-time block codes versus space-time trellis codes , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[9]  Arogyaswami Paulraj,et al.  Space-time block codes: a capacity perspective , 2000, IEEE Communications Letters.

[10]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

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

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

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

[14]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.