Sharif Digital Repository

This paper considers a many-to-one Gaussian interference channel with a fusion centre (FC) where there is a K -user interference channel in which only one relay (receiver) faces interference while the remaining K-1 receivers are interference free. All the relays communicate information about their observed sequence to the FC through noiseless links at communication rate R0. First, by analysing traditional relaying schemes, i.e., Decode and Forward, Compress and Forward and Compute and Forward, three rate-regions for this setting are derived. Then, based on nested lattice codes, a new achievable rate-region is provided. Based on the proposed scheme, one can design a transmission scheme that... 

Enabling cooperation in a NOMA system is a promising approach to improve its performance. In this paper, we study the cooperation in a secure NOMA system, where the legitimate users are distributed uniformly in the network and the eavesdroppers are distributed according to a homogeneous Poisson point process. We consider a cooperative NOMA scheme (two users are paired as strong and weak users) in two phases: 1) Direct transmission phase, in which the base station broadcasts a superposition of the messages, 2) Cooperation phase, in which the strong user acts as a relay to help in forwarding the messages of the weak user. We study the secrecy outage performance in two cases: (i) security of... 

We extend the result by Tse and Verdú on the optimum asymptotic multiuser efficiency of randomly spread code division multiple access (CDMA) with binary phase shift keying input. Random Gaussian and random binary antipodal spreading are considered. We obtain the optimum asymptotic multiuser efficiency of a K-user system with spreading gain N when K and N → ∞ and the loading factor, (K/N) , grows logarithmically with K under some conditions. It is shown that the optimum detector in a Gaussian randomly spread CDMA system has a performance close to the single user system at high signal-to-noise ratio when K and N → ∞ and the loading factor, (K/N), is kept less than (log3 K/2). Random binary...