Achievable Rate Regions of Two-Way Relay Channels
With the fast development of communication networks, cooperative communication has been more widely used in many different fields, such as satellite networks, broadcast networks, internet and so on. Therefore relay channels have been playing a pivotal role since their definitions were proposed by Van-der Meulen. However, the general achievable rate region of a relay channel is still unknown which inspires more people to persistently work on. There are several different kinds of coding schemes proposed by people after relay channels came into our lives. Until now, the two most commonly used coding strategies of relay channels are Decode-and-Forward and Compress-and-Forward. In this thesis we will provide a way to obtain the achievable rate region for two-way relay channels by using decode-and-forward coding.
With the knowledge of basic information theory and network information theory, we will focus our study on the achievable rates of relay channels. Most of the previous study of relay channels are aiming to find a more general achievable rate region. In this thesis, an intuitional way will be used to study four-terminal relay channels. This method makes a good use of the information from three-terminal relay channels by separating a four-terminal relay channel into two parts: (1) a three-terminal relay channel; (2) a common end node. The final achievable rate region is obtained by combing together the separate achievable rates of the two parts. We split the complex model to two easier ones, this idea may give help for doing researches on more complicated channels.
200 University Avenue West
Waterloo, ON N2L 3G1