Computer Science – Information Theory
Scientific paper
2009-04-06
Computer Science
Information Theory
Accepted for publication in proceedings of ITW 09, Taormina, Sicily. Corrected typos, added references, changed name of networ
Scientific paper
We examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons are that the linear deterministic model fails to capture the phase of received signals, and there is a loss in signal strength in the reduction to a linear deterministic network. On the positive side, Gaussian relay networks are indeed well approximated by certain discrete superposition networks, where the inputs and outputs to the channels are discrete, and channel gains are signed integers. As a corollary, MIMO channels cannot be approximated by the linear deterministic model but can be by the discrete superposition model.
Anand Mahesh
Kumar Ravi P.
No associations
LandOfFree
On approximating Gaussian relay networks by deterministic 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 On approximating Gaussian relay networks by deterministic networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On approximating Gaussian relay networks by deterministic networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-132740