Capacity Bounds for Multi-user Information Systems With Relay

Please enable javascript in your browser.

Saleh Kalaibar, Sadaf | 2010

966 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 40729 (05)
University: Sharif University of Technology
Department: Electrical Engineering
Advisor(s): Aref, Mohammad Reza
Abstract:
In this dissertation, different information networks such as Multiple-Access-Relay Network (MARN) and Broadcast-Relay Network (BRN) are introduced. MARN has one receiver, many relays and many senders. An achievable rate region is obtained for the MARN, using Partial Decode-and-Forward (PDF) strategy. In the case of semi-deterministic MARN, an outer bound and an inner bound to the capacity region are derived. BRN is a model with one sender, two relays and two receivers. Two different types of cooperation are considered for BRN: full cooperation and partial cooperation between relays. Inner bounds on the capacity region of BRN are obtained and compared with previous works. The main idea of the coding scheme is symmetric relaying strategy. Also, Broadcast-Relay Channel (BRC), which consists of one sender, one relay and two receivers, is considered. An outer bound to the capacity region of BRC is found. Finally, an achievable region is obtained for the relay networks using Compress-and-Forward (CF) strategy based on regular encoding/backward decoding
Keywords:
Decode and Forward ; Multiple Access Relay Channel (MARC) ; Broadcast Channel ; Relay Channel ; Broadcast-Relay Network ; Relay Network ; Compress-and-Forward