淡江大學機構典藏:Item 987654321/70342
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3942389      Online Users : 1053
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/70342


    Title: Code placement and replacement strategies for wideband CDMA OVSF code tree management
    Authors: Tseng, Y. C.;Chao, C. M.;Wu, S. L.
    Contributors: 淡江大學電機工程學系
    San Antonio, MEXICO
    Date: 2001-11
    Issue Date: 2011-10-23 21:11:42 (UTC+8)
    Publisher: IEEE
    Abstract: The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two important issues in such an environment are the code placement problem and code replacement problem. The former may have significant impact on code utilization and, thus, code blocking probability, while the latter may affect the code reassignment cost if dynamic code assignment is to be conducted. The general objective is to make the OVSF code tree as compact as possible so as to support more new calls by incurring less blocking probability and less reassignment costs. Earlier studies about these two problems either do not consider the structure of the OVSF code tree or cannot utilize the OVSF codes efficiently. To reduce the call blocking probability and the code reassignment cost, we propose two simple yet efficient strategies that can be adopted by both code placement and code replacement: leftmost and crowded-first. Numerical analyses on call blocking probability and bandwidth utilization of OVSF code trees when code reassignment is supported are provided. Our simulation results show that the crowded-first strategy can significantly reduce, for example, the code blocking probability by 77 percent and the number of reassignments by 81 percent, as opposed to the random strategy when the system is 80 percent fully loaded and the max SF = 256.
    Relation: IEEE Global Telecommunications Conference, v.1,pp.293 - 302
    DOI: 10.1109/TMC.2002.1175542
    Appears in Collections:[Graduate Institute & Department of Electrical Engineering] Proceeding

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback