Achievable Rate Regions for the Two-way Relay Channel
Top Cited Papers
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1668-1672
- https://doi.org/10.1109/isit.2006.261638
Abstract
We study the two-way communication problem for the relay channel. Hereby, two terminals communicate simultaneously in both directions with the help of one relay. We consider the restricted two-way problem, i.e., the encoders at both terminals do not cooperate. We provide achievable rate regions for different cooperation strategies, such as decode-and-forward based on block Markov superposition coding. We also evaluate the regions for the special case of additive white Gaussian noise channels. We show that a combined strategy of block Markov superposition coding and Wyner-Ziv coding achieves the cut-set upper bound on the sum-rate of the two-way relay channel when the relay is in the proximity of one of the terminalsKeywords
This publication has 7 references indexed in Scilit:
- 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
- Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage BehaviorIEEE Transactions on Information Theory, 2004
- The multiple-relay channel: coding and antenna-clustering capacityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Elements of Information TheoryPublished by Wiley ,2001
- A general coding scheme for the two-way channelIEEE Transactions on Information Theory, 1984
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979