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 条
  • [51] Nazer B., IEEE T INF THE UNPUB
  • [52] NAZER B, 2009, P INT S INF THEOR IS
  • [53] NAZER B, 2008, P INT ZUR SEM COMM I
  • [54] The case for structured random codes in network capacity theorems
    Nazer, Bobak
    Gastpar, Michael
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2008, 19 (04): : 455 - 474
  • [55] Computation over multiple-access channels
    Nazer, Bobak
    Gastpar, Michael
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (10) : 3498 - 3516
  • [56] Local Interference Can Accelerate Gossip Algorithms
    Nazer, Bobak
    Dimakis, Alexandros G.
    Gastpar, Michael
    [J]. IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2011, 5 (04) : 876 - 887
  • [57] Reliable Physical Layer Network Coding
    Nazer, Bobak
    Gastpar, Michael
    [J]. PROCEEDINGS OF THE IEEE, 2011, 99 (03) : 438 - 460
  • [58] NIESEN U, 2011, IEEE T INF UNPUB JAN
  • [59] ORDENTLICH O, 2010, P 26 IEEE CONV EL EL
  • [60] Lattice Strategies for the Dirty Multiple Access Channel
    Philosof, Tal
    Zamir, Ram
    Erez, Uri
    Khisti, Ashish J.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) : 5006 - 5035