Loading...

Capacity of Almost General Relay Channel and Aref Network with Random Links

Abed Hodtani, Ghosheh | 2009

698 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 39321 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Aref, Mohammad Reza
  7. Abstract:
  8. First, we review in an appropriate way the researches regarding building blocks of a wireless network (Shannon channel, multiple access channel, broadcast channel, interference channel, relay channel) and then: • We consider two cases for a relay and describe the essential role of the relay with three Markovity conditions; define Almost General Relay Channel with Decode-And-Forward (AGRCDAF) strategy and determine its capacity. Then, we prove that our capacity theorem not only includes all known capacity theorems as its special cases but also potentially is applicable to other relay channels and is validated by its consistency with previous results related to special cases of broadcast and multiple access channels.• Using a new network coding, we obtain a new achievable rate for the two relay network which (i) gives the lower bound for general relay channel obtained by Cover and El Gamal, (ii) gives the one relay rates of two level relay channel studied by Gupta and Kumar,(iii) gives the rate of two relay Aref network and other special two relay networks, (iv) meets max-flow min-cut upper bound under additional assumptions and (v) is consistent with previous results related to special cases of broadcast channels
  9. Keywords:
  10. Relay Channel ; Channel Capacity ; Network Coding ; Known Capacity Theorem ; Aref Network

 Digital Object List

 Bookmark