Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 39609 (05)
- University: Sharif University of Technology
- Department: Electrical Engineering
- Advisor(s): Aref, Mohammad Reza; Ashtiani, Farid
- Abstract:
- In this dissertation we discuss various results presented in the literature on single user channels with causal or noncausal side information and multiuser channels with side information such as multiple access channel and broadcast channel. The Series Relay Networks (SRN) with delays, with and without channel state information (CSI) are investigated from an information theoretic point of view. For SRN with unlimited look ahead where the relays can use the whole received block to encode, upper and lower bounds on the capacity are derived which are tight for the degraded case. For SRN without-delay where the relays have access to the present received symbols in addition to the past symbols, the capacity of the degraded network is established using Shannon’s strategies for channels with side information. Furthermore, we introduce the state dependent SRN with unlimited look ahead and derive a lower bound on the capacity when the CSI is noncausally available at the sender and relays, using Gel’fand-Pinsker coding technique. Also the capacity of the degraded Gaussian SRN with unlimited look ahead and with state noise (dirty paper problem) is established. Finally we introduce the problem of using training sequences in order to create side information for the system under study.
- Keywords:
- Side Information ; Capacity ; Network Information Theory ; CAPACITY ; Series Relay Network With Delay ; Dirty Paper Property
Digital Object List-
محتواي پايان نامه - view
Bookmark