2014 Poster Sessions : Improved Capacity Approximations

Student Name : Ritesh Kolte
Advisor : Ayfer Özgur Aydin
Research Areas: Information Systems
We provide an improved lower bound on the rate achieved by noisy network coding in arbitrary Gaussian relay networks, whose gap to the cutset upper bound depends on the network not only through the total number of nodes but also through the degrees of freedom of the min cut of the network. We illustrate that for many networks this refined lower bound can lead to a better approximation of the capacity. The improvement is based on a judicious choice of the quantization resolutions at the relays.