On the interference-multiple-access channel. Perron, E., Diggavi, S N., & Telatar, E. In IEEE International Conference on Communications (ICC), Dresden, Germany, pages 31–35, June, 2009. abstract bibtex We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the other receiver is required to decode the messages from both transmitters. We provide an inner bound on the capacity region of this channel, as well as an outer bound for a special class of such channels. For this class, we also quantify the gap between inner and outer bound and show that the bounds match for a semi-deterministic channel, providing a complete characterization. For the Gaussian case, we show that the gap is at most 1 bit, yielding an approximate characterization.
@inproceedings{PDTj09c,
abstract = {We introduce the interference-multiple-access channel,
which is a discrete memoryless channel with two transmitters
and two receivers, similar to the interference channel. One
receiver is required to decode the information encoded at one
transmitter, the other receiver is required to decode the messages
from both transmitters. We provide an inner bound on the
capacity region of this channel, as well as an outer bound for a
special class of such channels. For this class, we also quantify the
gap between inner and outer bound and show that the bounds
match for a semi-deterministic channel, providing a complete
characterization. For the Gaussian case, we show that the gap is
at most 1 bit, yielding an approximate characterization.},
author = {E. Perron and S N. Diggavi and E. Telatar},
booktitle = {IEEE International Conference on Communications (ICC), Dresden, Germany},
file = {:papers:pdt_icc09.pdf},
month = {June},
note = {},
pages = {31--35},
tags = {conf,ITapprox,WiNet,IT,WiNetInfFlow,IntChan,SelConf},
title = {On the interference-multiple-access channel},
type = {4},
year = {2009}
}
Downloads: 0
{"_id":"54X2ogJopJsJKcz8t","bibbaseid":"perron-diggavi-telatar-ontheinterferencemultipleaccesschannel-2009","author_short":["Perron, E.","Diggavi, S N.","Telatar, E."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the other receiver is required to decode the messages from both transmitters. We provide an inner bound on the capacity region of this channel, as well as an outer bound for a special class of such channels. For this class, we also quantify the gap between inner and outer bound and show that the bounds match for a semi-deterministic channel, providing a complete characterization. For the Gaussian case, we show that the gap is at most 1 bit, yielding an approximate characterization.","author":[{"firstnames":["E."],"propositions":[],"lastnames":["Perron"],"suffixes":[]},{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["E."],"propositions":[],"lastnames":["Telatar"],"suffixes":[]}],"booktitle":"IEEE International Conference on Communications (ICC), Dresden, Germany","file":":papers:pdt_icc09.pdf","month":"June","note":"","pages":"31–35","tags":"conf,ITapprox,WiNet,IT,WiNetInfFlow,IntChan,SelConf","title":"On the interference-multiple-access channel","year":"2009","bibtex":"@inproceedings{PDTj09c,\n abstract = {We introduce the interference-multiple-access channel,\nwhich is a discrete memoryless channel with two transmitters\nand two receivers, similar to the interference channel. One\nreceiver is required to decode the information encoded at one\ntransmitter, the other receiver is required to decode the messages\nfrom both transmitters. We provide an inner bound on the\ncapacity region of this channel, as well as an outer bound for a\nspecial class of such channels. For this class, we also quantify the\ngap between inner and outer bound and show that the bounds\nmatch for a semi-deterministic channel, providing a complete\ncharacterization. For the Gaussian case, we show that the gap is\nat most 1 bit, yielding an approximate characterization.},\n author = {E. Perron and S N. Diggavi and E. Telatar},\n booktitle = {IEEE International Conference on Communications (ICC), Dresden, Germany},\n file = {:papers:pdt_icc09.pdf},\n month = {June},\n note = {},\n pages = {31--35},\n tags = {conf,ITapprox,WiNet,IT,WiNetInfFlow,IntChan,SelConf},\n title = {On the interference-multiple-access channel},\n type = {4},\n year = {2009}\n}\n\n","author_short":["Perron, E.","Diggavi, S N.","Telatar, E."],"key":"PDTj09c","id":"PDTj09c","bibbaseid":"perron-diggavi-telatar-ontheinterferencemultipleaccesschannel-2009","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["interference","multiple","access","channel","perron","diggavi","telatar"],"title":"On the interference-multiple-access channel","year":2009}