User Tools

Site Tools


Cache Aided Polar Codes

This tutorial explains how to execute the improved cache-aided transmission based on piggyback coding and Polar Codes proposed in [1] over the CorteXlab testbed. As in the numerical example in [1], a situation is considered with a single server and 5 users: the server is incorporated by node 16 of CorteXlab, user 1 by node 37, user 2 by node 17, user 3 by node 38, user 4 by node 14, user 5 by node 35. The user nodes use their harddisk as cache memories to store the prefetched content from the server, which in turn uses its hard disk to store the file library.

In this tutorial, you will first learn how to transmit information from the server to the nodes using Polar codes. As a next step, you will run the coded caching algorithm in [2] with decentralized caching combined with Polar code transmissions. Finally, you will run the improved delivery scheme that combines piggyback coding and Polar codes as explained in [1]

Polar Code Transmission

Part A

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.

cache_aided_polar_coding.txt · Last modified: 2021/10/27 17:24 by mwigger

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki