Compute-and-Forward: Harnessing Interference Through Structured Codes

被引:650
作者
Nazer, Bobak [1 ]
Gastpar, Michael [2 ,3 ]
机构
[1] Boston Univ, Dept Elect & Comp Engn, Boston, MA 02215 USA
[2] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
[3] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland
基金
美国国家科学基金会; 欧洲研究理事会;
关键词
Additive white Gaussian noise (AWGN) networks; cooperative communication; interference; nested lattice codes; relaying; reliable computation; structured codes; CAPACITY THEOREMS; CHANNEL CAPACITY; RELAY NETWORKS; DIVERSITY; STRATEGIES; ALIGNMENT; LATTICES; FREEDOM; SUM;
D O I
10.1109/TIT.2011.2165816
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea is that relays should decode linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interference as noise. After decoding these linear equations, the relays simply send them towards the destinations, which given enough equations, can recover their desired messages. The underlying codes are based on nested lattices whose algebraic structure ensures that integer combinations of codewords can be decoded reliably. Encoders map messages from a finite field to a lattice and decoders recover equations of lattice points which are then mapped back to equations over the finite field. This scheme is applicable even if the transmitters lack channel state information.
引用
收藏
页码:6463 / 6486
页数:24
相关论文
共 76 条
  • [1] AGRAWAL S, 2009, P IEEE INT S INF THE
  • [2] GROUP CODES DO NOT ACHIEVE SHANNONS CHANNEL CAPACITY FOR GENERAL DISCRETE CHANNELS
    AHLSWEDE, R
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1971, 42 (01): : 224 - &
  • [3] Network information flow
    Ahlswede, R
    Cai, N
    Li, SYR
    Yeung, RW
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1204 - 1216
  • [4] Capacity of a Class of Modulo-Sum Relay Channels
    Aleksic, Marko
    Razaghi, Peyman
    Yu, Wei
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (03) : 921 - 930
  • [5] [Anonymous], 2006, Elements of Information Theory
  • [6] [Anonymous], PROOF EXISTENCE GOOD
  • [7] [Anonymous], P IEEE INT S INF THE
  • [8] Wireless Network Information Flow: A Deterministic Approach
    Avestimehr, A. Salman
    Diggavi, Suhas N.
    Tse, David N. C.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 1872 - 1905
  • [9] Amplify-and-forward in wireless relay networks: Rate, diversity, and network size
    Borade, Shashibhushan
    Zheng, Lizhong
    Gallager, Robert
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (10) : 3302 - 3318
  • [10] The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
    Bresler, Guy
    Parekh, Abhay
    Tse, David N. C.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) : 4566 - 4592