检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张源[1]
机构地区:[1]东南大学移动通信国家重点实验室,南京210096
出 处:《Journal of Southeast University(English Edition)》2009年第1期6-8,共3页东南大学学报(英文版)
基 金:The Free Research Fund of National Mobile Communi-cations Research Laboratory of Southeast University(No.2008B06);the Na-tional Basic Research Program of China (973 Program)(No.2007CB310603)
摘 要:To reduce decoding delay of a communication scheme which is backward-decoding-based and achievable Chong Motani-Garg capacity bounds, a novel forward-sliding-window decoding-based communication scheme is proposed. In this scheme, if w = (w1, w2) is the message to be sent in block b, the relay will decode message w1 and generate a new message z at the end of block b, and the receiver will decode message w1 at the end of block b + 1 and decode message z and w2 at the end of block b + 2. Analysis results show that this new communication scheme can achieve the same Chong-Motani-Garg bounds and the decoding delay is only two blocks which is much shorter than that of backward decoding. Therefore, Chong-Motani-Garg bounds can be achieved by a forward decoding-based communication scheme with short decoding delay.为了解决基于后向解码的三节点中继信道Chong-Motani-Garg容量界可达通信方案的解码延时过长问题,提出了一种新型的基于前向解码的三节点中继信道通信方案.在该方案中,假定在第b个分组中的发送消息为w=(w1,w2),则中继需要在第b个分组结束时对消息w1进行解码并生成一个新的消息z,而接收机需要在第b+1个分组结束时对消息w1进行解码,然后在第b+2个分组结束时对消息z和w2进行解码.分析结果表明,该通信方案也可以达到Chong-Motani-Garg容量界,并且该方案的解码延时只有2个分组长度,大大短于基于后向解码的通信方案的解码延时.因此,三节点中继信道Chong-Motani-Garg容量界可以通过基于解码延时短的前向解码的通信方案达到.
关 键 词:achievable rate capacity backward decoding forward decoding mixed strategy relay channel
分 类 号:TN911.2[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15