Achieving net feedback gain in the linear-deterministic butterfly network with a full-duplex relay

Authors:
Anas Chaaban;Aydin Sezgin;Daniela Tuninetti
Affiliations:
Ruhr-University of Bochum, Bochum, Germany;Ruhr-University of Bochum, Bochum, Germany;University of Illinois at Chicago, Chicago, IL
Venue:
Information Theory, Combinatorics, and Search Theory
Year:
2013

Citing 7
Cited 0

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Network Information Theory

Network Information Theory
Network information flow

IEEE Transactions on Information Theory
Interference channels

IEEE Transactions on Information Theory
Capacity theorems for the relay channel

IEEE Transactions on Information Theory
A new achievable rate region for the interference channel

IEEE Transactions on Information Theory
Compute-and-Forward: Harnessing Interference Through Structured Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A symmetric butterfly network (BFN) with a full-duplex relay operating in a bi-directional fashion for feedback is considered. This network is relevant for a variety of wireless networks, including cellular systems dealing with cell-edge users. Upper bounds on the capacity region of the general memoryless BFN with feedback are derived based on cut-set and cooperation arguments and then specialized to the linear deterministic BFN with relay-source feedback. It is shown that the upper bounds are achievable using combinations of the compute-forward strategy and the classical decode-and-forward strategy, thus fully characterizing the capacity region. It is shown that net rate gains are possible in certain parameter regimes.