A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

2011 IEEE International Symposium on Information Theory (ISIT 2011)

Scientific paper

In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide the transmission of each block into 3 time slots with variable durations. Cooperation is performed by partial decodeforward relaying over these 3 time slots. During the first two time slots, each user alternatively transmits and decodes, while during the last time slot, both users cooperate to send information to the destination. An achievable rate region for this scheme is derived using superposition encoding and joint maximum likelihood (ML) decoding across the 3 time slots. An example of the Gaussian channel is treated in detail and its achievable rate region is given explicitly. Results show that the proposed half-duplex scheme achieves significantly larger rate region than the classical multiple access channel and approaches the performance of a full-duplex cooperative scheme as the inter-user channel quality increases.

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

A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying 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 A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-495620

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