Skip to main content

Space-Time Code Designs Based on the Generalized Binary Rank Criterion with Applications to Cooperative Diversity

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3969))

Abstract

Li and Xia have recently investigated the design of space-time codes that achieve full spatial diversity for quasi-synchronous cooperative communications. They show that certain of the binary space-time trellis codes derived from the Hammons-El Gamal stacking construction are delay tolerant and can be used in the multilevel code constructions by Lu and Kumar to produce delay tolerant space-time codes for PSK and QAM signaling. In this paper, we present a generalized stacking criterion for maximal rank-d binary codes and develop new explicit constructions. We also present several multilevel space-time code constructions for certain AM-PSK constellations that generalize the recent Lu-Kumar unified construction. Following the approach by Li and Xia, we show that, if the binary constituent codes used in these AM-PSK constructions are delay tolerant, so are the multilevel codes, making them well-suited for quasi-synchronous cooperative diversity applications.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, North-Holland Mathematical Library. Elsevier Science Publishers, Amsterdam (1977)

    MATH  Google Scholar 

  2. Tarokh, V., Seshadri, N., Calderbank, A.R.: Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction. IEEE Transactions on Information Theory 44, 744–765 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hammons Jr., A.R., El Gamal, H.: On the Theory of Space-Time Codes for PSK Modulation. IEEE Transactions on Information Theory 46(2), 524–542 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Liu, Y., Fitz, M.P., Takeshita, O.Y.: A Rank Criterion for QAM Space-Time Codes. IEEE Transactions on Information Theory 48(12), 3062–3079 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. El Gamal, H., Hammons, Jr., A.R.: On the design and performance of algebraic space-time codes for BPSK and QPSK modulation. IEEE Transactions on Communications (June 2002)

    Google Scholar 

  6. Lu, H.F., Kumar, P.V.: A Unified Construction of Space-Time Codes with Optimal Rate-Diversity Tradeoff. IEEE Transactions on Information Theory 51(5), 1709–1730 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hammons Jr., A.R.: New AM-PSK Space-Time Codes Achieving the Rate-Diversity Tradeoff. In: International Symposium on Information Theory and Its Applications, Parma, Italy (2004)

    Google Scholar 

  8. Hammons Jr., A.R.: On Space-Time Codes and Constellation Labelling. In: IEEE Information Theory Workshop , San Antonio, Texas (2004)

    Google Scholar 

  9. Hammons Jr., A.R.: Space-Time Codes that Achieve the Rate-Diversity Tradeoff for Certain AM-PSK Modulations. IEEE Transactions on Information Theory, March 2004 (to appear, 2004)

    Google Scholar 

  10. Hammons Jr., A.R.: Space-Time Codes for Linearly Labelled PAM, PSK, QAM, and Related Constellations. IEEE Information Theory Transactions, August 2004 (submitted, 2004)

    Google Scholar 

  11. Lu, H.-F.: Generalized Super-Unified Constructions for Space-Time Codes and their Subset-Subcodes that Achieve Rate-Diversity Tradeoff (preprint)

    Google Scholar 

  12. Li, Y., Xia, X.-G.: Full Diversity Distributed Space-Time Trellis Codes for Asynchronous Cooperative Communications (preprint)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hammons, A.R. (2006). Space-Time Code Designs Based on the Generalized Binary Rank Criterion with Applications to Cooperative Diversity. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_7

Download citation

  • DOI: https://doi.org/10.1007/11779360_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35481-9

  • Online ISBN: 978-3-540-35482-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics