By Topic

Distributed space-time block coding

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 $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)
Yiu, S. ; Dept. of Electr. & Comput. Eng., British Columbia Univ., Vancouver, BC ; Schober, R. ; Lampe, L.

In this paper, a new class of distributed space-time block codes (DSTBCs) is introduced. These DSTBCs are designed for wireless networks which have a large set of single-antenna relay nodes Nscr, but at any given time only a small, a priori unknown subset of nodes SsubeNscr can be active. In the proposed scheme, the signal transmitted by an active relay node is the product of an information-carrying code matrix and a unique node signature vector of length Nc. It is shown that existing STBCs designed for Nc2 co-located antennas are favorable choices for the code matrix, guaranteeing a diversity order of d=min{NS,Nc} if NS nodes are active. For the most interesting case, NSgesNc, the performance loss entailed by the distributed implementation is analytically characterized. Furthermore, efficient methods for the optimization of the set of signature vectors are provided. Depending on the chosen design, the proposed DSTBCs allow for low-complexity coherent, differential, and noncoherent detection, respectively. Possible applications include ad hoc and sensor networks employing decode-and-forward relaying

Published in:

Communications, IEEE Transactions on  (Volume:54 ,  Issue: 7 )