Nested Lattice Codes for Gaussian Relay Networks With Interference

DOI10.1109/TIT.2011.2170102MaRDI QIDQ5272196zbMATH OpenOpenAlexFDO

Authors

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0902.2436

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Linear codes (general theory) (94B05)

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.

Cited in

(4)

• Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis
• Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages
• Coarse Network Coding: A Simple Relay Strategy for Two-User Gaussian Interference Channels
• Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes

This page was built for publication: Nested Lattice Codes for Gaussian Relay Networks With Interference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272196)