Skip to main content

On Space-Time Block Codes from Complex Orthogonal Designs

Abstract

Space-time block codes from orthogonal designs recently proposed by Alamouti, and Tarokh-Jafarkhani-Calderbank have attracted considerable attention due to the fast maximum-likelihood (ML) decoding and the full diversity. There are two classes of space-time block codes from orthogonal designs. One class consists of those from real orthogonal designs for real signal constellations which have been well developed in the mathematics literature. The other class consists of those from complex orthogonal designs for complex constellations for high data rates, which are not well developed as the real orthogonal designs. Since orthogonal designs can be traced back to decades, if not centuries, ago and have recently invoked considerable interests in multi-antenna wireless communications, one of the goals of this paper is toprovide a tutorial on both historical and most recent resultson complex orthogonal designs. For space-time block codes from both real and (generalized) complex orthogonal designs (GCODs) with or without linear processing, Tarokh, Jafarkhani and Calderbank showed that their rates cannot be greater than 1. While the maximum rate 1 can be reachedfor real orthogonal designs for any number of transmit antennas from the Hurwitz–Radon constructive theory, Liang and Xia recentlyshowed that rate 1 for the GCODs (square or non-square size) with linear processing is not reachable for more than two transmit antennas.For GCODs of square size, the designs with the maximum rates have been known, which are related to the Hurwitz theorem.In this paper, We briefly review these results and give a simple and intuitive interpretation of the realization. For GCODs without linear processing (square or non-square size), we prove that the rates cannot be greater than 3/4 for more than two transmit antennas.

This is a preview of subscription content, access via your institution.

References

  1. E. Teletar, “Capacity of Multi-antenna Gaussian Channels”, AT&T Bell Labs, Tech. Rep., June 1995.

  2. G.J. Foschini and M.J. Gans, “On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas”, Wireless Pers. Commun., Vol. 6, pp. 311-335, 1998.

    Google Scholar 

  3. J.-C. Guey, M.P. Fitz, M.R. Bell and W.-Y. Kuo, “Signal Design for Transmitter Diversity Wireless Communication Systems over Rayleigh Fading Channels”, in Proc. IEEE VTC'96, pp. 136-140. Also in IEEE Trans. Commun., Vol. 47, pp. 527-537, 1999.

  4. V. Tarokh, N. Seshadri and A.R. Calderbank, “Space-time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction”, IEEE Trans. Inform. Theory, Vol. 44, No. 2, pp. 744-765, 1998.

    Google Scholar 

  5. S. Alamouti, “A Simple Transmit Diversity Technique for Wireless Communications”, IEEE J. Select. Areas Commun., Vol. 16, No. 8, pp. 1451-1458, 1998.

    Google Scholar 

  6. V. Tarokh, H. Jafarkhani and A.R. Calderbank, “Space-time Block Codes from Orthogonal Designs”, IEEE Trans. Inform. Theory, Vol. 45, No. 5, pp. 1456-1467, 1999.

    Google Scholar 

  7. V. Tarokh, H. Jafarkhani and A.R. Calderbank, “Correction to ‘space-time Block Codes from Orthogonal Designs’ ”, IEEE Trans. Inform. Theory, Vol. 46, No. 1, p. 314, 2000.

    Google Scholar 

  8. A.R. Hammons Jr. and H. El Gamal, “On the Theory of Space-time Codes for PSK Modulation”, IEEE Trans. Inform. Theory, Vol. 46, No. 2, pp. 524-542, 2000.

    Google Scholar 

  9. G. Ganesan and P. Stoica, “Space-time Block Codes: A Maximum SNR Approach”, IEEE Trans. Inform. Theory, Vol. 47, No. 4, pp. 1650-1656, 2001.

    Google Scholar 

  10. O. Tirkkonen and A. Hottinen, “Square-matrix Embeddable Space-time Block Codes for Complex Signal Constellations”, IEEE Trans. Inform. Theory, Vol. 48, No. 2, pp. 1122-1126, 2002.

    Google Scholar 

  11. B.M. Hochwald, T.L. Marzetta and C.B. Papadias, “A Transmitter Diversity Scheme for Wideband CDMA Systems Based on Space-time Spreading”, IEEE J. Select. Areas Commun., Vol. 19, No. 1, pp. 48-60, 2001.

    Google Scholar 

  12. B.M. Hochwald and T.L. Marzetta, “Unitary Space-time Modulation for Multiple-antenna Communication in Rayleigh Flat Fading”, IEEE Trans. Inform. Theory, Vol. 46, No. 2, pp. 543-564, 2000.

    Google Scholar 

  13. B.M. Hochwald and W. Sweldens, “Differential Unitary Space-time Modulation”, IEEE Trans. Commun., Vol. 48, pp. 2041-2052, 2000.

    Google Scholar 

  14. B.L. Hughes, “Differential Space-time Modulation”, IEEE Trans. Inform. Theory, Vol. 46, pp. 2567-2578, 2000.

    Google Scholar 

  15. W. Su and X.-G. Xia, “Two Generalized Complex Orthogonal Space-time Block Codes of Rates 7/11 and 3/5 for 5 and 6 Transmit Antennas”, presented as recent results in the International Symposium on Information Theory (ISIT'01), Washington D.C., June 2001. To appear in IEEE Trans. Inform. Theory.

  16. X.-B. Liang and X.-G. Xia, “Nonexistence of Rate One Space-time Block Codes from Generalized Complex Linear Processing Orthogonal Designs for More than Two Transmit Antennas”, presented as recent results in the International Symposium on Information Theory (ISIT'01), Washington D.C., June 2001.

  17. H. Wang and X.-G. Xia, “Upper Bounds of Rates of Complex Orthogonal Space-time Block Codes”, in Proceedings of the International Symposium on Information Theory (ISIT'02), Laussane, Switzerland, June 30-July 5, 2002. Also preprint, 2002.

  18. A. Hurwitz, “Ñber die Komposition der quadratischen Formen von beliebig vielen Variabeln”, Nachr. Ges. Wiss. Göttinggen, (Math.-Phys. K1.), pp. 309-316, 1898. Reprinted in Math. Werke, Bd. 2, Birkhäuser, pp. 565-571, Basel, 1963.

  19. A. Hurwitz, “Ñber die Komposition der quadratischen Formen”, Math. Ann., Vol. 88, pp. 1-25, 1923.

    Google Scholar 

  20. J. Radon, “Lineare Scharen orthogonaler Matrizen”, Abhandlungen aus dem Mathematischen Seminar der Hamburgishen Universität, Vol. I, pp. 1-14, 1922.

    Google Scholar 

  21. T. Josefiak, “Realization of Hurwitz-Radon Matrices”, Queen's Papers in Pure and Applied Mathematics, No. 36, pp. 346-351, 1976.

    Google Scholar 

  22. W. Wolfe, “Amicable Orthogonal Designs - Existence”, Canad. J. Math., Vol. 28, pp. 1006-1020, 1976.

    Google Scholar 

  23. A.V. Geramita and J.M. Geramita, “Complex Orthogonal Designs”, Journal of Combinatorial Theory, Series A (25), pp. 211-225, 1978.

  24. A.V. Geramita and J. Seberry, Orthogonal Designs, Quadratic Forms and Hadamard Matrices, Lecture Notes in Pure and Applied Mathematics, Vol. 43, Marcel Dekker: New York and Basel, 1979.

    Google Scholar 

  25. D.B. Shapiro, Compositions of Quadratic Forms, De Gruyter: New York, 2000.

    Google Scholar 

  26. R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press: New York, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Su, W., Xia, XG. On Space-Time Block Codes from Complex Orthogonal Designs. Wireless Personal Communications 25, 1–26 (2003). https://doi.org/10.1023/A:1023688509457

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023688509457

  • diversity
  • (generalized) complex orthogonal designs
  • Hurwitz theorem
  • space-time block codes
  • wireless communications