{"title":"联合通信与信道估计:两跳情况","authors":"S. Vedantam, W. Zhang, U. Mitra","doi":"10.1109/ALLERTON.2008.4797749","DOIUrl":null,"url":null,"abstract":"The problem of communicating over a two hop network while estimating the channel states to within a distortion constraint is explored. The end to end capacity of this network is upper and lower bounded. Under certain conditions, it is shown that the upper and lower bounds match and we have the capacity of the network. An example is also presented to apply the results developed.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Joint communication and channel estimation: the two hop case\",\"authors\":\"S. Vedantam, W. Zhang, U. Mitra\",\"doi\":\"10.1109/ALLERTON.2008.4797749\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of communicating over a two hop network while estimating the channel states to within a distortion constraint is explored. The end to end capacity of this network is upper and lower bounded. Under certain conditions, it is shown that the upper and lower bounds match and we have the capacity of the network. An example is also presented to apply the results developed.\",\"PeriodicalId\":120561,\"journal\":{\"name\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2008.4797749\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797749","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint communication and channel estimation: the two hop case
The problem of communicating over a two hop network while estimating the channel states to within a distortion constraint is explored. The end to end capacity of this network is upper and lower bounded. Under certain conditions, it is shown that the upper and lower bounds match and we have the capacity of the network. An example is also presented to apply the results developed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
