Low-Complexity Near-Optimal Codes for Gaussian Relay Networks

The authors consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr et al., they propose network codes that achieve up to a constant gap from the capacity of such networks. However, their proposed codes are also computationally tractable. Their main technique is to use the codes of Avestimehr et al. as inner codes in a concatenated coding scheme. The recent work of parallels the classical network coding results for wireless networks. That is, it introduces a quantize-map-and-forward scheme that achieves all rates up to a constant gap to the capacity of Gaussian relay networks, where this constant depends only on the network size, and varies linearly with it.

Provided by: Chinese University of Hong Kong Topic: Mobility Date Added: Jul 2011 Format: PDF

Find By Topic