DMT of Multihop Networks: End Points and Computational Tools

Sreeram, K.; Birenjith, S.; Kumar, P. Vijay

doi:10.1109/tit.2011.2173243

Cited by 8 publications

(14 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In comparison to the strategies of [23,24], COSTBCs only achieve the maximum diversity gain and fall short of achieving the maximum multiplexing gain because of the use of OSTBCs. The decoding complexity of COSTBC, however, is significantly less (linear) than the strategies of [23,24] and makes COSTBCs amenable for practical implementation in comparison to [23,24], where STBCs with high decoding complexity are used. Thus, COSTBCs are well suited for relay-assisted communication where relays are used to improve the cell coverage, by improving reliability of the users at the cell edge, while requiring low decoding complexity.…”

Section: Comparison With Prior Workmentioning

confidence: 98%

“…COSTBCs, in comparison, achieve the maximum diversity gain with linear decoding complexity (similar to [14][15][16][17][18][19][20][21]) in a multi-hop network with multiple antenna equipped nodes, even though they do not have the single symbol decodable property. For the multi-hop network, the focus of [23,24] is on the construction of DSTBCs that can achieve the optimal diversity multiplexing tradeoff [29]. In comparison to the strategies of [23,24], COSTBCs only achieve the maximum diversity gain and fall short of achieving the maximum multiplexing gain because of the use of OSTBCs.…”

Section: Comparison With Prior Workmentioning

confidence: 99%

“…For the multi-hop network, the focus of [23,24] is on the construction of DSTBCs that can achieve the optimal diversity multiplexing tradeoff [29]. In comparison to the strategies of [23,24], COSTBCs only achieve the maximum diversity gain and fall short of achieving the maximum multiplexing gain because of the use of OSTBCs. The decoding complexity of COSTBC, however, is significantly less (linear) than the strategies of [23,24] and makes COSTBCs amenable for practical implementation in comparison to [23,24], where STBCs with high decoding complexity are used.…”

Section: Comparison With Prior Workmentioning

confidence: 99%

“…It is assumed that the relays do not generate their own data. Similar to the model considered in [23,24] we assume that any relay of relay stage n can only receive the signal from any relay of relay stage n − 1, i.e., we consider a directed multi-hop wireless network. This assumption is valid for the case when successive relay stages appear in increasing http://jwcn.eurasipjournals.com/content/2013/1/113…”

Section: System Modelmentioning

confidence: 99%

“…In prior work, maximum diversity gain achieving DSTBC constructions have been proposed for the twohop network [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21], and for the multi-hop network [22][23][24]. Even though these DSTBC constructions achieve the maximum diversity gain, the decoding complexity of most of them, except [14][15][16][17][18][19][20][21], is very high, thereby limiting their use in practical deployment.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Cascaded orthogonal space–time block codes for wireless multi-hop relay networks

Vaze

Heath

2013

J Wireless Com Network

View full text Add to dashboard Cite

Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This article proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with multiple antennas and each relay stage has one or more multiple antenna relays. Each relay stage is assumed to have receive channel state information (CSI) for all the channels from the source and all relays from previous stages to itself, while the destination is assumed to have receive CSI for all the channels. To construct the COSTBC, multiple orthogonal space-time block codes (OSTBCs) are used in cascade by the source and each relay stages. In the COSTBC, each relay stage separates the constellation symbols of the OSTBC sent by the preceding relay stage using its CSI, and then transmits another OSTBC to the next relay stage. COSTBCs are shown to achieve the maximum diversity gain in a multi-hop wireless network with linear decoding complexity thanks to the connection to OSTBCs. Several explicit constructions of COSTBCs are also provided, and their performance is simulated in different relay configurations.

show abstract

Section: Comparison With Prior Workmentioning

confidence: 98%