# When Does Channel-Output Feedback Enlarge the Capacity Region of the Two-User Linear Deterministic Interference Channel?

@inproceedings{Quintero2016WhenDC, title={When Does Channel-Output Feedback Enlarge the Capacity Region of the Two-User Linear Deterministic Interference Channel?}, author={V{\'i}ctor Quintero and Samir Medina Perlaza and I{\~n}aki Esnaola and Jean-Marie Gorce}, booktitle={CrownCom}, year={2016} }

The two-user linear deterministic interference channel (LD-IC) with noisy channel-output feedback is fully described by six parameters that correspond to the number of bit-pipes between each transmitter and its corresponding intended receiver, i.e., $\overrightarrow{n}_{11}$ and $\overrightarrow{n}_{22}$; between each transmitter and its corresponding non-intended receiver i.e., $n_{12}$ and $n_{21}$; and between each receiver and its corresponding transmitter, i.e., $\overleftarrow{n}_{11…

## 4 Citations

### Decentralized Interference Channels with Noisy Output Feedback

- Computer Science
- 2017

The $\eta-Nash equilibrium ($\eta$-NE) region of the two-user linear deterministic interference channel with noisy channel-output feedback is characterized and there does not exist an alternative coding scheme for either transmitter-receiver pair that increases the individual rate by more than $\eta$ bits per channel use.

### Approximate Capacity Region of the Two-User Gaussian Interference Channel With Noisy Channel-Output Feedback

- Computer ScienceIEEE Transactions on Information Theory
- 2018

The achievability region and the converse region are proven to approximate the capacity region of the G-IC-NF to within 4.4 bits.

### When Does Output Feedback Enlarge the Capacity of the Interference Channel?

- Computer ScienceIEEE Transactions on Communications
- 2018

In this paper, the benefits of channel-output feedback in the Gaussian interference channel (G-IC) are studied under the effect of additive Gaussian noise. Using a linear deterministic (LD) model,…

### On the Efficiency of Nash Equilibria in the Interference Channel with Noisy Feedback

- Computer Science
- 2017

The ensemble of conclusions of this work reveal the relevance of jointly using equilibrium selection methods and channel-output feedback for reducing the effect of anarchical behavior of the network components in the η-NE sum-rate of the interference channel.

## References

SHOWING 1-10 OF 12 REFERENCES

### On the Feedback Capacity of the Fully Connected K-User Interference Channel

- Computer ScienceIEEE Transactions on Information Theory
- 2013

The coding scheme proposed for this network, termed cooperative interference alignment, is based on two key ingredients, namely, interference alignment and interference decoding, and an approximate characterization is provided for the symmetric feedback capacity of the network, when the \ssr SNR and\ssr INR are far apart from each other.

### Noisy channel-output feedback capacity of the linear deterministic interference channel

- Computer Science2015 IEEE Information Theory Workshop - Fall (ITW)
- 2015

In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of…

### Approximated Capacity of the Two-User Gaussian Interference Channel with Noisy Channel-Output Feedback

- Computer ScienceArXiv
- 2016

It is shown that the achievability region and the converse region approximate the capacity region of the G-IC-NOF to within a constant gap in bits.

### Perfect Output Feedback in the Two-User Decentralized Interference Channel

- Computer ScienceIEEE Transactions on Information Theory
- 2015

In this paper, the η-Nash equilibrium (η-NE) region of the two-user Gaussian interference channel (IC) with perfect output feedback is approximated to within 1 bit/s/Hz and η arbitrarily close to 1…

### Approximate capacity of the Gaussian interference channel with noisy channel-output feedback

- Computer Science2016 IEEE Information Theory Workshop (ITW)
- 2016

It is shown that the achievability region and the converse region approximate the capacity region of the G-IC-NOF to within a constant gap in bits per channel use.

### Feedback Capacity of the Gaussian Interference Channel to Within 2 Bits

- Computer ScienceIEEE Transactions on Information Theory
- 2011

The result makes use of a linear deterministic model to provide insights into the Gaussian channel and establishes the exact feedback capacity region of this general class of deterministic ICs.

### On the Symmetric Feedback Capacity of the K-User Cyclic Z-Interference Channel

- Computer ScienceIEEE Transactions on Information Theory
- 2013

The results highlight that the symmetric feedback capacities for both linear and Gaussian channel models are in general functions of K, the number of users, and the capacity gain obtained due to feedback decreases as K increases.

### Approximate Capacity Region for the Symmetric Gaussian Interference Channel With Noisy Feedback

- Computer ScienceIEEE Transactions on Information Theory
- 2015

This paper considers the two-user linear deterministic interference channel with noisy feedback, as a stepping stone to characterize the approximate capacity region for the symmetric Gaussian interference channel without feedback, and develops a novel converse outer bounding technique.

### Gaussian Interference Channel Capacity to Within One Bit

- Computer ScienceIEEE Transactions on Information Theory
- 2008

This work shows that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, it is shown that a very simple and explicit Han-Kobayashi type scheme can achieve to within a single bit per second per hertz of the capacity for all values of the channel parameters.

### Wireless Network Information Flow: A Deterministic Approach

- Computer ScienceIEEE Transactions on Information Theory
- 2011

An exact characterization of the capacity of a network with nodes connected by deterministic channels is obtained, a natural generalization of the celebrated max-flow min-cut theorem for wired networks.