Distributed space-time codes: relays delays and code word overlays

Authors:
Mohamed Oussama Damen;Roger Hammons
Affiliations:
University of Waterloo, Waterloo, Canada;John Hopkins University, Maryland, USA
Venue:
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Year:
2007

Citing 4
Cited 3

Space-time block codes for quasi-synchronous cooperative diversity

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Universal space-time coding

IEEE Transactions on Information Theory
Systematic construction of full diversity algebraic constellations

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

IEEE Transactions on Information Theory

End-to-end joint antenna selection strategy and distributed compress and forward strategy for relay channels

EURASIP Journal on Wireless Communications and Networking - Special issue on cooperative communications in wireless networks
To code in space and time or not in multihop relay channels

IEEE Transactions on Signal Processing
Multi-hop MIMO relay networks: diversity-multiplexing trade-off analysis

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider decode and forward strategy in the relay channel, where in the first time interval the source communicates its message to its neighboring relays, and in the second time interval, the relays form a distributed space-time code and forward the source message to the destination. In particular, we tackle the problem of overlapping code words in asynchronous distributed coded transmission. We show that the class of delay-tolerant TAST codes [1], with a small modification, can achieve full spatial diversity even when considering overlapping code words from the different asynchronous relays. Simulation results confirm our analysis.