{"title":"Multi-terminal source coding through a relay","authors":"R. Soundararajan, S. Vishwanath","doi":"10.1109/ISIT.2011.6033874","DOIUrl":null,"url":null,"abstract":"This paper studies a multi-terminal source coding problem, where two terminals possess two (correlated) Gaussian sources to be compressed and delivered to the destination through an intermediate relay. Unlike the CEO and conventional two-terminal source coding problems as well as point-to-point relay source coding problem, lattices are found to play an important role in achieving #x201C;good#x201D; rates for this problem setting. Two achievable strategies - compute-and-forward and compress-and-forward are used to develop achievable rates for this problem setting. For the symmetric case, the inner and outer bounds developed are shown to be within 1/2 bits of each other.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6033874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper studies a multi-terminal source coding problem, where two terminals possess two (correlated) Gaussian sources to be compressed and delivered to the destination through an intermediate relay. Unlike the CEO and conventional two-terminal source coding problems as well as point-to-point relay source coding problem, lattices are found to play an important role in achieving #x201C;good#x201D; rates for this problem setting. Two achievable strategies - compute-and-forward and compress-and-forward are used to develop achievable rates for this problem setting. For the symmetric case, the inner and outer bounds developed are shown to be within 1/2 bits of each other.