叠加时序信道的可实现速率区域

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-11 DOI:10.1109/ISIT.2016.7541322

G. Ferrante, Tony Q. S. Quek, M. Win

{"title":"叠加时序信道的可实现速率区域","authors":"G. Ferrante, Tony Q. S. Quek, M. Win","doi":"10.1109/ISIT.2016.7541322","DOIUrl":null,"url":null,"abstract":"A multiple-access channel where point processes are randomly transformed by timing channels and then superposed is considered. An achievable rate region for the K-user channel is established. A single-user achievable rate in the presence of “many” interfering users is proposed. Results are applied to exponential server timing channels.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An achievable rate region for superposed timing channels\",\"authors\":\"G. Ferrante, Tony Q. S. Quek, M. Win\",\"doi\":\"10.1109/ISIT.2016.7541322\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A multiple-access channel where point processes are randomly transformed by timing channels and then superposed is considered. An achievable rate region for the K-user channel is established. A single-user achievable rate in the presence of “many” interfering users is proposed. Results are applied to exponential server timing channels.\",\"PeriodicalId\":198767,\"journal\":{\"name\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2016.7541322\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

考虑了一种多址信道，其中点进程由定时信道随机变换，然后叠加。建立了k用户信道的可实现速率区域。提出了存在“许多”干扰用户时的单用户可实现速率。结果应用于指数服务器时序信道。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An achievable rate region for superposed timing channels

A multiple-access channel where point processes are randomly transformed by timing channels and then superposed is considered. An achievable rate region for the K-user channel is established. A single-user achievable rate in the presence of “many” interfering users is proposed. Results are applied to exponential server timing channels.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE International Symposium on Information Theory (ISIT)

自引率

0.00%

发文量