Multilevel Coding over Two-Hop Single-User Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages, 7 figures, Submitted to IEEE Transactions on Information Theory on April 6, 2009

Scientific paper

In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with a single antenna and the Channel State Information (CSI) of each hop is not available at the corresponding transmitter. The relay is assumed to be simple, i.e., not capable of data buffering over multiple coding blocks, water-filling over time, or rescheduling. A commonly used design criterion in such configurations is the maximization of the average received rate at the destination. We show that using a continuum of multilevel codes at both the source and the relay, in conjunction with decode and forward strategy at the relay, performs optimum in this setup. In addition, we present a scheme to optimally allocate the available source and relay powers to different levels of their corresponding codes. The performance of this scheme is evaluated assuming Rayleigh fading and compared with the previously known strategies.

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

Multilevel Coding over Two-Hop Single-User Networks 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 Multilevel Coding over Two-Hop Single-User Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multilevel Coding over Two-Hop Single-User Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-523409

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