Nested Lattice Codes for Gaussian Relay Networks With Interference

Cited 35 time in webofscience Cited 0 time in scopus
  • Hit : 563
  • Download : 0
In this paper, we consider a class of single-source multicast relay networks. We assume that all outgoing channels of a node in the network to its neighbors are orthogonal while the incoming signals from its neighbors can interfere with each other. We first focus on Gaussian relay networks with interference and find an achievable rate using a lattice coding scheme. We show that the achievable rate of our scheme is within a constant bit gap from the information theoretic cut-set bound, where the constant depends only on the network topology, but not on the transmit power, noise variance, and channel gains. This is similar to a recent result by Avestimehr, Diggavi, and Tse, who showed an approximate capacity characterization for general Gaussian relay networks. However, our achievability uses a structured code instead of a random one. Using the idea used in the Gaussian case, we also consider a linear finite-field symmetric network with interference and characterize its capacity using a linear coding scheme.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2011-12
Language
English
Article Type
Article
Keywords

CAPACITY THEOREMS; INFORMATION-FLOW; CHANNELS

Citation

IEEE TRANSACTIONS ON INFORMATION THEORY, v.57, no.12, pp.7733 - 7745

ISSN
0018-9448
DOI
10.1109/TIT.2011.2170102
URI
http://hdl.handle.net/10203/102597
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 35 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0