双接收机高斯广播信道中非编码预取缓存的准确容量-内存权衡

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI:10.1109/ISIT.2019.8849343

M. Salman, M. Varanasi

{"title":"双接收机高斯广播信道中非编码预取缓存的准确容量-内存权衡","authors":"M. Salman, M. Varanasi","doi":"10.1109/ISIT.2019.8849343","DOIUrl":null,"url":null,"abstract":"The two-receiver Gaussian broadcast channel (BC) is studied when each receiver has a cache memory. Using a joint cache-channel coding scheme, the exact capacity-memory tradeoff—the highest rate of reliable communication as a function of the cache size—is established for any cache size.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"28 1","pages":"1222-1226"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The Exact Capacity-Memory Tradeoff for Caching with Uncoded Prefetching in the Two-Receiver Gaussian Broadcast Channel\",\"authors\":\"M. Salman, M. Varanasi\",\"doi\":\"10.1109/ISIT.2019.8849343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The two-receiver Gaussian broadcast channel (BC) is studied when each receiver has a cache memory. Using a joint cache-channel coding scheme, the exact capacity-memory tradeoff—the highest rate of reliable communication as a function of the cache size—is established for any cache size.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"28 1\",\"pages\":\"1222-1226\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2019.8849343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

研究了在每个接收端都有高速缓存的情况下，双接收端高斯广播信道(BC)。使用联合缓存信道编码方案，对于任何缓存大小，都可以确定准确的容量-内存权衡(作为缓存大小函数的最高可靠通信速率)。

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

查看原文本刊更多论文

The Exact Capacity-Memory Tradeoff for Caching with Uncoded Prefetching in the Two-Receiver Gaussian Broadcast Channel

The two-receiver Gaussian broadcast channel (BC) is studied when each receiver has a cache memory. Using a joint cache-channel coding scheme, the exact capacity-memory tradeoff—the highest rate of reliable communication as a function of the cache size—is established for any cache size.

求助全文

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

来源期刊

2019 IEEE International Symposium on Information Theory (ISIT)

自引率

0.00%

发文量