Loading...

Performance Analysis of Lattice Codes on Interference and Relay Channels

Baianifar, Mahdi | 2013

780 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 45063 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Behroozi, Hamid
  7. Abstract:
  8. Random codes can achieve the capacity region of so many channels like AWGN channel, multiple access channel (MAC), etc. Recently, it is shown that these codes cannot achieve any positive rate for some channels such as doubly dirty MAC.Because of this fact and also practical consideration, structured codes have been introduced recently. It is shown that one of the structured codes, referred to as lattice codes, can achieve positive rates for doubly dirty MAC. These codes can also achieve the capacity of AWGN channel, MAC and Broadcast channel. For these reasons, in this work we analyze the performance of lattice codes over relay channels as well as interference channels. Here, we implement lattice codes over the following channels:1. Many-to-one Gaussian interference channel with a remote fusion center (FC). In this scenario, transmitters send their messages to the receivers. Each receiver after performing desired actions, sends its message to the remote FC via a limited rate link. For comparison, we consider cooperative schemes like decode and forward, compress and forward, and compute and forward. As we know, performance of compute and forward scheme rely on channel coefficients such that when channel coefficients are non-integer, this scheme shows weak performance in some cases. We showed that if the rate of limited link equals to the capacity of AWGN channel, our approach have the same performance as the compute and forward scheme for integer channel coefficients. However, when channel coefficients are non-integers, our approach performs superior to the other schemes and it can achieve the
    capacity in high SNRs.2. Two Way Relay Channel (TWRC). By using lattice based scheme, we derive an achievable rate region for this channel and by comparing with the outer bound, we show that our scheme can achieve the capacity in high SNRs
  9. Keywords:
  10. Lattice Codes ; Decode and Forward ; Gaussian Many to One ; Limited Rate Link ; Compute and Forward ; Compress-and-Forward ; Capacity Region

 Digital Object List

 Bookmark