IIIT Hyderabad Publications |
|||||||||
|
Low Subpacketization Coded Caching via ProjectiveGeometry for Broadcast and D2D networksAuthors: Hari Hara suthan C,Prasad Krishnan Conference: The 2019 IEEE International Symposium on Information Theory ((ISIT) 2019) Location Paris, France Date: 2019-07-07 Report no: IIIT/TR/2019/60 AbstractCoded caching was introduced as a technique ofsystematically exploiting locally available storage at the clients toincrease the channel throughput via coded transmissions. Mostknown coded caching schemes in literature enable large gainsin terms of the rate, however at the cost of subpacketizationthat is exponential inK1r(Kbeing the number of clients,rsome positive integer). Building upon recent prior work forcoded caching design via line graphs and finite-field projectivegeometries, we present a new scheme in this work which achievesa subexponential (inK) subpacketization ofqO((logqK)2)andrateΘ(K(logqK)2), for largeK, and the cached fractionMNbeing upper bounded by a constant2qα−1(for some primepowerqand constantα≥2) . Apart from this asymptoticimprovement, we show that through some numerical comparisonsthat our present scheme has much lower subpacketization thanprevious comparable schemes, with some increase in the rate ofthe delivery scheme, for the same memory requirements. Forinstance, we obtain practically relevant subpacketization levelssuch as102−107for102−104number of clients. Leveragingprior results on adapting coded caching schemes for the error-free broadcast channel to device to device networks, we obtaina low-subpacketization scheme for D2D networks also, and givenumerical comparison for the same with prior work. Full paper: pdf Centre for Communications |
||||||||
Copyright © 2009 - IIIT Hyderabad. All Rights Reserved. |