Share This Article:

A Simplified Improvement on the Design of QO-STBC Based on Hadamard Matrices

Abstract Full-Text HTML XML Download Download as PDF (Size:163KB) PP. 37-42
DOI: 10.4236/ijcns.2014.71005    3,220 Downloads   4,987 Views   Citations

ABSTRACT

In this paper, a simplified approach for implementing QO-STBC is proposed and evaluated with improved performance. It is based on the Hadamard matrix, in which the scheme exploits the Hadamard matrix property to attain full diversity. Hadamard matrix has the characteristic that diagonalizes a quasi-cyclic matrix and consequently, a decoding matrix so that a diagonal matrix which permits linear decoding is achieved. Using quasicyclic matrices in designing QO-STBC systems requires that the codes should be rotated to reasonably separate one code from another such that error floor in the design can be minimized. It will be shown that, orthogonalizing the secondary codes and then imposing the Hadamard criteria of the scheme can be well diagonalized. The results of this simplified approach demonstrate full diversity and better performance than the interference-free QO-STBC. Results show about 4 dB gain with respect to the interference-free QO-STBC scheme and it performs alike with the earlier Hadamard based QO-STBC designed with rotation. These results achieve the consequent mathematical proposition of the Hadamard matrix and its property is also shown in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

K. Anoh, Y. Dama, R. Abd-Alhameed and S. Jones, "A Simplified Improvement on the Design of QO-STBC Based on Hadamard Matrices," International Journal of Communications, Network and System Sciences, Vol. 7 No. 1, 2014, pp. 37-42. doi: 10.4236/ijcns.2014.71005.

References

[1] S. M. Alamouti, “A Simple Transmit Diversity Technique for Wireless Communications,” IEEE Journal on Selected Areas in Communications, Vol. 16, No. 8, 1998, pp. 1451-1458.
http://dx.doi.org/10.1109/49.730453
[2] H. Jafarkhani, “A Quasi-Orthogonal Space-Time Block Code,” IEEE Transactions on Communications, Vol. 49, No. 1, 2001, pp. 1-4. http://dx.doi.org/10.1109/26.898239
[3] Y. A. S. Dama, R. A. Abd-Alhameed, S. M. R. Jones, H. S. O. Migdadi and P. S. Excell, “A New Approach to Quasi-Orthogonal Space-Time Block Coding Applied to Quadruple Mimo Transmit Antennas,” 4th International Conference on Internet Technologies & Applications, September 2011.
[4] C. B. Papadias and G. J. Foschini, “Capacity-Approaching Space-Time Codes for Systems Employing Four Transmitter Antennas,” IEEE Transactions on Information Theory, Vol. 49, No. 3, 2003, pp. 726-732.
http://dx.doi.org/10.1109/TIT.2002.808119
[5] O. Tirkkonen, A. Boariu and A. Hottinen, “Minimal NonOrthogonality Rate 1 Space-Time Block Code for 3+ Tx Antennas,” IEEE 6th International Symposium on Spread Spectrum Techniques and Applications, 2000, pp. 429-432.
[6] W. Su and X.-G. Xia, “Signal Constellations for Quasiorthogonal Space-Time Block Codes with Full Diversity,” IEEE Transactions on Information Theory, Vol. 50, No. 10, 2004, pp. 2331-2347.
http://dx.doi.org/10.1109/TIT.2004.834740
[7] N. Sharma and C. B. Papadias, “Improved Quasi-Orthogonal Codes through Constellation Rotation,” IEEE Transactions on Communications, Vol. 51, No. 3, 2003, pp. 332-335. http://dx.doi.org/10.1109/TCOMM.2003.809753
[8] Y. Dama, R. Abd-Alhameed, T. Ghazaany and S. Zhu, “A New Approach for OSTBC and QOSTBC,” International Journal of Computer Applications, Vol. 67, No. 6, 2013, pp. 45-48.
[9] U. Park, S. Kim, K. Lim and J. Li, “A Novel QO-STBC Scheme with Linear Decoding for Three and Four Transmit Antennas,” IEEE Communications Letters, Vol. 12, No. 12, 2008, pp. 868-870.
http://dx.doi.org/10.1109/LCOMM.2008.081323
[10] F. Fazel and H. Jafarkhani, “Quasi-Orthogonal Space-Frequency and Space-Time-Frequency Block Codes for MIMO OFDM Channels,” IEEE Transactions on Wireless Communications, Vol. 7, No. 1, 2008, pp. 184-192.
http://dx.doi.org/10.1109/TWC.2008.060420
[11] J.-W. Jang, J.-S. No and H. Chung, “Quasi-Cyclic Generalized Hadamard Matrices,”
http://ita.ucsd.edu/workshop/06/papers/283.pdf
[12] J.-W. Jang, J.-D. Yang, J.-S. No and H. Chung, “New Construction of Balanced Quasi-Cyclic Generalized Hadamard Matrices,” IEEE International Symposium on Information Theory, 2006, pp. 307-310.
[13] F. Szöllösi, “Construction, Classification and Parametrization of Complex Hadamard Matrices,” 2011. arXiv preprint arXiv:1110.5590
[14] W. Su, Z. Safar, M. Olfat and K. R. Liu, “Obtaining FullDiversity Space-Frequency Codes from Space-Time Codes via Mapping,” IEEE Transactions on Signal Processing, Vol. 51, 2003, pp. 2905-2916.
http://dx.doi.org/10.1109/TSP.2003.818200
[15] J. Proakis and M. Salehi, “Digital Communications,” 5th Edtion, McGraw-Hill, Asia, 2008.
[16] K. J. Horadam, “Hadamard Matrices and Their Applications,” Princeton University Press, Princeton, 2007.

  
comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.