By Topic

Symmetric Semideterministic Relay Networks With No Interference at the Relays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Leila Ghabeli ; Information Systems and Security Lab (ISSL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran ; Mohammad Reza Aref

A symmetric semideterministic relay network is introduced, generalizing Aref networks. In the considered model, there is no interference at the relays, but the links from the source and the relays to the sink are interfering and nondeterministic. An achievable rate is determined for an arbitrary number of relays, based on symmetric relaying and simultaneous partial and backward decoding at the sink. The information expressions of the achievable rate match those of the standard cut-set bound, but the set of probability distributions is substantially different. We also study a wireless example of the defined network where nondeterministic links are replaced with fading AWGN channels, and obtain its ergodic capacity with phase fading when phase information is locally available at the sink.

Published in:

IEEE Transactions on Information Theory  (Volume:57 ,  Issue: 9 )