Bounds on capacity and minimum energy-per-bit for AWGN relay channels

A. El Gamal, M. Mohseni, S. Zahedi
2006 IEEE Transactions on Information Theory  
Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency-division AWGN (FD-AWGN) relay channel models are established. First, the max-flow min-cut bound and the generalized block-Markov coding scheme are used to derive upper and lower bounds on capacity. These bounds are never tight for the general AWGN model and are tight only under certain conditions for the FD-AWGN model. Two coding schemes that do not require the relay
more » ... o decode any part of the message are then investigated. First, it is shown that the "side-information coding scheme" can outperform the block-Markov coding scheme. It is also shown that the achievable rate of the side-information coding scheme can be improved via time sharing. In the second scheme, the relaying functions are restricted to be linear. The problem is reduced to a "single-letter" nonconvex optimization problem for the FD-AWGN model. The paper also establishes a relationship between the minimum energy-per-bit and capacity of the AWGN relay channel. This relationship together with the lower and upper bounds on capacity are used to establish corresponding lower and upper bounds on the minimum energy-per-bit that do not differ by more than a factor of 1 45 for the FD-AWGN relay channel model and 1 7 for the general AWGN model. Index Terms-Additive white Gaussian noise (AWGN) channels, channel capacity, minimum energy-per-bit, relay channel. Authorized licensed use limited to: Stanford University. Downloaded on March 02,2010 at 17:12:52 EST from IEEE Xplore. Restrictions apply.
doi:10.1109/tit.2006.871579 fatcat:x2oozzjvf5cinc7pnkrgb45p5y