首页> 外文期刊>International journal of ad hoc and ubiquitous computing >Graph model for optimal OVSF code placement strategies
【24h】

Graph model for optimal OVSF code placement strategies

机译:最佳OVSF代码放置策略的图形模型

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

摘要

The code utilisation of OVSF-CDMA systems are significantly impacted by the code placement and replacement schemes which have been studied by many researchers as independent problems. We formally define the placement optimality and present a novel graph model, CIDP, which is proved to be NP-complete for general graphs where the C1DP graphs reduced from the OVSF code placement problem are trivial perfect graphs. A unified algorithm UCMS-1, provided to firstly address both OVSF code placement and replacement jointly, achieves placement optimality in linear time complexity. It shows that OVSF code placement optimality problem is in P.
机译:OVSF-CDMA系统的代码利用率受到代码放置和替换方案的极大影响,这些代码放置和替换方案已被许多研究人员研究为独立问题。我们正式定义了布局最优性,并提出了一种新颖的图形模型CIDP,对于一般图形,证明其是NP完全的,其中从OVSF代码布局问题中简化的C1DP图形是平凡的完美图形。提供统一的算法UCMS-1,该算法首先可以同时解决OVSF代码的放置和替换问题,从而实现了线性时间复杂度的放置优化。它表明OVSF代码放置最优性问题在P中。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号