By Topic

Bounded Delay-Tolerant Space Time Block Codes for 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
$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

3 Author(s)
Nahas, M. ; Orange Labs., Issy-les-Moulineaux, France ; Saadani, A. ; Othman, G.R.-B.

When distributed cooperative nodes are communicating with a destination, the received signal can be asynchronous due to the propagation or processing delays. This can destroy the space time block code properties designed initially for synchronous case. In this paper, a new construction method of bounded delay tolerant codes is presented. These new codes preserve the full diversity with optimal rates if the relative delays are in a designed delay tolerance interval. The general design method is based on the concatenation and permutation of optimal synchronous space time block codes and works for an arbitrary number of transmitting and receiving antennas. Examples of bounded delay tolerant codes based on the Alamouti code, the Golden code and Threaded Algebraic Space-Time (TAST) codes are given. Theoretical proofs are used to show that the new codes respect the design criteria. Simulation results manifest better error rate performance of the new codes compared to other known delay tolerant codes.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:10 ,  Issue: 10 )