Approximate Capacity of Gaussian Relay Networks

Abstract

We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant depends on the topology of the network, but not the values of the channel gains. Therefore, we uniformly characterize the capacity of Gaussian relay networks within a constant number of bits, for all channel parameters.

This paper is submited to 2008 IEEE International Symposium on Information Theory (ISIT 2008) -In the revised format the approximation gap (κ) is sharpened

References in corpus (2)

• A Deterministic Approach to Wireless Relay Networks
• Wireless Network Information Flow

Cited by in corpus (28)

• Wireless Network Information Flow: A Deterministic Approach
• Nested Lattice Codes for Gaussian Relay Networks with Interference
• Divide-and-conquer: Approaching the capacity of the two-pair bidirectional Gaussian relay network
• Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints
• Capacity region of the deterministic multi-pair bi-directional relay network
• Slepian-Wolf Coding Over Cooperative Relay Networks
• DMT of Multi-hop Cooperative Networks - Part I: Basic Results
• Cooperative Multiplexing in the Multiple Antenna Half Duplex Relay Channel
• A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model
• Approximate capacity of the two-way relay channel: A deterministic approach
• A Theory of Network Equivalence, Parts I and II
• A New Achievable Rate for the Gaussian Parallel Relay Channel
• Transmission Techniques for Relay-Interference Networks
• Diversity-Multiplexing Tradeoff of the Half-Duplex Relay Channel
• Efficient Capacity Computation and Power Optimization for Relay Networks
• Capacity of a Class of Linear Binary Field Multi-source Relay Networks
• Deterministic Relay Networks with State Information
• Multiplexing Gain of Amplify-Forward Relaying in Wireless Multi-Antenna Relay Networks
• On Models of Multi-user Gaussian Channels with Fading
• On Source-Channel Separation in Networks
• A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks
• Diversity-Multiplexing Tradeoff in Multi-Antenna Multi-Relay Networks: Improvements and Some Optimality Results
• On the Capacity of Gaussian Relay Channels
• Pipelined Encoding for Deterministic and Noisy Relay Networks
• Near-optimal quantization and linear network coding for relay networks
• Cooperative Transmission for a Vector Gaussian Parallel Relay Network
• Slepian-Wolf Coding over Cooperative Networks
• Degrees of Freedom Region of a Class of Multi-source Gaussian Relay Networks