• DocumentCode
    616980
  • Title

    On computing half-duplex relaying capacity in networks with orthogonal channels

  • Author

    Parvaresh, Farzad ; Etkin, Raul ; Shomorony, Ilan ; Avestimehr, Amir Salman

  • Author_Institution
    Dept. of Electr. Eng., Univ. of Isfahan, Isfahan, Iran
  • fYear
    2013
  • fDate
    8-9 May 2013
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    We consider computing the capacity of half-duplex relay networks with orthogonal channels. In such networks, if the network has a layered structure, we show that the capacity can be computed in polynomial using the ellipsoid method. Moreover, for networks with local connectivity, such that the connectivity radius is a constant independent of size of the network, a polynomial time algorithm is presented to compute the capacity.
  • Keywords
    communication complexity; relay networks (telecommunication); telecommunication channels; connectivity radius; ellipsoid method; half-duplex relay networks; half-duplex relaying capacity; layered structure; local connectivity; orthogonal channels; polynomial time algorithm; Approximation methods; Ellipsoids; Optimization; Polynomials; Relays; Upper bound; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication and Information Theory (IWCIT), 2013 Iran Workshop on
  • Conference_Location
    Tehran
  • Print_ISBN
    978-1-4673-5020-4
  • Type

    conf

  • DOI
    10.1109/IWCIT.2013.6555774
  • Filename
    6555774