On the optimality of successive decoding in compress-and-forward relay schemes

作者
Xiugang Wu,Liang‐Liang Xie
标识
DOI:10.1109/allerton.2010.5706953
摘要

In the classical compress-and-forward relay scheme developed by (Cover and El Gamal, 1979), the decoding process operates in a successive way: the destination first decodes the compressed observation of the relay, and then decodes the original message of the source. Recently, two modified compressand- forward relay schemes were proposed, and in both of them, the destination jointly decodes the compressed observation of the relay and the original message, instead of successively. Such a modification on the decoding process was motivated by realizing that it is generally easier to decode the compressed observation jointly with the original message, and more importantly, the original message can be decoded even without completely decoding the compressed observation. Thus, joint decoding provides more freedom in choosing the compression rate at the relay, i.e., the relay's observation can be compressed at a rate higher than supportable by successive decoding. However, the question remains whether this freedom of choosing a higher compression rate at the relay improves the achievable rate of the original message. It has been shown in (El Gamal and Kim, 2010) that the answer is negative in the single relay case, and the achievable rate obtained in (Cover and El Gamal, 1979) with successive decoding is still the best. In this paper, we further demonstrate that in the case of multiple relays, there is no improvement on the achievable rate by joint decoding either. More interestingly, it is discovered that any compression rates higher than supportable by successive decoding will actually result in a strictly lower achievable rate for the original message. Therefore, to maximize the achievable rate for the original message, the compression rates should always be chosen to be supportable by successive decoding. The freedom of choosing higher compression rates introduced by joint decoding is actually obtained at the sacrifice of the achievable rate for the original message. This phenomenon is also shown to exist under the repetitive encoding framework recently proposed by (Lim, Kim, El Gamal, and Chung, 2010).

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
丰富鞋子应助坐井观天采纳,获得10
1秒前
宁不惜完成签到,获得积分10
1秒前
宋宋不迷糊完成签到 ,获得积分10
2秒前
传奇3应助玛卡巴卡采纳,获得10
4秒前
谭谨川发布了新的文献求助10
4秒前
4秒前
4秒前
Jasper应助项申奥采纳,获得10
5秒前
WANG发布了新的文献求助50
5秒前
所所应助dileibing采纳,获得10
6秒前
6秒前
7秒前
丰富鞋子应助坐井观天采纳,获得10
7秒前
7秒前
科研通AI6.4应助simba采纳,获得10
7秒前
安静凝旋关注了科研通微信公众号
9秒前
9秒前
上官若男应助qzy采纳,获得10
9秒前
我是老大应助qzy采纳,获得10
9秒前
科目三应助qzy采纳,获得10
9秒前
cdercder应助大道要熬采纳,获得10
9秒前
FashionBoy应助qzy采纳,获得10
9秒前
bkagyin应助qzy采纳,获得10
10秒前
洋芋完成签到 ,获得积分10
10秒前
ding应助qzy采纳,获得10
10秒前
CodeCraft应助qzy采纳,获得10
10秒前
上官若男应助qzy采纳,获得10
10秒前
wanci应助qzy采纳,获得10
10秒前
爆米花应助qzy采纳,获得10
10秒前
10秒前
11秒前
11秒前
11秒前
醋溜爆肚儿完成签到,获得积分10
12秒前
Kao应助科研通管家采纳,获得10
12秒前
曾经的问兰完成签到,获得积分20
12秒前
13秒前
13秒前
molihuakai应助科研通管家采纳,获得10
13秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
The anomeric effect 1314
Principles of town planning: translating concepts to applications 1000
1 Peter and Christ's Descent to the Dead in Its Early Christian Reception 700
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7734423
求助须知:如何正确求助?哪些是违规求助? 9284806
关于积分的说明 20166793
捐赠科研通 7312284
什么是DOI,文献DOI怎么找? 3304642
关于科研通互助平台的介绍 2457280
邀请新用户注册赠送积分活动 2313855