首页> 外文会议>International Symposium on Signal Processing and Information Technology >Analysis of a Distributed Coded Cooperation Scheme for Multi-Relay Channels
【24h】

Analysis of a Distributed Coded Cooperation Scheme for Multi-Relay Channels

机译:多继电器通道分布式编码合作方案分析

获取原文

摘要

In this paper, we consider a coded cooperation diversity scheme suitable for relay channels. The proposed scheme is based on convolutional coding, where each codeword of the source node is partitioned into two parts. The first part is transmitted from the source to the relays and destination. The second part is transmitted simultaneously from the source and relay nodes to the destination. All the relay nodes are assumed to be operating in the decode-and-forward (DF) mode. At the destination, the two replicas of the second sub-codeword are combined using maximum ratio combining (MRC). The entire codeword is decoded via the Viterbi algorithm. We analyze the proposed scheme for L-relay channels in terms of its probability of symbol error and outage probability. In that, explicit upper bounds are obtained assuming M-ary phase shift keying (M-PSK) transmission. Our analytical results show that the maximum diversity order is achieved provided that the source-relay link is more reliable than the other links. Otherwise, the diversity degrades. However, in both cases, it is shown that substantial performance improvements are possible to achieve over noncooperative coded systems. Several numerical and simulation results are presented to demonstrate the efficiency of the proposed scheme.
机译:在本文中,我们考虑了适用于继电器渠道的编码合作多样性方案。所提出的方案基于卷积编码,其中源节点的每个码字被划分为两部分。第一部分从源传输到继电器和目的地。第二部分从源和中继节点同时发送到目的地。假设所有继电器节点都在解码和前进(DF)模式下操作。在目的地,使用最大比率(MRC)组合第二子码字的两个复制品。通过维特比算法解码整个码字。我们在符号误差和中断概率的概率方面分析了L-中继信道的提出方案。在此,假设M-ARY相移键控(M-PSK)传输获得显式上限。我们的分析结果表明,实现了最大分集顺序,条件是源 - 中继链路比其他链路更可靠。否则,多样性降低。然而,在这两种情况下,示出了可以实现实质性的性能改进来实现非自由度编码系统。提出了几种数值和仿真结果以证明所提出的方案的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号