Achievable rates for network coding on the exchange channel

被引:0
|
作者
Hao, Yonggang [1 ]
Goeckel, Dennis [1 ]
Ding, Zhiguo [2 ]
Towsley, Don [3 ]
Leung, Kin K. [2 ]
机构
[1] Univ Massachusetts, Dept Elect & Comp Engn, Amherst, MA 01003 USA
[2] Imperial Coll, Dept Elect & Elect Engn, London SW7 2AZ, England
[3] Univ Massachusetts, Dept Comp Sci, Amherst, MA 01003 USA
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Network coding, where relay nodes combine the information received from multiple links rather than simply replicating and forwarding the received packets, has shown the promise of significantly improving system performance. In very recent works, multiple researchers have presented methods for increasing system throughput by employing network coding inspired methods to mix packets at the physical layer: physical-layer network coding (PNC). A common example used to validate much of this work is that of two sources exchanging information through a single intervening relay - a situation that we denote the "exchange channel". In this paper, achievable rates of various schemes on the exchange channel are considered. Achievable rates for traditional multihop routing approaches, network coding approaches, and various PNC approaches are considered. A new method of PNC inspired by Tomlinson-Harashima precoding (THP), where a modulo operation is used to control the power at the relay, is introduced, and shown to have a slight advantage over analogous schemes at high signal-to-noise ratios (SNRs).
引用
收藏
页码:2621 / +
页数:2
相关论文
共 50 条
  • [1] Bounds on achievable rates for cooperative channel coding
    Pandya, A
    Pottie, G
    [J]. CONFERENCE RECORD OF THE THIRTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 2004, : 1077 - 1081
  • [2] Achievable Secrecy Rates for Relay-Eavesdropper Channel Based on the Application of Noisy Network Coding
    Xu, Peng
    Ding, Zhiguo
    Dai, Xuchu
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2018, 13 (07) : 1736 - 1751
  • [3] Achievable Second-Order Coding Rates for the Wiretap Channel
    Tan, Vincent Y. F.
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (IEEE ICCS 2012), 2012, : 65 - 69
  • [4] On Achievable Rates of Line Networks With Generalized Batched Network Coding
    Wang, Jie
    Yang, Shenghao
    Dong, Yanyan
    Zhang, Yiheng
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2024, 42 (05) : 1316 - 1328
  • [5] BOUNDS ON ACHIEVABLE RATES OF BLOCK CODING FOR A MEMORYLESS MULTIPLE-ACCESS CHANNEL
    KASAMI, T
    LIN, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (02) : 187 - 197
  • [6] Achievable Rates for the Broadcast Channel with Feedback
    Venkataramanan, Ramji
    Pradhan, S. Sandeep
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 455 - 459
  • [7] On Achievable Rates for the General Relay Channel
    Chong, Hon-Fah
    Motani, Mehul
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (03) : 1249 - 1266
  • [8] Achievable rates for the Gaussian quantum channel
    Harrington, J
    Preskill, J
    [J]. PHYSICAL REVIEW A, 2001, 64 (06) : 10
  • [9] Achievable rates for the Gaussian quantum channel
    Harrington, Jim
    Preskill, John
    [J]. Physical Review A. Atomic, Molecular, and Optical Physics, 2001, 64 (06): : 1 - 062301
  • [10] Multiterminal source coding achievable rates and reliability
    Haroutunian, EA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) : 2094 - 2101