Distributed space-time block coding

Abstract

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 N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> . It is shown that existing STBCs designed for N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> 2 co-located antennas are favorable choices for the code matrix, guaranteeing a diversity order of d=min{N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> ,N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> } if N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> nodes are active. For the most interesting case, N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> gesN <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> , 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