首页> 外文期刊>Signal Processing, IEEE Transactions on >Multiuser Cooperative Diversity Through Network Coding Based on Classical Coding Theory
【24h】

Multiuser Cooperative Diversity Through Network Coding Based on Classical Coding Theory

机译:基于经典编码理论的网络编码多用户合作分集

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we propose and analyze a generalized construction of distributed network codes for a network consisting of $M$ users sending independent information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its throughput. The proposed scheme, called generalized dynamic-network codes (GDNC), is a generalization of the dynamic-network codes (DNC) recently proposed by Xiao and Skoglund. The design of the network codes that maximize the diversity order is recognized as equivalent to the design of linear block codes over a nonbinary finite field under the Hamming metric. We prove that adopting a systematic generator matrix of a maximum distance separable block code over a sufficiently large finite field as the network transfer matrix is a sufficient condition for full diversity order under link failure model. The proposed generalization offers a much better tradeoff between rate and diversity order compared to the DNC. An outage probability analysis showing the improved performance is carried out, and computer simulations results are shown to agree with the analytical results.
机译:在本文中,我们提出并分析了由$ M $用户组成的网络的分布式网络代码的一般构造,该用户通过独立的块衰落信道向独立的基站发送独立的信息。目的是在不降低系统吞吐量的情况下增加系统的分集顺序。所提出的方案称为广义动态网络代码(GDNC),是Xiao和Skoglund最近提出的动态网络代码(DNC)的概括。使分集阶数最大化的网络代码的设计被认为等同于汉明度量下非二进制有限域上的线性分组代码的设计。我们证明,在链路故障模型下,在足够大的有限域上采用最大距离可分离分组码的系统生成器矩阵作为网络传输矩阵是充分分集阶数的充分条件。与DNC相比,提出的一般化在速率和分集阶数之间提供了更好的权衡。进行了一次停机概率分析,显示了改进的性能,并显示了计算机仿真结果与分析结果相符。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号