an:06152463
Zbl 1334.94031
Chaaban, Anas; Sezgin, Aydin; Tuninetti, Daniela
Achieving net feedback gain in the linear-deterministic butterfly network with a full-duplex relay
EN
Aydinian, Harout (ed.) et al., Information theory, combinatorics, and search theory. In memory of Rudolf Ahlswede. Berlin: Springer (ISBN 978-3-642-36898-1/pbk). Lecture Notes in Computer Science 7777, 167-208 (2013).
2013
a
94A05 68M10
butterfly network; interference relay channel with feedback; capacity; inner bound; outer bound
Summary: 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.
For the entire collection see [Zbl 1259.94005].