Decentralized caching and coded delivery over Gaussian broadcast channels
Author(s)
Mohammadi Amiri, M
Gunduz, D
Type
Conference Paper
Abstract
A cache-aided K-user Gaussian broadcast channel (BC) is considered. The transmitter has a library of N equal-rate files, from which each user demands one. The impact of the equal-capacity receiver cache memories on the minimum required transmit power to satisfy all user demands is studied. Decentralized caching with uniformly random demands is considered, and both the minimum average power (averaged over all demand combinations) and the minimum peak power (minimum power required to satisfy the worst-case demand combination) are studied. Upper and lower bounds are presented on the minimum required average and peak transmit power as a function of the cache capacity, assuming uncoded cache placement. The gaps between the upper and lower bounds on both the minimum peak and average power values are shown to be relatively small through numerical results, particularly for large cache capacities.
Date Issued
2017-08-15
Date Acceptance
2017-04-01
Citation
2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp.2785-2789
ISSN
2157-8117
Publisher
IEEE
Start Page
2785
End Page
2789
Journal / Book Title
2017 IEEE International Symposium on Information Theory (ISIT)
Copyright Statement
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Sponsor
Commission of the European Communities
Commission of the European Communities
Grant Number
690893
677854
Source
International Symposium on Information Theory (ISIT) 2017
Subjects
Science & Technology
Technology
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Computer Science
Engineering
Publication Status
Published
Start Date
2017-06-25
Finish Date
2017-06-30
Coverage Spatial
Aachen, Germany
Date Publish Online
2017-08-15