A circulant based space-time coding for multiple input multiple output system in fading channels

In this paper a new space time coding, which is suitable for high data rate communications is proposed. In this approach data is encoded by using a decomposition of a circulant matrix and the output of encoder is splitted into N streams to be transmitted simultaneously to N transmit antennas. The performance of this multiple input multiple output system is evaluated in a Rayleigh fading channel. Its performance in terms of symbol error rate, diversity gain and complexity is obtained. Simulation results show that with a perfect channel estimator, when channel state information (CSI) is available at the receiver, the Circulant Space Time code (CSTC) has a better symbol error rate via signal to noise ratio in compared to the spatial multiplexing and near to orthogonal space time block code.

[1]  P. Vijay Kumar,et al.  Perfect space-time codes with minimum and non-minimum delay for any number of antennas , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[2]  S. R. Simanca,et al.  On Circulant Matrices , 2012 .

[3]  Mohamed Oussama Damen,et al.  Universal space-time coding , 2003, IEEE Trans. Inf. Theory.

[4]  Constantinos B. Papadias,et al.  Full-Rate Full-Diversity Linear Quasi-Orthogonal Space-Time Codes for Any Number of Transmit Antennas , 2004, EURASIP J. Adv. Signal Process..

[5]  Norman C. Beaulieu,et al.  Linear threaded algebraic space-time constellations , 2003, IEEE Trans. Inf. Theory.

[6]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[7]  Chau Yuen,et al.  On the Decoding and Optimizing Performance of Four-Group Decodable Space-Time Block Codes , 2006 .

[8]  Robert M. Gray,et al.  Toeplitz and Circulant Matrices: A Review , 2005, Found. Trends Commun. Inf. Theory.

[9]  Mohammad Gharavi-Alkhansari,et al.  A New Full-Rate Full-Diversity Space-Time Block Code With Nonvanishing Determinants and Simplified Maximum-Likelihood Decoding , 2008, IEEE Transactions on Signal Processing.

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

[11]  Constantinos B. Papadias,et al.  Full rate full diversity linear quasi-orthogonal space-time codes for any transmit antennas , 2003 .

[12]  A. Wittneben,et al.  A new bandwidth efficient transmit antenna modulation diversity scheme for linear digital modulation , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[13]  P. Vijay Kumar,et al.  Perfect Space–Time Codes for Any Number of Antennas , 2007, IEEE Transactions on Information Theory.

[14]  Serdar Sezginer,et al.  Full-rate full-diversity 2 x 2 space-time codes of reduced decoder complexity , 2007, IEEE Communications Letters.

[15]  Karim Abed-Meraim,et al.  Diagonal algebraic space-time block codes , 2002, IEEE Trans. Inf. Theory.

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

[17]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

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

[19]  Wolfgang Rave,et al.  Quasi-Orthogonal STBC Using Stretched Constellations for Low Detection Complexity , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[20]  Xue-Bin Liang,et al.  Orthogonal designs with maximal rates , 2003, IEEE Trans. Inf. Theory.

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

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

[23]  K. Deergha Rao.  Space–Time Coding , 2015 .

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

[25]  Hamid Jafarkhani,et al.  A quasi-orthogonal space-time block code , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[26]  Chau Yuen,et al.  Quasi-orthogonal STBC with minimum decoding complexity , 2005, IEEE Transactions on Wireless Communications.

[27]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .