Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bounds and Capacity Theorems for Cognitive Interference Channels with State (1207.0016v2)

Published 29 Jun 2012 in cs.IT and math.IT

Abstract: A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a common message to the two receivers, and transmitter 2 also sends a separate message to receiver 2. The channel is corrupted by an independent and identically distributed (i.i.d.) state sequence. The scenario in which the state sequence is noncausally known only at transmitter 2 is first studied. For the discrete memoryless channel and its degraded version, inner and outer bounds on the capacity region are obtained. The capacity region is characterized for the degraded semideterministic channel and channels that satisfy a less noisy condition. The Gaussian channels are further studied, which are partitioned into two cases based on how the interference compares with the signal at receiver 1. For each case, inner and outer bounds on the capacity region are derived, and partial boundary of the capacity region is characterized. The full capacity region is characterized for channels that satisfy certain conditions. The second scenario in which the state sequence is noncausally known at both transmitter 2 and receiver 2 is further studied. The capacity region is obtained for both the discrete memoryless and Gaussian channels. It is also shown that this capacity is achieved by certain Gaussian channels with state noncausally known only at transmitter 2.

Citations (20)

Summary

We haven't generated a summary for this paper yet.