Achievable Rates for $K$-User Gaussian Interference Channels

Jafarian, Amin; Vishwanath, Sriram

doi:10.1109/tit.2012.2191691

Cited by 22 publications

(14 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A similar result for the K-user cyclic GIN was obtained in [18]. It was also shown in [19]- [21] that using non-Gaussian inputs (or in [22] with Gaussian inputs) and treating interference as noise achieves the capacity region of some special SISO GINs within a constant gap. The withinconstant-gap results have a merit in the high signal-to-noise ratio (SNR) regime only, where the achievable rate region is sufficiently large.…”

Section: Introductionsupporting

confidence: 72%

Superposition Signaling in Broadcast Interference Networks

Tuan

Tam

Nguyen

et al. 2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

Section: Introductionsupporting

confidence: 72%

Superposition Signaling in Broadcast Interference Networks

Tuan

Tam

Nguyen

et al. 2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

“…The steps we employ in proving the second claim borrows steps from proof of proposition 1 and the proof of the first claim presented above. Note that 18 Here we have used the positivity of (1 − 2δ), or equivalently δ being in the range (0, We have therefore proved our second claim. 20 Our third claim is that either H(X 2 |Q, U 2 ) > 0 or H(X 3 |Q, U 3 ) > 0.…”

Section: It Can Be Verified Thatmentioning

confidence: 64%

“…Bresler, Parekh and Tse [5] employ lattice codes to align interference and thereby characterize the capacity of Gaussian ICs within a constant number of bits. The use of lattice codes has also been proposed in [17], [18], [19], [8] for efficient interference management over Gaussian ICs with three or more Tx-Rx pairs. [20] considers saturation technique for general ICs.…”

Section: Arxiv:14034583v2 [Csit] 13 Jan 2015mentioning

confidence: 99%

An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes

Padakandla

Sahebi

Pradhan

2016

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

We consider the problem of communication over a three user discrete memoryless interference channel (3−IC).The current known coding techniques for communicating over an arbitrary 3−IC are based on message splitting, superposition coding and binning using independent and identically distributed (iid) random codebooks. In this work, we propose a new ensemble of codes -partitioned coset codes (PCC) -that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit algebraic closure property of PCC to enable interference alignment over general 3−IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3−IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, and moreover, strictly larger than current known largest achievable rate regions based on iid random codebooks.

show abstract

“…In this paper, similar to [42,43], we assume that the channel gains are rational, a = p q ∈ Q. The channel inputs X i 's (i ∈ {1, 2}) are average-power limited to P > 0, i.e., …”

Section: System Modelmentioning

confidence: 99%

On the capacity of state-dependent Gaussian cognitive interference channel

Ghasemi-Goojani

Behroozi

2014

J Wireless Com Network

View full text Add to dashboard Cite

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.

show abstract

Achievable Rates for $K$-User Gaussian Interference Channels

Cited by 22 publications

References 30 publications

Superposition Signaling in Broadcast Interference Networks

Superposition Signaling in Broadcast Interference Networks

An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes

On the capacity of state-dependent Gaussian cognitive interference channel

Contact Info

Product

Resources

About