By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaoyong Guo ; Dept. of Electr. & Comput. Eng., Univ. of Delaware, Newark, DE ; Xiang-gen Xia

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.

Published in:

IEEE Transactions on Wireless Communications  (Volume:7 ,  Issue: 5 )