首页> 外文期刊>International journal of wireless information networks >Exploit Network Coding Over GF(2~q) for Multi-user Cooperative Wireless Networks
【24h】

Exploit Network Coding Over GF(2~q) for Multi-user Cooperative Wireless Networks

机译:利用GF(2〜q)的网络编码开发多用户协作无线网络

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

摘要

In this paper, we present a decode-and-forward network coded (DFNC) scheme over GF(2~q) for the multiuser cooperative communication systems. In particular, we consider a cooperative network with m users transmitting independent packets to the same destination. These users form a cooperation set to help each other by using linear network coding. We propose a coding coefficients construction method which can efficiently reduce the transmission overhead from m(q + log_2m) to m bits compared with conventional random network coding. Furthermore, we propose a novel decoding algorithm-credit-based updating algorithm in order to improve the solvability of decoding set of equations at the destination. The proposed decoding algorithm is combined with channel decoding and is applied on symbol-level. It can fully make use of the error recovery property of network coding while conventional decoding algorithms (e.g., Gaussian elimination) overlook it. We theoretically analyze the diversity performance in terms of information outage probability, and the results show that diversity order of m + 1 can be achieved for a m-user cooperation system. Moreover, we conduct extensive simulations to show that DFNC outperforms other transmission schemes in terms of symbol error rate and achieves higher diversity order. We also demonstrate that the proposed decoding algorithm provides significant performance gain over conventional decoding algorithm.
机译:在本文中,我们提出了一种基于GF(2〜q)的多用户协作通信系统的解码转发网络编码(DFNC)方案。特别地,我们考虑一个协作网络,其中m个用户将独立的数据包传输到同一目的地。这些用户形成一个协作集,以通过使用线性网络编码互相帮助。我们提出了一种编码系数构造方法,与传统的随机网络编码相比,该方法可以有效地将传输开销从m(q + log_2m)减少到m位。此外,我们提出了一种新颖的基于积分的解码算法-解码算法,以提高目的地处方程组的可解性。所提出的解码算法与信道解码相结合,并应用于符号级。它可以充分利用网络编码的错误恢复特性,而传统的解码算法(例如高斯消去)却忽略了它。我们从信息中断概率的角度对分集性能进行了理论分析,结果表明,一个m用户合作系统可以达到m + 1的分集顺序。此外,我们进行了广泛的仿真,以显示DFNC在符号错误率方面优于其他传输方案,并实现了更高的分集阶数。我们还证明,与常规解码算法相比,提出的解码算法可提供显着的性能提升。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号