Equivalent models for multi-terminal channels
Name
Medard_Equivalent Models for Multi-terminal Channels.pdf
Size
279.44 KB
Format
Adobe PDF
Checksum (MD5)
f8784a66ed40dd25d05e3dea6faded13
Author(s)
Calmon, Flavio du Pin
Medard, Muriel
Effros, Michelle
Date Issued
December 2011
Journal
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ITW.2011.6089482
