SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Ghasemi Goojani Shahab) "

Search: WFRF:(Ghasemi Goojani Shahab)

  • Result 1-3 of 3
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Ghasemi-Goojani, Shahab, et al. (author)
  • On the Capacity of Gaussian "Dirty" Z-Interference Channel with Common State
  • 2018
  • In: 2018 52ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS). - : IEEE.
  • Conference paper (peer-reviewed)abstract
    • A class of Gaussian Z-interference channels with state is investigated in the regime of high state power with two transmitters communicating two independent messages through a "dirty" Z-interference channel with state. Transmitter 1 (primary user) interferes with receiver 2, while transmitter 2 (secondary user) does not interfere with receiver 1. In our model, we assume that both states are the same. Using lattice coding schemes, we obtain achievable rate-regions to characterize the boundary of the capacity region either fully or partially. Surprisingly, we observe that the achievable rate-region under a common state can include some points out of the rate-region when the channel is only corrupted by a state, i.e., when the additional interference is not harmful for the channel.
  •  
2.
  • Ghasemi-Goojani, Shahab, et al. (author)
  • On the Capacity of State-Dependent Gaussian Z-Interference Channel
  • 2019
  • In: Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. - : Institute of Electrical and Electronics Engineers Inc.. - 9784885523182 ; , s. 653-657
  • Conference paper (peer-reviewed)abstract
    • We study the State-Dependent Gaussian Z-Interference Channel (SDG-ZIC), with two senders transmitting two independent messages through a Gaussian Z-interference channel with the same state. Transmitter 1 interferes with receiver 2, while transmitter 2 does not interfere with receiver 1. In addition, both receivers suffer from the same but differently scaled random state sequence, which is non-causally known at both transmitters. As mentioned in [1], the challenge here is to fully cancel differently scaled states at both receivers. Proposing transmission schemes based on nested lattice codes, we show that under some new conditions, the state at both receivers can be fully canceled and the capacity region can be fully achieved.
  •  
3.
  • Ghasemi-Goojani, Shahab, et al. (author)
  • The Symmetric Two-Hop Channel with an Untrusted Relay
  • 2019
  • In: Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. - : Institute of Electrical and Electronics Engineers Inc.. - 9784885523182 ; , s. 673-677
  • Conference paper (peer-reviewed)abstract
    • We study, using information-theoretic security methods, the so-called symmetric two-hop channel with an untrusted relay. In this model, a source wants to send its message reliably and securely to the destination through an honest but curious relay. The relay acts as a passive eavesdropper. Our investigation, in line with the relevant literature, seeks to determine what rate, termed secrecy rate, is achievable. To do that, we consider a typical setting, with the destination cooperating with the source, sending a 'scrambling' signal to conceal the message from the relay. To derive the achievable secrecy rate, we propose a novel scheme based on nested lattice codes. We show that our scheme outperforms all existing schemes and it achieves the outer bound for this channel model within 0.33 bits.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-3 of 3
Type of publication
conference paper (3)
Type of content
peer-reviewed (3)
Author/Editor
Papadimitratos, Pana ... (3)
Ghasemi-Goojani, Sha ... (3)
University
Royal Institute of Technology (3)
Language
English (3)
Research subject (UKÄ/SCB)
Engineering and Technology (2)
Natural sciences (1)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view