Advertisement

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

  • A. Roger HammonsJr.
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, North-Holland Mathematical Library. Elsevier Science Publishers, Amsterdam (1977)zbMATHGoogle Scholar
  2. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 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. 8.
    Hammons Jr., A.R.: On Space-Time Codes and Constellation Labelling. In: IEEE Information Theory Workshop , San Antonio, Texas (2004)Google Scholar
  9. 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. 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. 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. 12.
    Li, Y., Xia, X.-G.: Full Diversity Distributed Space-Time Trellis Codes for Asynchronous Cooperative Communications (preprint)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • A. Roger HammonsJr.
    • 1
  1. 1.The Johns Hopkins University Applied Physics LaboratoryLaurelUSA

Personalised recommendations