Lower and Upper Bounds on the Capacity of a Class of Gaussian Relay Channels

摘要

In this paper, we consider a relay network where the relay and destination receive the sources signal through two independent Gaussian channels. We first state an upper bound based on a genie case (the link between the relay and the destination supporting infinite rate). Then we derive a lower bound by finding an achievable rate using Wyner-Ziv noisy data compression scheme.