Near-Optimal Quantization and Linear Network Coding for Relay Networks

被引:3
|
作者
Muralidhar, Anand [1 ]
Kumar, P. R. [2 ]
机构
[1] Alcatel Lucent Bell Labs, Bengaluru 560045, India
[2] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77840 USA
基金
美国国家科学基金会;
关键词
Deterministic models; discrete superposition model; network coding; relay networks;
D O I
10.1109/TIT.2012.2235906
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce a discrete network corresponding to any Gaussian wireless network that is obtained by simply quantizing the received signals and restricting the transmitted signals to a finite precision. Since signals in the discrete network are obtained from those of a Gaussian network, the Gaussian network can be operated on the quantization-based digital interface defined by the discrete network. We prove that this digital interface is near optimal for Gaussian relay networks and the capacities of the Gaussian and the discrete networks are within a bounded gap of O(M-2) bits, where M is the number of nodes. We also prove that any near-optimal coding strategy for the discrete network can be naturally transformed into a near-optimal coding strategy for the Gaussian network merely by quantization. We exploit this property by designing a linear coding strategy for the case of layered discrete relay networks. The linear coding strategy is near optimal and achieves all rates within O(M-2) bits of the capacity, independent of channel gains or signal-to-noise ratio. The linear code is therefore a near-optimal strategy for layered Gaussian relay networks and can be used as on the Gaussian network after simply quantizing the signals. The relays in the linear code need not know the channel gains on either the incoming or the outgoing links. The transmit and receive signals at all relays are simply quantized to binary tuples of the same length n, which is all that the nodes need to know. The linear network code is a particularly simple scheme and requires all the relay nodes to collect the received binary tuples into a long binary vector and apply a linear transformation on the long vector. The resulting binary vector is split into smaller binary tuples for transmission by the relays. The quantization requirements of the linear network code are completely defined by the parameter n, which therefore also determines the resolution of the analog-to-digital and digital-to-analog converters that are required for operating the network within a bounded gap of the network's capacity. As evident from the description, the linear network code explicitly connects network coding for wireline networks with codes for Gaussian networks.
引用
收藏
页码:2777 / 2793
页数:17
相关论文
共 50 条
  • [1] Network Coding for Wireless Cooperative Networks: Simple Rules, Near-optimal Delay
    Khamfroush, Hana
    Lucani, Daniel E.
    Barros, Joao
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC), 2014, : 255 - 260
  • [2] Fast near-optimal subnetwork selection in layered relay networks
    Kolte, Ritesh
    Ozgur, Ayfer
    [J]. 2014 52ND ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2014, : 1238 - 1245
  • [3] Near-Optimal Relay Station Placement for Power Minimization in WiMAX Networks
    Yang, Dejun
    Fang, Xi
    Xue, Guoliang
    [J]. 2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [4] On the Performance of Random Linear Network Coding in Relay Networks
    Khalili, Ramin
    Ghaderi, Majid
    Kurose, Jim
    Towsley, Don
    [J]. 2008 IEEE MILITARY COMMUNICATIONS CONFERENCE: MILCOM 2008, VOLS 1-7, 2008, : 432 - +
  • [5] Near-Optimal Joint Antenna Selection for Amplify-and-Forward Relay Networks
    Zhang, Yangyang
    Zheng, Gan
    Ji, Chunlin
    Wong, Kai-Kit
    Edwards, David J.
    Cui, Tiejun
    [J]. 2009 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP 2009), 2009, : 482 - +
  • [6] Near-Optimal Joint Antenna Selection for Amplify-and-Forward Relay Networks
    Zhang, Yangyang
    Zheng, Gan
    Ji, Chunlin
    Wong, Kai-Kit
    Edwards, David J.
    Cui, Tiejun
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2010, 9 (08) : 2401 - 2407
  • [7] Reliability of Relay Networks Under Random Linear Network Coding
    Tsimbal, Evgeny
    Sandell, Magnus
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (08) : 5230 - 5240
  • [8] Near-Optimal Quantization for LoS MIMO with QPSK Modulation
    Sezer, Ahmet Dundar
    Madhow, Upamanyu
    [J]. CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2019, : 1015 - 1020
  • [9] Near-Optimal Coding for Massive Multiple Access
    Hsieh, Kuan
    Rush, Cynthia
    Venkataramanan, Ramji
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2471 - 2476
  • [10] Near-Optimal One-Sided Scheduling for Coded Segmented Network Coding
    Tang, Bin
    Yang, Shenghao
    Ye, Baoliu
    Guo, Song
    Lu, Sanglu
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (03) : 929 - 939