Capacity Bounds and Power Allocation for Wireless Relay Channels

DOI10.1109/TIT.2005.847703zbMATH Open1309.94008OpenAlexW2121916661MaRDI QIDQ3547019FDOQ3547019

Authors: Anders Høst-Madsen, Junshan Zhang 

Publication date: 21 December 2008

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

Full work available at URL: https://doi.org/10.1109/tit.2005.847703

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Cited In (7)

• Optimum number of hops in linear multihop wireless networks
• Capacity bounds and mapping design for binary symmetric relay channels
• NAF, OAF, or noncooperation: which protocol to choose?
• Cooperative multiple access channels: achievable rates and optimal resource allocation
• Power allocation strategies for distributed space-time codes in amplify-and-forward mode
• Optimal relay assignment and power allocation for cooperative communications
• Machine learning and optimization algorithms in applied problems of wireless cellular communications

This page was built for publication: Capacity Bounds and Power Allocation for Wireless Relay Channels

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