On Noisy Network Coding for a Gaussian Relay Chain Network with Correlated Noises

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Proc. of CWIT '11

Scientific paper

Noisy network coding, which elegantly combines the conventional compress-and-forward relaying strategy and ideas from network coding, has recently drawn much attention for its simplicity and optimality in achieving to within constant gap of the capacity of the multisource multicast Gaussian network. The constant-gap result, however, applies only to Gaussian relay networks with independent noises. This paper investigates the application of noisy network coding to networks with correlated noises. By focusing on a four-node Gaussian relay chain network with a particular noise correlation structure, it is shown that noisy network coding can no longer achieve to within constant gap to capacity with the choice of Gaussian inputs and Gaussian quantization. The cut-set bound of the relay chain network in this particular case, however, can be achieved to within half a bit by a simple concatenation of a correlation-aware noisy network coding strategy and a decode-and-forward scheme.

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

On Noisy Network Coding for a Gaussian Relay Chain Network with Correlated Noises 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 On Noisy Network Coding for a Gaussian Relay Chain Network with Correlated Noises, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Noisy Network Coding for a Gaussian Relay Chain Network with Correlated Noises will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-526304

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