Generalized Degrees of Freedom of Noncoherent Diamond Networks

被引:2
|
作者
Sebastian, Joyson [1 ,2 ]
Diggavi, Suhas [1 ]
机构
[1] Univ Calif Los Angeles UCLA, Dept Elect & Comp Engn ECE, Los Angeles, CA 90095 USA
[2] Samsung, San Diego, CA 92126 USA
基金
美国国家科学基金会;
关键词
Noncoherent communication; degrees of freedom (DoF); relay channels; diamond network; time-varying channels; HIGH-SNR CAPACITY; INTERFERENCE CHANNEL; WIRELESS NETWORK; COMMUNICATION; BOUNDS;
D O I
10.1109/TIT.2020.2983169
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.
引用
收藏
页码:5228 / 5260
页数:33
相关论文
共 50 条
  • [31] On generalized degrees of freedom with application in linear mixed models selection
    You, Chong
    Mueller, Samuel
    Ormerod, John T.
    STATISTICS AND COMPUTING, 2016, 26 (1-2) : 199 - 210
  • [32] Generalized optical interferometry for modal analysis in arbitrary degrees of freedom
    Abouraddy, Ayman F.
    Yarnall, Timothy M.
    Saleh, Bahaa E. A.
    OPTICS LETTERS, 2012, 37 (14) : 2889 - 2891
  • [33] On the Generalized Degrees of Freedom of the MIMO Interference Channel With Delayed CSIT
    Mohanty, Kaniska
    Varanasi, Mahesh K.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (05) : 3261 - 3277
  • [34] On the Generalized Degrees on Freedom Region of the MIMO Interference Channel with No CSIT
    Vaze, Chinmay S.
    Karmakar, Sanjay
    Varanasi, Mahesh K.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 757 - 761
  • [35] A decomposition technique of generalized degrees of freedom for mixedmode crack problems
    Fan, Huo
    Zheng, Hong
    Li, Chunguang
    He, Siming
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2017, 112 (07) : 803 - 831
  • [36] Generalized Degrees of Freedom Region for MIMO Interference Channel with Feedback
    Ashraphijuo, Mehdi
    Aggarwal, Vaneet
    Wang, Xiaodong
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1779 - +
  • [37] On generalized degrees of freedom with application in linear mixed models selection
    Chong You
    Samuel Müller
    John T. Ormerod
    Statistics and Computing, 2016, 26 : 199 - 210
  • [38] Lattice Coding and the Generalized Degrees of Freedom of the Interference Channel with Relay
    Chaaban, Anas
    Sezgin, Aydin
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [39] The Generalized Degrees of Freedom of the Interference Relay Channel with Strong Interference
    Gherekhloo, Soheyl
    Chaaban, Anas
    Sezgin, Aydin
    2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 1321 - 1328
  • [40] The Achievable Generalized Degrees of Freedom of Interference Channel with Orthogonal Relay
    Zhao, Song
    Zhang, Tiankui
    Zeng, Zhimin
    2010 IEEE GLOBECOM WORKSHOPS, 2010, : 741 - 745