Nested Lattice Codes for Gaussian Relay Networks with Interference

Abstract

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast capacity of these networks. As a subclass, we first focus on Gaussian relay networks with interference and find an achievable rate using a lattice coding scheme. It is shown that there is a constant gap between our achievable rate and the information theoretic cut-set bound. This is similar to the recent result by Avestimehr, Diggavi, and Tse, who showed such an approximate characterization of the capacity of general Gaussian relay networks. However, our achievability uses a structured code instead of a random one. Using the same idea used in the Gaussian case, we also consider linear finite-field symmetric networks with interference and characterize the capacity using a linear coding scheme.

23 pages, 5 figures, submitted to IEEE Transactions on Information Theory

References in corpus (2)

• Wireless Network Information Flow: A Deterministic Approach
• The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels

Cited by in corpus (20)

• The Capacity Region of Multiway Relay Channels Over Finite Fields with Full Data Exchange
• Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations
• Gaussian Multiple Access via Compute-and-Forward
• Reliable Physical Layer Network Coding
• Compute-Compress-and-Forward: Exploiting Asymmetry of Wireless Relay Networks
• Lattice Coding for the Two-way Two-relay Channel
• Compute-and-Forward: Harnessing Interference through Structured Codes
• Eigen-Direction Alignment Based Physical-Layer Network Coding for MIMO Two-Way Relay Channels
• Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages
• Nested Lattice Codes for Gaussian Two-Way Relay Channels
• Computation Alignment: Capacity Approximation without Noise Accumulation
• List decoding for nested lattices and applications to relay channels
• Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
• Cooperative Compute-and-Forward
• Computation Over Gaussian Networks With Orthogonal Components
• A Novel User Pairing Scheme for Functional Decode-and-Forward Multi-way Relay Network
• A Lattice Compress-and-Forward Scheme
• Approximate Capacity of a Class of Partially Connected Interference Channels
• Generalized Compute-Compress-and-Forward
• Structured interference-mitigation in two-hop networks