2016/05/12 by Michèle Wigger, Wigger, Michèle, Roy Timo +3
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1605.03761
Submitted to ITW 2016 in Cambridge
arxiv created 2016/05/12 · arxiv updated 2016/05/13
We present upper and lower bounds on the per-user multiplexing gain (MG) of Wyner's circular soft-handoff model and Wyner's circular full model with cognitive transmitters and receivers with cache memories. The bounds are tight for cache memories with prelog μ≥ 2/3D in the soft-handoff model and for μ≥ D in the full model, where D denotes the number of possibly demanded files. In these cases the per-user MG of the two models is 1+μ/D, the same as for non-interfering point-to-point links with caches at the receivers. Large receiver cache-memories thus allow to completely mitigate interference in these networks.