Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks
Journal
IEEE Information Theory Workshop
Pages
381-385
Date Issued
2012-09
Author(s)
Abstract
We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset upper bound these schemes can achieve in the context of diamond networks, and how much benefit is obtained by optimizing the quantizer distortions at the relays. First, with noise-level quantization, we point out that the worst-case gap from the cutset upper bound is (N + log 2 N) bits/s/Hz. A better universal quantization level found without using channel state information (CSI) leads to a sharpened gap of log 2 N + log2(1 + N) + N log2(1 + 1/N) bits/s/Hz. On the other hand, it turns out that finding the optimal distortion levels depending on the channel gains is a non-trivial problem in the general N-relay setup. We manage to solve the two-relay problem and the symmetric N-relay problem analytically, and show the improvement via numerical evaluations both in static as well as slow-fading channels. © 2012 IEEE.
Other Subjects
Channel gains; Cut-set; Diamond networks; Gaussians; Non-trivial; Numerical evaluations; Optimal distortion; Quantization levels; Quantizers; Relaying schemes; Upper Bound; Channel state information; Diamonds; Fading channels; Information theory; Optimization; Gaussian distribution
Type
conference paper