• DocumentCode
    2453729
  • Title

    Equivalent models for multi-terminal channels

  • Author

    du Pin Calmon, Flávio ; Médard, Muriel ; Effros, Michelle

  • Author_Institution
    Massachusetts Inst. of Technol., Cambridge, MA, USA
  • fYear
    2011
  • fDate
    16-20 Oct. 2011
  • Firstpage
    370
  • Lastpage
    374
  • Abstract
    The recently introduced network equivalence results are used to create bit-pipe models that can replace multi-terminal channels within a discrete memoryless network. The goal is to create a set of simple “components” or “blocks” that can be substituted for the channel in such a way that the resulting network is capable of emulating the operation of the original one. We develop general upper and lower bounding models for the multiple access channel and for a class of broadcast channels. These bounds are sharp in the sense that there exists networks where the original channel can achieve the maximum sum rate permissible through the upper or lower bounding models. This approach provides a simple method for analyzing the capacity of large networks, which we illustrate with an example.
  • Keywords
    broadband networks; broadcast channels; bit-pipe model; broadcast channel; discrete memoryless network; equivalent model; lower bounding model; maximum sum rate; multiple access channel; multiterminal channel; upper bounding model; Conferences; Emulation; Information theory; Noise measurement; Signal to noise ratio; Upper bound; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop (ITW), 2011 IEEE
  • Conference_Location
    Paraty
  • Print_ISBN
    978-1-4577-0438-3
  • Type

    conf

  • DOI
    10.1109/ITW.2011.6089482
  • Filename
    6089482