Subpacketization-Rate Trade-off in Multi-Antenna Coded Caching

May 10, 2019 Β· Declared Dead Β· πŸ› Global Communications Conference

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors MohammadJavad Salehi, Antti TΓΆlli, Seyed Pooya Shariatpanahi, Jarkko Kaleva arXiv ID 1905.04349 Category cs.IT: Information Theory Cross-listed cs.NI Citations 38 Venue Global Communications Conference Last Checked 6 months ago
Abstract
Coded caching can be applied in wireless multi-antenna communications by multicast beamforming coded data chunks to carefully selected user groups and using the existing file fragments in user caches to decode the desired files at each user. However, the number of packets a file should be split into, known as subpacketization, grows exponentially with the network size. We provide a new scheme, which enables the level of subpacketization to be selected freely among a set of predefined values depending on basic network parameters such as antenna and user count. A simple efficiency index is also proposed as a performance indicator at various subpacketization levels. The numerical examples demonstrate that larger subpacketization generally results in better efficiency index and higher symmetric rate, while smaller subpacketization incurs significant loss in the achievable rate. This enables more efficient caching schemes, tailored to the available computational and power resources.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted