Pith. sign in

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

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

cs.IT 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Fundamental Limits of Wireless Caching under Uneven-Capacity Channels

cs.IT · 2019-08-12 · conditional · novelty 6.0

A superposition-coding scheme with per-layer rates achieves near-optimal, within-factor-4 delivery time for cache-aided SISO broadcast with uneven-capacity users, and full-capacity delay remains achievable when each user's capacity exceeds a closed-form threshold.

citing papers explorer

Showing 1 of 1 citing paper.

  • Fundamental Limits of Wireless Caching under Uneven-Capacity Channels cs.IT · 2019-08-12 · conditional · none · ref 28 · internal anchor

    A superposition-coding scheme with per-layer rates achieves near-optimal, within-factor-4 delivery time for cache-aided SISO broadcast with uneven-capacity users, and full-capacity delay remains achievable when each user's capacity exceeds a closed-form threshold.