Multiary turbo code fitting for unitary space-time modulation and its MAP decoding algorithm

Unitary space-time modulation (USTM) fits for rapid Rayleigh flat fading channels as it can realize wireless communication when neither the transmitter nor the receiver knows the channel state information (CSI). However, an intrinsic problem is that only when the signal-to-noise ratio (SNR) is high can it give an ideal bit error rate (BER) performance. The existing bit-wise processing scheme of the combination of turbo code and USTM improves the BER performance and results in an unacceptable calculation complexity, storage and time delay problem. In this paper, we propose a multiary processing scheme and its corresponding multiary MAP decoding algorithm. Simulation results verify that our scheme can reduce the system complexity while keep a good BER performance. Furthermore, we present the first analysis of the reason for the BER performance deterioration of the combination scheme at low SNR with the help of the definition of USTM.

[1]  Adam Panagos,et al.  A new design metric for unitary space-time codes , 2006, IWCMC '06.

[2]  Thomas L. Marzetta,et al.  Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading , 1999, IEEE Trans. Inf. Theory.

[3]  Hui Ji,et al.  A simple size-reduced constellation scheme for unitary space-time modulation , 2008, 2008 11th IEEE Singapore International Conference on Communication Systems.

[4]  E. Masoud,et al.  Space-Time Block Coding for Wireless Communications , 2008 .

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

[6]  Hamid Jafarkhani,et al.  Multiple transmit antenna differential detection from generalized orthogonal designs , 2001, IEEE Trans. Inf. Theory.

[7]  Jin Wang,et al.  Unitary Space-Time Modulation of Turbo Trellis-Coded for Multiple-Antenna Rayleigh Fading Channel , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.

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

[9]  Thomas L. Marzetta,et al.  Systematic design of unitary space-time constellations , 2000, IEEE Trans. Inf. Theory.

[10]  Lizhong Zheng,et al.  Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel , 2002, IEEE Trans. Inf. Theory.

[11]  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.

[12]  Bertrand M. Hochwald,et al.  Differential unitary space-time modulation , 2000, IEEE Trans. Commun..

[13]  H. Vincent Poor,et al.  Turbo (iterative) decoding of a unitary space-time code with a convolutional code , 2002, Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367).

[14]  Tolga M. Duman,et al.  Combined turbo coding and unitary space-time modulation , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[15]  Ju Liu,et al.  Pair-wise error probability and its Chernoff upper bound for unitary space-time code , 2010, Science China Information Sciences.

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

[17]  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.

[18]  Amir K. Khandani,et al.  Symbol-based turbo codes , 1999, IEEE Communications Letters.

[19]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[20]  Thomas L. Marzetta,et al.  Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading , 2000, IEEE Trans. Inf. Theory.

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