Cart (Loading....) | Create Account
Close category search window
 

An achievable rate for relay networks based on compress-and-forward strategy

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

3 Author(s)
Salehkalaibar, S. ; Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran, Iran ; Ghabeli, L. ; Aref, M.R.

Compress-and-Forward (CF) is a well-known coding strategy proposed for relay channels. Few works which were done about the generalization of the CF strategy to the relay networks, are based on irregular encoding/successive decoding. In this paper, a new generalization of the CF strategy to the relay networks based on regular encoding/backward decoding is presented. In general, backward decoding has been shown to yield higher rates in comparison with successive decoding. Here we will investigate the performance of backward decoding in our problem and show that our achievable rate includes the previously proposed rates.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 4 )

Date of Publication:

April 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.