Bounds on capacity and minimum energy-per-bit for AWGN relay channels
Top Cited Papers
- 3 April 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 52 (4) , 1545-1561
- https://doi.org/10.1109/tit.2006.871579
Abstract
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 to 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.Keywords
This publication has 19 references indexed in Scilit:
- Gaussian Orthogonal Relay Channels: Optimal Resource Allocation and CapacityIEEE Transactions on Information Theory, 2005
- Cooperative Strategies and Capacity Theorems for Relay NetworksIEEE Transactions on Information Theory, 2005
- Capacity Bounds and Power Allocation for Wireless Relay ChannelsIEEE Transactions on Information Theory, 2005
- Capacity of a Class of Relay Channels With Orthogonal ComponentsIEEE Transactions on Information Theory, 2005
- Spectral efficiency in the wideband regimeIEEE Transactions on Information Theory, 2002
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- On channel capacity per unit costIEEE Transactions on Information Theory, 1990
- The capacity of the semideterministic relay channel (Corresp.)IEEE Transactions on Information Theory, 1982
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- Three-terminal communication channelsAdvances in Applied Probability, 1971