首页> 外文期刊>Wireless Networks >Variable Global Optimization min-sum (VGOMS) algorithm of decode- and-forward protocol for the relay node in the cooperative channel
【24h】

Variable Global Optimization min-sum (VGOMS) algorithm of decode- and-forward protocol for the relay node in the cooperative channel

机译:协作信道中中继节点的解码转发协议的可变全局优化最小和(VGOMS)算法

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

摘要

The excessive delay due to the complexity of the decoding process at the relay node results in additional delays at the destination which is a significant issue in cooperative communication channels. A low complexity min-sum (MS) based algorithm called the Variable Global Optimization min-sum (VGOMS) algorithm has been developed to minimise the error corrective performance. The proposed VGOMS algorithm apply the optimization scaling factor at the bit node processing of the variable node operation which have significantly less complexity as compared with the check node operation or both variable node and check node operation. In this study, a straightforward Particle Swarm Optimization approach was used to determine the optimal scaling factor to obtain optimized error corrective performance of the algorithm. The proposed system model uses the channel combining large-scale and small-scale effects which used extensively in cooperative communications. The performance of the VGOMS algorithm performance was compared with four existing decoding algorithms (MS, OMS, NMS, SP) and was found better than the original min-sum (MS) in term of bit error rate (BER) performance and the first algorithm reach optimal BER in error floor region from 3 others existing decoding algorithm (MS, OMS, NMS) after Sum-Product (SP) algorithm. The VGOMS algorithm was therefore shown to have a significantly better compromise between the implementation of good error performance and low computational complexity.
机译:由于中继节点处的解码过程的复杂性而导致的过度延迟导致目的地处的额外延迟,这在协作通信信道中是一个重要问题。已经开发了一种基于低复杂度最小和(MS)的算法,称为可变全局优化最小和(VGOMS)算法,以最大程度地减少纠错性能。所提出的VGOMS算法将优化缩放因子应用于可变节点操作的位节点处理,与校验节点操作或可变节点和校验节点操作相比,其复杂度大大降低。在这项研究中,使用了直接的粒子群优化方法来确定最佳缩放比例,以获得算法的最佳纠错性能。所提出的系统模型使用了结合了大规模和小规模效应的信道,该效应在协作通信中得到了广泛使用。将VGOMS算法的性能与四种现有解码算法(MS,OMS,NMS,SP)进行比较,发现在误码率(BER)性能和第一种算法方面都优于原始的最小和(MS)。在求和积(SP)算法之后,从其他3种现有解码算法(MS,OMS,NMS)在错误基底区域中获得最佳BER。因此,VGOMS算法被证明在实现良好的错误性能和降低计算复杂度之间具有明显更好的折衷。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号