Space-time code designs based on the generalized binary rank criterion with applications to cooperative diversity

12Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Hammons, A. R. (2006). Space-time code designs based on the generalized binary rank criterion with applications to cooperative diversity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 69–84). Springer Verlag. https://doi.org/10.1007/11779360_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free