2000 character limit reached
Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels
Published 8 May 2007 in cs.IT and math.IT | (0705.1151v1)
Abstract: In this paper, achievable rates of imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective channels. In the data transmission phase, amplify-and-forward and decode-and-forward relaying schemes are considered, and the corresponding achievable rate expressions are obtained. The achievable rate expressions are then employed to identify the optimal resource allocation strategies.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.