Equivalent models for multi-terminal channels
Author(s)
Calmon, Flavio du Pin; Medard, Muriel; Effros, Michelle
DownloadMedard_Equivalent Models for Multi-terminal Channels.pdf (279.4Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2011-12Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings of the IEEE Information Theory Workshop (ITW), 2011
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
du Pin Calmon, Flavio, Muriel Medard, and Michelle Effros. “Equivalent Models for Multi-terminal Channels.” IEEE Information Theory Workshop (ITW), 2011. 370–374.
Version: Author's final manuscript
ISBN
978-1-4577-0438-3