On the capacity of state-dependent Gaussian cognitive interference channel

A Gaussian cognitive interference channel with state (G-CICS) is studied. In this paper, we focus on the two-sender, two-receiver case and consider the communication situation in which two senders transmit a common message to two receivers. Transmitter 1 knows only message W 1 , and transmitter 2, r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:EURASIP journal on wireless communications and networking 2014-11, Vol.2014 (1), p.1-13, Article 196
Hauptverfasser: Ghasemi-Goojani, Shahab, Behroozi, Hamid
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A Gaussian cognitive interference channel with state (G-CICS) is studied. In this paper, we focus on the two-sender, two-receiver case and consider the communication situation in which two senders transmit a common message to two receivers. Transmitter 1 knows only message W 1 , and transmitter 2, referred to as the cognitive user, knows both messages W 1 and W 2 and also the channel’s states sequence non-causally. Receiver 1 needs to decode only W 1 while receiver 2 needs to decode both messages. In this paper, we investigate the weak and moderate interference case where we assume that the channel gain a satisfies | a |≤1. In addition, inner and outer bounds on the capacity region are derived in the regime of high state power, i.e., the channel state sequence has unbounded variance. First, we show that the achievable rate by Gelfand-Pinsker coding vanishes in the high state power regime under a condition over the channel gain. In contrast, we propose a transmission scheme (based on lattice codes) that can achieve positive rates, independent of the interference. Our transmission scheme can achieve the capacity region in a high signal-to-noise ratio (SNR) regime. Also, regardless of all channel parameters, the gap between the achievable rate region and the outer bound is at most 0.5 bits.
ISSN:1687-1499
1687-1499
DOI:10.1186/1687-1499-2014-196