### Abstract

We study precoding for the outage probability minimization of block fading (BF) channels and BF relay channels. Recently, an upper bound on the outage probability with precoding was established for BF channels, but only for high instantaneous SNR. This upper bound is much easier to minimize than the actual outage probability, so that optimal precoding matrices can be determined without much computational effort. Here, we provide a proof for the upper bound on the outage probability at low instantaneous SNR. Next, the structure of the precoding matrix is simplified so that it can be easily constructed for an arbitrary number of blocks in the BF channel. Finally, we apply this technique to cooperative communications.

Original language | English |
---|---|

Title of host publication | 2011 IEEE Information Theory Workshop, ITW 2011 |

Pages | 355-359 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 21 Dec 2011 |

Event | 2011 IEEE Information Theory Workshop, ITW 2011 - Paraty, Brazil Duration: 16 Oct 2011 → 20 Oct 2011 |

### Other

Other | 2011 IEEE Information Theory Workshop, ITW 2011 |
---|---|

Country | Brazil |

City | Paraty |

Period | 16/10/11 → 20/10/11 |

### Fingerprint

### ASJC Scopus subject areas

- Information Systems

### Cite this

*2011 IEEE Information Theory Workshop, ITW 2011*(pp. 355-359). [6089478] https://doi.org/10.1109/ITW.2011.6089478

**Precoding for coded communication on block fading channels and cooperative communications.** / Duyck, Dieter; Boutros, Joseph; Moeneclaey, Marc.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2011 IEEE Information Theory Workshop, ITW 2011.*, 6089478, pp. 355-359, 2011 IEEE Information Theory Workshop, ITW 2011, Paraty, Brazil, 16/10/11. https://doi.org/10.1109/ITW.2011.6089478

}

TY - GEN

T1 - Precoding for coded communication on block fading channels and cooperative communications

AU - Duyck, Dieter

AU - Boutros, Joseph

AU - Moeneclaey, Marc

PY - 2011/12/21

Y1 - 2011/12/21

N2 - We study precoding for the outage probability minimization of block fading (BF) channels and BF relay channels. Recently, an upper bound on the outage probability with precoding was established for BF channels, but only for high instantaneous SNR. This upper bound is much easier to minimize than the actual outage probability, so that optimal precoding matrices can be determined without much computational effort. Here, we provide a proof for the upper bound on the outage probability at low instantaneous SNR. Next, the structure of the precoding matrix is simplified so that it can be easily constructed for an arbitrary number of blocks in the BF channel. Finally, we apply this technique to cooperative communications.

AB - We study precoding for the outage probability minimization of block fading (BF) channels and BF relay channels. Recently, an upper bound on the outage probability with precoding was established for BF channels, but only for high instantaneous SNR. This upper bound is much easier to minimize than the actual outage probability, so that optimal precoding matrices can be determined without much computational effort. Here, we provide a proof for the upper bound on the outage probability at low instantaneous SNR. Next, the structure of the precoding matrix is simplified so that it can be easily constructed for an arbitrary number of blocks in the BF channel. Finally, we apply this technique to cooperative communications.

UR - http://www.scopus.com/inward/record.url?scp=83655164954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83655164954&partnerID=8YFLogxK

U2 - 10.1109/ITW.2011.6089478

DO - 10.1109/ITW.2011.6089478

M3 - Conference contribution

AN - SCOPUS:83655164954

SN - 9781457704376

SP - 355

EP - 359

BT - 2011 IEEE Information Theory Workshop, ITW 2011

ER -