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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R.: Multi-way communication channels. In: Proc. of 2nd International Symposium on Info. Theory, Tsahkadsor, Armenian S.S.R., pp. 23–52 (1971)
Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. on Inf. Theory 46(4), 1204–1216 (2000)
Avestimehr, A.S., Diggavi, S., Tse, D.: A deterministic approach to wireless relay networks. In: Proc. of Allerton Conference (2007)
Avestimehr, A.S., Ho, T.: Approximate capacity of the symmetric half-duplex Gaussian butterfly network. In: Proc. of the IEEE Information Theory Workshop (ITW), pp. 311–315 (2009)
Avestimehr, A.S., Sezgin, A., Tse, D.: Capacity of the two-way relay channel within a constant gap. European Trans. in Telecommunications (2009)
Carleial, A.B.: Interference channels. IEEE Trans. on Inf. Theory 24(1), 60–70 (1978)
Chaaban, A., Sezgin, A.: Achievable rates and upper bounds for the Gaussian interference relay channel. IEEE Trans. on Inf. Theory 58(7), 4432–4461 (2012)
Cover, T.M., El-Gamal, A.: Capacity theorems for the relay channel. IEEE Trans. on Inf. Theory IT-25(5), 572–584 (1979)
Cover, T., Thomas, J.: Elements of Information Theory, 2nd edn. John Wiley and Sons, Inc. (2006)
Gamal, A.E., Kim, Y.H.: Network Information Theory. Cambridge University Press (2011)
Han, T.S., Kobayashi, K.: A new achievable rate region for the interference channel. IEEE Trans. on Inf. Theory IT-27(1), 49–60 (1981)
Kim, S., Devroye, N., Mitran, P., Tarokh, V.: Comparisons of bi-directional relaying protocols. In: Proc. of the IEEE Sarnoff Symposium, Princeton, NJ (2008)
Mariç, I., Dabora, R., Goldsmith, A.J.: Relaying in the presence of interference: achievable rates, interference forwarding, and outer bounds. IEEE Trans. on Info. Theory 58(7), 4342–4354 (2012)
Narayanan, K., Wilson, M.P., Sprintson, A.: Joint physical layer coding and network coding for bi-directional relaying. In: Proc. of the Forty-Fifth Allerton Conference, Illinois (2007)
Nazer, B., Gastpar, M.: Compute-and-forward: harnessing interference through structured codes. IEEE Trans. on Inf. Theory 57(10), 6463–6486 (2011)
Rankov, B., Wittneben, A.: Spectral efficient signaling for half-duplex relay channels. In: Proc. of the Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA (2005)
Sahin, O., Erkip, E.: Achievable rates for the Gaussian interference relay channel. In: Proc. of 2007 GLOBECOM Communication Theory Symposium, Washington D.C (2007)
Tuninetti, D.: An outer bound for the memoryless two-user interference channel with general cooperation. In: Proc. of the IEEE Information Theory Workshop (ITW), Lausanne (2012)
Yang, E., Tuninetti, D.: Interference channels with source cooperation in the strong cooperation regime: symmetric capacity to within 2 bits/s/Hz with dirty paper coding. In: Proc. of 42nd Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chaaban, A., Sezgin, A., Tuninetti, D. (2013). Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)