.png){kind=icon}
.png){kind=icon}
Return
Cache-Aware Source Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2822728.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we show that Huffman's source coding method is not optimal for cache-aided networks. To that end, we propose an optimal algorithm for the cache-aided source coding problem. We define cache-aided entropy, which represents a lower bound on the average number of transmitted bits for cached-aided networks. A sub-optimal low-complexity cacheaided coding algorithm is presented. In addition, we propose a novel polynomial-time algorithm that obtains the global-optimal source code for wide range of cache sizes. Simulation results show a reduction in the average number of transmitted bits by more than 50% over Huffman's method at moderate cache sizes.
Keywords:
Information theory
source coding
caching
algorithms
discrete optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W