Skip to main content Accessibility help
  • Print publication year: 2008
  • Online publication date: July 2010

7 - Distributed space–time and space–frequency coding

from Part II - Cooperative communications


The main drawback of the multi-node decode-and-forward (DF) protocol and the multinode amplify-and-forward (AF) protocol, presented in Chapter 5, is the loss in the data rate as the number of relay nodes increases. The use of orthogonal sub channels for the relay node transmissions, either through TDMA or FDMA, results in a high loss of the system spectral efficiency. This leads to the use of what is known as distributed space–time coding (DSTC) and distributed space–frequency coding (DSFC), where relay nodes are allowed to simultaneously transmit over the same channel by emulating a space–time or a space–frequency code. The term distributed comes from the fact that the virtual multi-antenna transmitter is distributed between randomly located relay nodes. Employing DSTCs or DSFCs reduces the data rate loss due to relay nodes transmissions without sacrificing the system diversity order, as will be seen in this chapter.

Distributed space–time coding (DSTC)

In this section, the design of distributed space–time codes for wireless relay networks is considered. The two-hop relay network model depicted in Figure 7.1, where the system lacks a direct link from the source to destination node, is considered. Distributed space–time (space–frequency) coding can be achieved through node cooperation to emulate multiple antennas transmitter. First, the decode-and-forward protocol, in which each relay node decodes the symbols received from the source node before retransmission, is considered.