Achievable Rates over Doubly Selective Rician-Fading Channels under Peak-Power Constraint

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

paper withdrawn

Scientific paper

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are finite and the peak-power limitation is applied in the time domain. Expression for this rate is based on a lower bound on mutual information that assume independent and identically distributed input data symbols. The lower bound is expressed as a difference of two terms. The first term is the information rate of the coherent channel with a weighted signal-to-noise ratio that results from the peak-power limitation. The second term is a penalty term, explicit in the Doppler spectrum of the channel, that captures the effect of the channel uncertainty induced by the noncoherent setting. Impact of channel parameters, such as delay and Doppler spread, on the information rate are discussed and numerical applications on an experimental Rician channel surveyed in an acoustic underwater environment are also 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 over Doubly Selective Rician-Fading Channels under Peak-Power Constraint 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 over Doubly Selective Rician-Fading Channels under Peak-Power Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable Rates over Doubly Selective Rician-Fading Channels under Peak-Power Constraint will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-298777

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