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

Authors:
A. Roger Hammons
Affiliations:
The Johns Hopkins University Applied Physics Laboratory, Laurel, MD
Venue:
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Year:
2005

Citing 4
Cited 3

Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
On the theory of space-time codes for PSK modulation

IEEE Transactions on Information Theory
A rank criterion for QAM space-time codes

IEEE Transactions on Information Theory
A unified construction of space-time codes with optimal rate-diversity tradeoff

IEEE Transactions on Information Theory

On the design of delay-tolerant distributed space-time codes with minimum length

IEEE Transactions on Wireless Communications
DMT analysis of asynchronous OFDM decode-and-forward cooperative networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Asymptotic behaviour of codes in rank metric over finite fields

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.