Computer Science – Information Theory
Scientific paper
2010-12-02
Computer Science
Information Theory
(updated to include generalization to networks with multiple sources and to broadcast network; submitted to IEEE transactions
Scientific paper
We study a wireless relay network, with a single source and a single destination. Our main result is to show that an appropriate compress-and-forward scheme supports essentially the same reliable data rate as the quantize-map-and-forward and noisy network coding schemes; thus, it is approximately optimal -- in the sense the data rate is a universal constant away from the cut-set upper bound. We characterize the compress-and-forward scheme through an abstract flow formulation, a generalization of flow on linking systems. This characterization allows for efficient computation of the minimal amount of information that has to flow through each node in the network. We also generalize these results to the network with multiple sources with independent messages intended for a single destination; and to the broadcast network with a single source intending to communicate independent messages to multiple destinations.
Raja Adnan
Viswanath Pramod
No associations
LandOfFree
Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows 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 Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-603652