ASIA unversity:Item 310904400/18586
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21718832      在线人数 : 249
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/18586


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/18586


    题名: Utilization Optimization for OVSF Multi-code Assignment in WCDMA Networks
    作者: 陳瑞奇;Chen, Jui-Chi;黃惠藩;Ng, Hui-Fuang;林新力;Lin, Hsin-Li
    贡献者: 資訊工程學系
    关键词: mobile networks;WCDMA;OVSF code;multi-code
    日期: 2007-12
    上传时间: 2012-11-26 05:55:37 (UTC+0)
    摘要: Radio resources, such as WCDMA OVSF codes, are scarce and valuable in cellular mobile networks, necessitating the need for their efficient use by network operators. Many OVSF code-assignment schemes for WCDMA networks have been widely studied. This paper proposes an evaluation model to accurately predict OVSF multi-code assignment performance in WCDMA networks. Theoretical and simulation results indicate that the proposed analytical model works to evaluate the multi-code assignment performance. Two important performance measures, call blocking probability (CBP) and bandwidth utilization (BU), are then adopted to solve a utilization optimization problem for WCDMA network planning and re-planning. The optimization problem applies a given traffic statistic and a specified maximum CBP constraint to maximize the BU by discovering the optimal number of basic-rate codes in a Node-B. Consequently, the operators will be able to use the results to deploy their codes flexibly, and to improve their profitability.
    關聯: Asian Journal of Health and Information Sciences,2(1-4):49-65.
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML427检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈