...
首页> 外文期刊>Telecommunication systems: Modeling, Analysis, Design and Management >Vacant codes grouping and fast OVSF code assignment scheme for WCDMA networks
【24h】

Vacant codes grouping and fast OVSF code assignment scheme for WCDMA networks

机译:WCDMA网络的空码分组和快速OVSF码分配方案

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

摘要

Channelization codes used in WCDMA are Orthogonal Variable Spreading Factor (OVSF) codes. These codes suffer from code blocking limitation. Many designs are proposed to avoid this limitation but most of them do not consider number of codes searched, which affects call establishment delay prior to handling a call. We propose a fast OVSF code assignment design which aims to reduce number of codes searched with optimal/suboptimal code blocking. The code assignment scheme aims to use those vacant codes whose parents are already blocked. This leads to occurrence of more vacant codes in groups, which ultimately leads to less code blocking for higher rate calls. The number of codes searched increases linearly in our design compare to most of other novel proposed single code methods like crowded first assignment, where it increases exponentially with increase in user rates. Also the calculation of vacant codes at one layer will be sufficient to identify the vacant code adjacency for all the layers which reduces complexity. Simulation results are presented to verify the superiority of the design.
机译:WCDMA中使用的信道化代码是正交可变扩频因子(OVSF)代码。这些代码受代码阻塞限制。提出了许多设计来避免这种限制,但是大多数设计都没有考虑搜索到的代码数量,这会影响处理呼叫之前的呼叫建立延迟。我们提出了一种快速的OVSF代码分配设计,旨在减少使用最佳/次优代码阻塞搜索的代码数量。代码分配方案旨在使用其父母已被阻止的空代码。这导致组中出现更多的空闲代码,最终导致更高速率呼叫的代码阻塞更少。与大多数其他新颖的提议的单一代码方法(如拥挤的第一次分配)相比,我们设计中搜索到的代码数量呈线性增加,后者随着用户使用率的增加呈指数增长。同样,在一层上的空码的计算将足以识别所有层的空码邻接,这降低了复杂性。仿真结果表明了该设计的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号