Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Achievable rate regions of multi-way relay channel with direct links

© The Institution of Engineering and Technology
Received 23/06/2014, Accepted 11/12/2014, Revised 19/11/2014, Published 17/03/2015

Rate regions of a multi-way relay channel with direct links (MWRC-DLs), where K users exchange their messages via a relay terminal and all users can overhear each other directly, are studied in this study. Under the assumption that a restricted encoder is employed at each user, the cut-set outer bound on the capacity region is derived first. Then, achievable rate regions of the MWRC-DLs with decode-and-forward (DF) and compress-and-forward (CF) strategies are characterised. Meanwhile, the explicit expressions of the outer bound and the achievable rate regions for the Gaussian MWRC-DLs are also derived. It is shown that the rate regions of the DF and CF strategies for the two-way relay channel and the multiple-access relay channel can be obtained from those of the MWRC-DLs. To give more insights on the two strategies of the MWRC-DLs system, the common rates of a symmetric Gaussian network are analysed. It is shown that the CF strategy achieves common rates within 1/2(K − 1) bits of the capacity when the relay's power is at least (K − 1) times as large as the user power. Numerical examples are also provided to verify the theoretical analysis.

Inspec keywords: decode and forward communication; multi-access systems; Gaussian processes; relay networks (telecommunication); wireless channels; set theory

Other keywords: achievable rate regions; multiple-access relay channel; capacity region; Gaussian MWRC-DL; compress-and-forward strategy; decode-and-forward strategy; multiway relay channel; symmetric Gaussian network; relay terminal; cut-set outer bound; direct links; message exchange

Subjects: Combinatorial mathematics; Multiple access communication; Radio links and equipment; Other topics in statistics

References

    1. 1)
    2. 2)
    3. 3)
      • 5. Gündüz, D., Yener, A., Goldsmith, A., Poor, H.V.: ‘The multi-way relay channel’. Proc. IEEE Int. Symp. Information Theory, Seoul, Korea, June–July 2009, pp. 339–343.
    4. 4)
      • 15. Kim, S.J., Devroye, N., Mitran, P., Tarokh, V.: ‘Comparison of bidirectional relaying protocols’. Proc. IEEE Sarnoff Symp., Princeton, NJ, USA, April 2008, pp. 1–5.
    5. 5)
      • 22. Shannon, C.E.: ‘Two-way communication channels’. Proc. Fourth Berkeley Symp. Mathematical Statistical and Probability, Berkeley, CA, 1961, 1, pp. 611–644.
    6. 6)
      • 2. Schnurr, C., Stanczak, S., Oechtering, T.J.: ‘Coding theorems for the restricted half-duplex two-way relay channel with joint decoding’. Proc. IEEE Int. Symp. Information Theory, Toronto, Canada, July 2008, pp. 2688–2692.
    7. 7)
    8. 8)
      • 19. Winkelbauer, A., Matz, G.: ‘Joint network-channel coded multi-way relaying’. Proc. Asilomar Conf. on Signals, Systems and Computers, Pacific Grove, CA, USA, November 2012, pp. 2006–2010.
    9. 9)
    10. 10)
      • 13. Rankov, B., Wittneben, A.: ‘Achievable rate regions for the two-way relay channel’. Proc. IEEE Int. Symp. Information Theory, Seattle, WA, USA, July 2006, pp. 1668–1672.
    11. 11)
      • 1. Lee, N., Robert, W.H.Jr.: ‘Multi-way information exchange over completely-connected interference networks with a multi-antenna relay’, arXiv:1302.0749 [cs.IT].
    12. 12)
    13. 13)
      • 18. Kim, S.J., Smida, B., Devroye, N.: ‘Lattice strategies for a multi-pair bi-directional relay network’. Proc. IEEE Int. Symp. Information Theory, St. Petersburg, Russia, July–August 2011, pp. 2243–2247.
    14. 14)
      • 26. Willems, F.M.J.: ‘Information theoretical results for the discrete memoryless multiple access channel’. Doctor in de Wetenschappen Proefschrift dissertation, Katholieke University Leuven, Leuven, Belgium, 1982.
    15. 15)
    16. 16)
    17. 17)
      • 14. Xie, L.: ‘Network coding and random binning for multi-user channels’. Proc. Canadian Workshop on Information Theory, Edmonton, Alta., Canada, June 2007, pp. 85–88.
    18. 18)
    19. 19)
      • 16. Avestimehr, A.S., Sezgin, A., Tse, D.N.C.: ‘Capacity of the two-way relay channel within a constant gap’, Eur. Trans. Telecommun., 2010, 21, (4), pp. 363–374.
    20. 20)
      • 3. Gündüz, D., Tuncel, E., Nayak, J.: ‘Rate regions for the separated two-way relay channel’. Proc. 46th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, IL, September 2008, pp. 1333–1340.
    21. 21)
      • 21. Sankaranarayanan, L., Kramer, G., Mandayam, N.B.: ‘Hierarchical sensor networks: capacity bounds and cooperative strategies using the multiple-access relay channel model’. Proc. First IEEE Conf. on Sensor and Ad Hoc Communications and Networks, Santa Clara, CA, USA, October 2004, pp. 191–199.
    22. 22)
      • 17. Song, Y., Devroye, N.: ‘List decoding for nested lattices and applications to relay channels’. Proc. Annual Allerton Conf. on Communication, Control, and Computing, Allerton, IL, USA, September–October 2010, pp. 1038–1045.
    23. 23)
    24. 24)
      • 8. Noori, M., Ardakani, M.: ‘On the capacity gap of Gaussian multi-way relay channels’. Proc. IEEE Vehicular Technology Conf. (VTC), Quebec, Canada, September 2012, pp. 1–4.
    25. 25)
      • 11. Sun, F., De Carvalho, E.: ‘Degrees of freedom of asymmetrical multi-way relay networks’. Proc. IEEE Workshop Signal Processing Advances in Wireless Communications, San Francisco, CA, USA, June 2011, pp. 531–535.
    26. 26)
      • 27. Kramer, G., Gupta, P., Gastpar, M.: ‘Information-theoretic multi-hopping for relay networks’. Proc. Int. Zurich Seminar on Digital Communications, Zurich, Switzerland, February 2004, pp. 192–195.
    27. 27)
    28. 28)
      • 4. Nam, W., Chung, S.-Y., Lee, Y.H.: ‘Capacity bounds for two-way relay channels’. Proc. Int. Zurich Seminar on Communications, Zurich, Switzerland, March 2008, pp. 144–147.
    29. 29)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2014.0622
Loading

Related content

content/journals/10.1049/iet-com.2014.0622
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address