[PDF][PDF] Achievable Rate Regions for the Two-way Relay Channel.

B Rankov, A Wittneben - ISIT, 2006 - researchgate.net
B Rankov, A Wittneben
ISIT, 2006researchgate.net
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, ie, 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 and compress-andforward based on Wyner-
Ziv source coding. We also evaluate the regions for the special case of additive white …
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, ie, 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 and compress-andforward based on Wyner-Ziv source 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 terminals.
researchgate.net
以上显示的是最相近的搜索结果。 查看全部搜索结果