• DocumentCode
    3604917
  • Title

    Capacity Bounds for a Class of Diamond Networks With Conferencing Relays

  • Author

    Wanyao Zhao ; Ding, David Yiwei ; Khisti, Ashish

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada
  • Volume
    19
  • Issue
    11
  • fYear
    2015
  • Firstpage
    1881
  • Lastpage
    1884
  • Abstract
    Diamond channels can model modern wireless communication infrastructure that use relays to increase network capacity. This letter investigates the effect of conferencing between the relays in a particular class of diamond networks with source-to-relay and conferencing channels modeled as noiseless bit-pipes of given capacities. A lower bound to the capacity for this network and an upper bound that is tighter than the cut-set bound are presented. Such networks with specific multiple access channel (MAC) types are studied and the minimum conferencing link capacity needed to achieve full cooperation for each MAC is ascertained. It is found that such minimum conferencing link capacity for the Gaussian MAC must be equal to the difference between the full cooperation capacity and the backhaul capacity. However, such a result does not hold in general as the binary adder MAC illustrates a counterexample.
  • Keywords
    access protocols; relay networks (telecommunication); Gaussian MAC; MAC; backhaul capacity; capacity bounds; conferencing channels; conferencing relays; cooperation capacity; diamond channels; diamond networks; multiple access channel; network capacity; noiseless bit-pipes; source-to-relay; wireless communication; Adders; Diamonds; Encoding; Relays; Tin; Upper bound; Wireless communication; Diamond channel; Marton’s coding; Marton´s coding; conferencing relays; rate-splitting;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2015.2472531
  • Filename
    7222393