ASIA unversity:Item 310904400/2067
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21693701      線上人數 : 653
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/2067


    題名: Utilization Optimization for OVSF Multi-code Assignment in WCDMA Networks
    作者: HSIN-LI LIN;HUI-FUANG NG;JUI-CHI CHEN
    貢獻者: Department of Computer Science and Information Engineering, Asia University
    關鍵詞: WCDMA;OVSF code;multi-code
    日期: 2007
    上傳時間: 2009-10-13 07:20:13 (UTC+0)
    出版者: Asia University
    摘要: 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
    顯示於類別:[Asian Journal of Health and Information Sciences] v.2 n.1-4

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    04.pdf261KbAdobe PDF724檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


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