Matched multiuser Gaussian source-channel communications via uncoded schemes. Tian, C., Chen, J., Diggavi, S. N., & Shamai, S. In IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, pages 476–480, 2015. ![Matched multiuser Gaussian source-channel communications via uncoded schemes [link]](https://bibbase.org/img/filetypes/link.svg "link")
Arxiv doi abstract bibtex We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the source, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters match certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. As a byproduct of the investigation, novel outer bounds are derived for these two problems.
@inproceedings{DBLP:conf/isit/TianCDS15,
abstract = {We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the source, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters match certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. As a byproduct of the investigation, novel outer bounds are derived for these two problems.},
author = {Chao Tian and
Jun Chen and
Suhas N. Diggavi and
Shlomo Shamai},
bibsource = {dblp computer science bibliography, http://dblp.org},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/isit/TianCDS15},
booktitle = {IEEE International Symposium on Information Theory, ISIT 2015,
Hong Kong, China, June 14-19, 2015},
crossref = {DBLP:conf/isit/2015},
doi = {10.1109/ISIT.2015.7282500},
pages = {476--480},
tags = {conf, IT},
timestamp = {Mon, 12 Oct 2015 09:21:34 +0200},
title = {Matched multiuser Gaussian source-channel communications via uncoded
schemes},
type = {4},
url_arxiv = {https://arxiv.org/abs/1502.05428},
year = {2015}
}
Downloads: 0
{"_id":"RNAoHG7j2eQNdHMgt","bibbaseid":"tian-chen-diggavi-shamai-matchedmultiusergaussiansourcechannelcommunicationsviauncodedschemes-2015","author_short":["Tian, C.","Chen, J.","Diggavi, S. N.","Shamai, S."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the source, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters match certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. As a byproduct of the investigation, novel outer bounds are derived for these two problems.","author":[{"firstnames":["Chao"],"propositions":[],"lastnames":["Tian"],"suffixes":[]},{"firstnames":["Jun"],"propositions":[],"lastnames":["Chen"],"suffixes":[]},{"firstnames":["Suhas","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["Shlomo"],"propositions":[],"lastnames":["Shamai"],"suffixes":[]}],"bibsource":"dblp computer science bibliography, http://dblp.org","biburl":"http://dblp.uni-trier.de/rec/bib/conf/isit/TianCDS15","booktitle":"IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015","crossref":"DBLP:conf/isit/2015","doi":"10.1109/ISIT.2015.7282500","pages":"476–480","tags":"conf, IT","timestamp":"Mon, 12 Oct 2015 09:21:34 +0200","title":"Matched multiuser Gaussian source-channel communications via uncoded schemes","url_arxiv":"https://arxiv.org/abs/1502.05428","year":"2015","bibtex":"@inproceedings{DBLP:conf/isit/TianCDS15,\n abstract = {We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each receiver is interested in reconstructing only one source component (or one specific linear function of the sources) under the mean squared error distortion measure; the second is to send correlated Gaussian sources on a Gaussian multiple-access channel, where each transmitter observes a noisy combination of the source, and the receiver wishes to reconstruct the individual source components (or individual linear functions) under the mean squared error distortion measure. It is shown that when the channel parameters match certain general conditions, the induced distortion tuples are on the boundary of the achievable distortion region, and thus optimal. Instead of following the conventional approach of attempting to characterize the achievable distortion region, we ask the question whether and how a match can be effectively determined. This decision problem formulation helps to circumvent the difficult optimization problem often embedded in region characterization problems, and it also leads us to focus on the critical conditions in the outer bounds that make the inequalities become equalities, which effectively decouple the overall problem into several simpler sub-problems. Optimality results previously unknown in the literature are obtained using this novel approach. As a byproduct of the investigation, novel outer bounds are derived for these two problems.},\n author = {Chao Tian and\nJun Chen and\nSuhas N. Diggavi and\nShlomo Shamai},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n biburl = {http://dblp.uni-trier.de/rec/bib/conf/isit/TianCDS15},\n booktitle = {IEEE International Symposium on Information Theory, ISIT 2015,\nHong Kong, China, June 14-19, 2015},\n crossref = {DBLP:conf/isit/2015},\n doi = {10.1109/ISIT.2015.7282500},\n pages = {476--480},\n tags = {conf, IT},\n timestamp = {Mon, 12 Oct 2015 09:21:34 +0200},\n title = {Matched multiuser Gaussian source-channel communications via uncoded\nschemes},\n type = {4},\n url_arxiv = {https://arxiv.org/abs/1502.05428},\n year = {2015}\n}\n\n","author_short":["Tian, C.","Chen, J.","Diggavi, S. N.","Shamai, S."],"key":"DBLP:conf/isit/TianCDS15","id":"DBLP:conf/isit/TianCDS15","bibbaseid":"tian-chen-diggavi-shamai-matchedmultiusergaussiansourcechannelcommunicationsviauncodedschemes-2015","role":"author","urls":{" arxiv":"https://arxiv.org/abs/1502.05428"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["xJuTMZ3nEiMJi5Y9f","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["matched","multiuser","gaussian","source","channel","communications","via","uncoded","schemes","tian","chen","diggavi","shamai"],"title":"Matched multiuser Gaussian source-channel communications via uncoded schemes","year":2015}