Achievable Rates and Training Optimization for Fading Relay Channels with Memory

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

appeared at CISS 2008

Scientific paper

In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission takes place in two phases: network training phase and data transmission phase. In the training phase, pilot symbols are sent and the receivers employ single-pilot MMSE estimation or noncausal Wiener filter to learn the channel. Amplify-and-Forward (AF) and Decode-and-Forward (DF) techniques are considered in the data transmission phase and achievable rate expressions are obtained. The training period, and data and training power allocations are jointly optimized by using the achievable rate expressions. Numerical results are obtained considering Gauss-Markov and lowpass fading models. Achievable rates are computed and energy-per-bit requirements are investigated. The optimal power distributions among pilot and data symbols are provided.

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

Achievable Rates and Training Optimization for Fading Relay Channels with Memory 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 Achievable Rates and Training Optimization for Fading Relay Channels with Memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable Rates and Training Optimization for Fading Relay Channels with Memory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-281390

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