Distributed Space-Time Code for Amplify-and-Forward Cooperative Networks

2010 ◽  
Author(s):  
A. Y. Al-nahari ◽  
F. A. Abd El-Samie ◽  
M. I. Dessouky
Keyword(s):  
Cooperative Networks ◽  
Space Time ◽  
Amplify And Forward ◽  
Time Code

Multi-User Relaying of High-Rate Space–Time Code in Cooperative Networks

2009 ◽  
Vol 54 (1) ◽  
pp. 69-81 ◽  
Author(s):  
Manav R. Bhatnagar ◽  
M. K. Arti ◽  
Are Hjørungnes ◽  
Ranjan Bose ◽  
Lingyang Song
Keyword(s):  
Cooperative Networks ◽  
Space Time ◽  
High Rate ◽  
Time Code

Distributed Space-Time Block Coding for Amplify-and-Forward Cooperative Networks

2010 ◽  
pp. 238-659 ◽  
Author(s):  
Zhihang Yi ◽  
Il-Min Kim
Keyword(s):  
Upper Bound ◽  
Cooperative Networks ◽  
Block Codes ◽  
Space Time ◽  
Cooperative Network ◽  
Time Block ◽  
Amplify And Forward ◽  
Block Coding ◽  
Space Time Block Codes ◽  
Full Diversity

This chapter focuses on distributed space-time codes (DSTCs) in cooperative networks. DSTCs can substantially improve the bandwidth efficiency of the cooperative network without requiring any feedback overheads from the destination to the relays. The first part of this chapter is dedicated to reviewing the existing works on DSTCs. In the second part of this chapter, distributed orthogonal space-time block codes (DOSTBCs) are presented in detail. It is shown that the DOSTBCs can achieve the single-symbol maximum likelihood decodability and full diversity order in an amplify-and-forward cooperative network. Then some special DOSTBCs, which generate uncorrelated noises at the destination, are introduced. Those codes are referred to as the row-monomial DOSTBCs. An upper bound of the data-rate of the row-monomial DOSTBC is derived and the codes achieving the upper bound are presented as well.

Sign in / Sign up

Export Citation Format

Share Document