Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
Preprint
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.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Cooperative lattice coding and decoding in half-duplex channelsIEEE Journal on Selected Areas in Communications, 2007
- Capacity Bounds and Power Allocation for Wireless Relay ChannelsIEEE Transactions on Information Theory, 2005
- On the Capacity of Large Gaussian Relay NetworksIEEE Transactions on Information Theory, 2005
- Degraded Gaussian Multirelay Channel: Capacity and Optimal Power AllocationIEEE Transactions on Information Theory, 2004
- Fading Relay Channels: Performance Limits and Space–Time Signal DesignIEEE Journal on Selected Areas in Communications, 2004
- A Network Information Theory for Wireless Communication: Scaling Laws and Optimal OperationIEEE Transactions on Information Theory, 2004
- Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks2003
- User cooperation diversity-part I: system descriptionIEEE Transactions on Communications, 2003
- The capacity of the semideterministic relay channel (Corresp.)IEEE Transactions on Information Theory, 1982
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979