http://iet.metastore.ingenta.com
1887

Achievable rate region for multiple-access-relay-networks

Achievable rate region for multiple-access-relay-networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors introduce a generalisation of the multiple-access-relay-channel (MARC) called multiple-access-relay-network (MARN). The MARC model was first introduced by Kramer et al. and consists of many transmitters, one receiver and only one relay. In the MARN, there are many transmitters, many relays and one receiver. The authors obtained an achievable rate region for MARN by considering partial decode-and-forward (PDF) strategy at the relays. They showed that the region obtained using PDF strategy subsumes the region obtained by Kramer et al. for MARC. In the proposed coding scheme, the authors take advantage of PDF strategy based on regular encoding/backward decoding strategy. They also define semi-deterministic MARN, in which the output of the link between each transmitter and each relay is a deterministic function of the transmitter's input. The authors obtained an inner bound (using our achievable rate region) and also an outer bound on the capacity region of the semi-deterministic MARN and compared them.

References

    1. 1)
      • Shannon, C.E.: `Two-way communication channels', Proc. Fourth Symp. on Math. Statist. Prob., Univ, 1961, Berkeley, CA, p. 611–644.
    2. 2)
      • Ahlswede, R.: `Multi-way communication channels', Second Int. Symp. on Info. Theory, Thakadsor, Armenian SSR, September 1971, p. 23–52.
    3. 3)
      • D. Slepian , J.K. Wolf . A coding theorem for multiple access channels with correlated sources. Bell Syst. Tech. J. , 7 , 1037 - 1076
    4. 4)
      • T.M. Cover , A. Elgamal , M. Salehi . Multiple access channels with arbitrarily correlated sources. IEEE Trans. Inf. Theory , 4 , 648 - 657
    5. 5)
      • T.M. Cover , A. Elgamal . Capacity theorems for relay channels. IEEE Trans. Inf. Theory , 5 , 572 - 584
    6. 6)
      • A.B. Carleial . Multiple-access channels with different generalised feedback signals. IEEE Trans. Inf. Theory , 6 , 841 - 850
    7. 7)
      • Willems, F.M.J.: `Information-theoretical results for the discrete emoryless multiple access channel', October 1982, PhD, Katholieke Universiteit, Leuven, Belgium.
    8. 8)
      • L. Ghabeli , M.R. Aref . Symmetric relaying based on partial decoding and the capacity of a class of relay networks. IET Commun. , 1 , 151 - 159
    9. 9)
      • L. Ghabeli , M.R. Aref . Comprehensive partial decoding approach for two-level relay networks. IET Commun. , 4 , 585 - 596
    10. 10)
      • L.L. Xie , P.R. Kumar . An achievable rate for the multiple-level relay channel. IEEE Trans. Inf. Theory , 4 , 1348 - 1358
    11. 11)
      • Aref, M.R.: `Information flow in relay networks', October 1980, PhD, Stanford Univ., Stanford, CA.
    12. 12)
      • G. Kramer , M. Gastpar , P. Gupta . Cooperative strategies and capacity theorems for relay networks. IEEE Trans. Inf. Theory , 9 , 3037 - 3063
    13. 13)
      • C.M. Zeng , F. Kuhlmann , A. Buzo . Achievability proofs of some multiuser channel coding theorems using backward decoding. IEEE Trans. Inf. Theory , 6 , 1160 - 1165
    14. 14)
      • Laneman, J.N., Kramer, G.: `Window decoding for the multipleaccess channel with generalized feedback', Proc. IEEE Int. Symp. on Inf. Theory, June/July 2004, Chicago, IL, USA, p. 281.
    15. 15)
      • L. Sankar , G. Kramer , N.B. Mandayam . Offset encoding for multiple-access relay channels. IEEE Trans. Inf. Theory , 10 , 3814 - 3821
    16. 16)
      • A. El Gamal , M.R. Aref . The capacity of the semideterministic relay channel. IEEE Trans. Inf. Theory , 3
    17. 17)
      • S.I. Gelfand , M.S. Pinsker . Capacity of a broadcast channel with one deterministic component. Probl. Inf. Trans. , 1 , 17 - 25
    18. 18)
      • Ghabeli, L., Aref, M.R.: `A new achievable rate and the capacity of a class of semi-deterministic relay networks', Proc. IEEE Int. Symp. on Info. Theory, June 2007, Nice, France, p. 281–285.
    19. 19)
      • Ghabeli, L., Aref, M.R.: `A new achievable rate for relay networks based on parallel relaying', Proc. IEEE Int. Symp. on Info. Theory, July 2008, Toronto, Canada, p. 1328–1332.
    20. 20)
      • H. Chong , M. Motani . The capacity region of a class of semideterministic interference channels. IEEE Trans. Inf. Theory , 2 , 598 - 603
    21. 21)
      • T.M. Cover , J.A. Thomas . (2006) Elements of information theory.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0123
Loading

Related content

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