To Cooperate, or Not to Cooperate in Imperfectly-Known Fading Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

appeared at IEEE SPAWC 2008

Scientific paper

In this paper, communication over imperfectly-known fading channels with different degrees of cooperation is studied. The three-node relay channel is considered. 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 employed. For different cooperation protocols, achievable rate expressions are obtained. These achievable rate expressions are then used to find the optimal resource allocation strategies. In particular, the fraction of total time or bandwidth that needs to be allocated to the relay for best performance is identified. Under a total power constraint, optimal allocation of power between the source and relay is investigated. Finally, bit energy requirements in the low-power regime are studied.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

To Cooperate, or Not to Cooperate in Imperfectly-Known Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with To Cooperate, or Not to Cooperate in Imperfectly-Known Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and To Cooperate, or Not to Cooperate in Imperfectly-Known Fading Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-281305

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.