Distributed linear convolutive space-time codes for asynchronous cooperative communication networks

Authors:
Xiaoyong Guo;Xiang-Gen Xia
Affiliations:
Dept. of Electr. & Comput. Eng., Univ. of Delaware, Newark, DE;-
Venue:
IEEE Transactions on Wireless Communications - Part 2
Year:
2008

Citing 0
Cited 8

Computationally efficient equalization for asynchronous cooperative communications with multiple frequency offsets

IEEE Transactions on Wireless Communications
Distributed space-frequency codes for cooperative communication systems with multiple carrier frequency offsets

IEEE Transactions on Wireless Communications
Delay-tolerant distributed linear convolutional space-time code with minimum memory length under frequency-selective channels

IEEE Transactions on Wireless Communications
Combating timing asynchronism in relay transmission for 3GPP LTE uplink

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A distributed linear convolutive space-frequency coding for cooperative communication systems with multiple frequency offsets

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Delay-tolerant distributed linear convolutional space-time code under frequency-selective channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed space-time code for asynchronous two-way wireless relay networks under frequency-selective channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A linear analog network coding for asynchronous two-way relay networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In user cooperative communications, time offsets among the relay nodes may distort the structure of a distributed space-time code, and therefore impair the diversity gain. In this paper, a distributed linear convolutive space-time coding scheme is proposed for asynchronous cooperative communication networks. We propose systematic construction methods of linear convolutive space-time codes (DLC-STC) that are .insensitive to the timing errors, i.e., they achieve the full spatial diversity under any delay profile. We then study the diversity property of the delay-tolerant DLC-STC with suboptimal receivers that have low decoding complexity. We show that with the ZF, MMSE and MMSE-DFE receivers, our proposed codes also achieve the full spatial diversity in the asynchronous scenario.