By Topic

On achievable rates for relay networks based on partial decode-and-forward

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
$31 $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)
Ghabeli, L. ; Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran, Iran ; Aref, M.R.

In this paper, we investigate the performance of two strategies: simultaneous sliding window decoding (SimSlide) and simultaneous backward decoding (SimBack) when generalizing partial decode-and-forward to the relay networks. We show that these two methods yield the same achievable rates for relay networks but in comparison with sequential decoding, they yield higher rates. This is due to the fact that simultaneously decoding the different parts of the source message yields fewer bounds and this ultimately results a comprehensive and higher rate. We also introduce a special class of semi-deterministic relay networks and obtain its capacity by the proposed achievable rate.

Published in:

Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on

Date of Conference:

13-18 June 2010