Pragmatic Space-Time Codes for Cooperative Relaying in Block Fading Channels
We address the problem of construction of space-time codes for cooperative communications in block fading channels. More precisely, we consider a pragmatic approach based on the concatenation of convolutional codes and BPSK/QPSK modulation to obtain cooperative codes for relay networks, for which we...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2008-09-01
|
| Series: | EURASIP Journal on Advances in Signal Processing |
| Online Access: | http://dx.doi.org/10.1155/2008/872151 |
| Summary: | We address the problem of construction of space-time codes for cooperative communications in block fading channels. More precisely, we consider a pragmatic approach based on the concatenation of convolutional codes and BPSK/QPSK modulation to obtain cooperative codes for relay networks, for which we derive the pairwise error probability, an asymptotic bound for frame error probability, and a design criterion to optimize both diversity and coding gain. Based on this framework, we set up a code search procedure to obtain a set of good pragmatic space-time codes (P-STCs) with overlay construction, suitable for cooperative communication with a variable number of relays in quasistatic channel, which outperform in terms of coding gain other space-time codes (STCs) proposed in the literature. We also find that, despite the fact that the implementation of pragmatic space-time codes requires standard convolutional encoders and Viterbi decoders with suitable generators and branch metric, thus having low complexity, they perform quite well in block fading channels, including quasistatic channel, even with a low number of states and relays. |
|---|---|
| ISSN: | 1687-6172 1687-6180 |