By Topic

Diversity analysis of distributed linear convolutive space-time codes for time-frequency asynchronous cooperative 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
$31 $31
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

5 Author(s)
Yi Liu ; State Key Lab. of Integrated Service Network, Xidian Univ., Xi'an, China ; Yongzhao Li ; Danping Li ; Qi Ma
more authors

This study analyses the achievable cooperative diversity order of the distributed linear convolutional space-time coding (DLC-STC) scheme for time-frequency asynchronous cooperative networks. The authors first prove that perfect time or frequency synchronisation is impractical for cooperative networks with multiple relays serving multiple destinations even when the relays know all accurate time delays and frequency offsets. Then the DLC-STC scheme, in which the exact time synchronisation at the relay nodes is unnecessary, is introduced into this type of cooperative networks. This study proves that the achievable time-frequency asynchronous cooperative diversity order of the DLC-STC scheme with maximum-likelihood receivers is equal to the number of relays. Simulation results verify the analysis.

Published in:

Communications, IET  (Volume:8 ,  Issue: 5 )