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

Authors:
Sadaf Salehkalaibar;Leila Ghabeli;Mohammad Reza Aref
Affiliations:
Information Systems and Security Lab, Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran;Information Systems and Security Lab, Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran;Information Systems and Security Lab, Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 0

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Simultaneous partial and backward decoding approach for two-level relay networks

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Cooperative Strategies and Capacity Theorems for Relay Networks

IEEE Transactions on Information Theory
Generalized Backward Decoding Strategies for the Relay Channel

IEEE Transactions on Information Theory
Offset Encoding for Multiple-Access Relay Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.