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

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

Zhihang Yi (Queen’s University, Canada) and Il-Min Kim (Queen’s University, Canada)
DOI: 10.4018/978-1-60566-665-5.ch008
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

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.
Chapter Preview
Top

Background

In this section, we will first review some fundamental works on cooperative networks. After that, we will present the existing works on DSTCs.

Complete Chapter List

Search this Book:
Reset