Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution

DOI10.1109/TIT.2007.904996MaRDI QIDQ3549069zbMATH OpenOpenAlexFDO

Authors Yingbin Liang, H. Vincent Poor, Venugopal V. Veeravalli

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0707.0969

Communication theory (94A05) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Abstract: As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the capacity is established, and is further demonstrated via the Gaussian case, for which the synchronized and asynchronized capacities are obtained. The capacity achieving power allocation at the source and relay nodes among the subchannels is characterized. The fading relay channel is then studied, for which resource allocations that maximize the achievable rates are obtained for both the full-duplex and half-duplex cases. Capacities are established for fading relay channels that satisfy certain conditions.

This page was built for publication: Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549069)