• DocumentCode
    2647573
  • Title

    On approximating Gaussian relay networks with deterministic networks

  • Author

    Anand, M. ; Kumar, P.R.

  • Author_Institution
    Dept. of ECE, Univ. of Illinois, Urbana, IL, USA
  • fYear
    2009
  • fDate
    11-16 Oct. 2009
  • Firstpage
    625
  • Lastpage
    629
  • Abstract
    We examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons are that the linear deterministic model fails to capture the phase of received signals, and there is a loss in signal strength in the reduction to a linear deterministic network. On the positive side, Gaussian relay networks are indeed well approximated by certain discrete superposition networks, where the inputs and outputs to the channels are discrete, and channel gains are signed integers. As a corollary, MIMO channels cannot be approximated by the linear deterministic model but can be by the discrete superposition model.
  • Keywords
    Gaussian channels; MIMO communication; approximation theory; radio networks; wireless channels; Gaussian relay network approximation; MIMO channel; discrete superposition network; linear deterministic network; signal strength; Conferences; Gaussian noise; Information theory; Linear approximation; MIMO; Proposals; Relays; USA Councils; Vectors; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2009. ITW 2009. IEEE
  • Conference_Location
    Taormina
  • Print_ISBN
    978-1-4244-4982-8
  • Electronic_ISBN
    978-1-4244-4983-5
  • Type

    conf

  • DOI
    10.1109/ITW.2009.5351179
  • Filename
    5351179