首页> 外文会议>International Conference on Computing, Communication and Automation >Flexible fixed set portioning and performance improvement in OVSF based networks
【24h】

Flexible fixed set portioning and performance improvement in OVSF based networks

机译:基于OVSF的网络灵活的固定集合分配和性能改进

获取原文

摘要

The limited codes in orthogonal variable spreading factor (OVSF) based CDMA networks need efficient code assignment. With the continuous progress in code assignment research, the efficiency reaches close to 100 percent. However, the cost and complexity in these schemes increases significantly. For real time calls there is an additional requirement of minimizing call establishment delay which is directly proportional to the number of code searches before assignment. Therefore to design a good code assignment scheme the system has to sacrifice some performance measure. Fixed set partitioning (FSP) is known to be the best method for real time calls handling. This paper describes a flexible fixed set partitioning (FFSP) scheme which is the extension of FSP scheme. The scheme is suited for real time applications as the code searches (which reduces to call establishment delay) in the proposed scheme are fewer than most of the proposed schemes. The code searches are higher in FFSP schemes as compared to FSP scheme, and also the code blocking probability is significantly reduced due to flexibility of controlled region overlapping. The simulation results verify the reduction in number of code searches.
机译:基于正交可变扩展因子(OVSF)的CDMA网络中的有限代码需要有效的代码分配。随着代码分配研究的不断进展,效率达到100%。然而,这些方案中的成本和复杂性显着增加。对于实时调用,还需要最小化呼叫建立延迟的额外要求,该延迟与分配之前的代码搜索数量成正比。因此,设计一个好的代码分配方案,系统必须牺牲一些性能措施。已知固定集分区(FSP)是实时调用处理的最佳方法。本文介绍了一种灵活的固定集合分区(FFSP)方案,其是FSP方案的扩展。该方案适用于实时应用,因为在所提出的方案中的代码搜索(降低到呼叫建立延迟)的代码搜索少于大多数所提出的方案。与FSP方案相比,FFSP方案中的代码搜索较高,并且由于受控区域重叠的灵活性,代码阻塞概率也显着降低。仿真结果验证了代码搜索数量的减少。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号