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

Symmetric relaying based on partial decoding and the capacity of a class of relay networks

Symmetric relaying based on partial decoding and the capacity of a class of 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 Title Publication 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.

Symmetric relaying is a method of relaying in which the relays can decode the message of other relays in the network in addition to the source message. In this paper an achievable rate is presented for a symmetric two-relay network based on partial decoding. The strategy make use of familiar techniques such as product binning, regular encoding/sliding window decoding and regular encoding/backward decoding. The proposed rate is shown to subsume the previously proposed rate for feed-forward relay network based on decode-and-forward. This rate is also used to establish the capacity of a generalisation of Aref network called ‘semi-deterministic relay network with no interference at the relays’ and independent relay inputs.

References

    1. 1)
      • Willems, F.M.J.: `Information theoretical results for the discrete memoryless multiple access channel', Oct 1992, Doctor in de Wetenschappen Proefschrift, Katholieke Universiteit Leuven, Belgium.
    2. 2)
      • L. Ghabeli , M.R. Aref . A new achievable rate and the capacity of a class of semi-deterministic relay networks. IEEE Int. Symp. Inf. Theory , 281 - 285
    3. 3)
      • L. Ghabel , M.R. Aref . Symmetric relaying strategy for two-relay network. IEEE Commun. Lett. , 10 , 708 - 710
    4. 4)
      • A. El Gamal , M. Aref . The capacity of the semi-deterministic relay channel. IEEE Trans. Inf. Theory , 3
    5. 5)
    6. 6)
      • L. Ghabeli , M.R. Aref . Comprehensive partial decoding approach for two-level relay networks. IET Commun.
    7. 7)
      • L.L. Xie , P.R. Kumar . An achievable rate for the multiple-level relay channel. IEEE Trans. Inf. Theory , 4 , 1348 - 1358
    8. 8)
      • P. Rost , G. Fettweis . Analysis of a mixed strategy for multiple relay networks. IEEE Trans. Inform. Theory
    9. 9)
      • T.M. Cover , J.A. Thomas . (2006) Elements of information theory.
    10. 10)
      • G. Kramer , M. Gastpar , P. Gupta . Cooperative strategies and capacity theorems for relay networks. IEEE Trans. Inf. Theory , 9 , 3037 - 3063
    11. 11)
      • A. El Gamal , S. Zahedi . Capacity of relay channels with orthogonal components. IEEE Trans. Inform. Theory , 5 , 1815 - 1817
    12. 12)
      • E.C. van der Meulen . Three terminal communication channels. Adv. Appl. Probab. , 120 - 154
    13. 13)
      • L. Ghabeli , M.R. Aref . A new achievable rate and the capacity of some classes of multilevel relay network. EURASIP J. Wireless Commun. Netw.
    14. 14)
      • M.H. Yassaee , M.R. Aref . Generalized compress-and-forward strategy for relay networks. IEEE Int. Symp. Inf. Theory , 2683 - 2687
    15. 15)
      • N. Ratnakar , G. Kramer . The multicast capacity of deterministic relay networks with no interference. IEEE Trans. Inf. Theory , 6 , 2425 - 2432
    16. 16)
      • Aref, M.R.: `Information flow in relay networks', 1980, PhD, Stanford University.
    17. 17)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20080373
Loading

Related content

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