English  |  正體中文  |  简体中文  |  Items with full text/Total items : 43312/67235
Visitors : 2028179      Online Users : 4
RC Version 5.0 © Powered By DSPACE, MIT. Enhanced by NTU/NCHU Library IR team.

Please use this identifier to cite or link to this item: http://nchuir.lib.nchu.edu.tw/handle/309270000/114253

標題: 3GPP中高效率通道碼配置演算法之研究
Efficient channelization code assignment schemes for 3GPP
作者: 劉炳傳
Liu, Pin-Chuan Flash
Contributors: 陳文賢
Wen-Shyen Eric Chen
國立中興大學
關鍵字: IMT-2000;3GPP;通道碼;OVSF codes;通道碼配置;通道碼交換;碎裂重整
IMT-2000;3GPP;channelization code;OVSF code;channelization code assignment;channelization code exchange;fragmental nodes
日期: 2000
Issue Date: 2012-09-11 09:18:27 (UTC+8)
Publisher: 資訊科學研究所
摘要: 在IMT-2000 [1] 的DS-CDMA規範中,每個channel都使用不同的channelization code。而3GPP [2] 所建議的規格中,channelization code的產生是使用OVSF (Orthogonal Variable Spreading Factor) code tree的架構。在這個樹狀結構下,OVSF codes的使用與產生有很多的限制。在無線通訊系統中,OVSF codes是一項很重要的資源,需要有計畫的管理配置,才能讓系統內有限頻寬的效能發揮到最高。
在本篇論文中,我們假設每個User Equipment (UE)都能同時使用數個codes,並且不限於使用相同速率的channelization codes;而UE在要求頻寬的時候也要同時傳送其擁有的接收機數目,如此UTRAN端可以確定UE所能接受的codes的數目。我們提出一個有效的channelization code配置演算法,期望讓系統在有限的資源下服務最多的使用者。
此外,在經過長時間的channelization code分配與釋放,OVSF code tree會產生許許多多的碎裂情況。我們也提出一個channelization code交換的機制,能重整OVSF code tree,降低碎裂的情況。另外還提供一個演算法計算OVSF code tree的碎裂程度。最後我們以模擬的方式,驗證我們的演算法及研究碎裂重整的門檻值。
In the DS-CDMA system of IMT-2000 [1], each channel is spread by different channelization code. And in the specification of 3GPP [2], the channelization codes are generated by the Orthogonal Variable Spreading Factor (OVSF) code tree structure and have some restrictions in code usage. In the wireless communication system, the OVSF codes are the most important resource and need to manage carefully.
In our research, we assume that each User Equipment (UE) can use multiple code channels that have different transmission data rate simultaneously. And the UE will report the number of receivers that it has within the bandwidth request message. Therefore, the UTRAN can ensure the capacity of UE. We propose some efficient channelization code assignment algorithm and hope that the system can services more users in the limited resource environment.
After a sequence code allocations and releases, the OVSF code tree may has a lot of fragmental nodes. We also propose a code exchange scheme to gather the fragmented nodes together. An algorithm is also devised to measure the fragmental degree in the OVSF code tree. Finally, we validate the proposed channelization code assignment scheme and the proposed code exchange scheme by simulations.
Appears in Collections:[依資料類型分類] 碩博士論文

Files in This Item:

There are no files associated with this item.



 


學術資源

著作權聲明

本網站為收錄中興大學學術著作及學術產出,已積極向著作權人取得全文授權,並盡力防止侵害著作權人之權益。如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員,將盡速為您處理。

本網站之數位內容為國立中興大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用。

聯絡網站維護人員:wyhuang@nchu.edu.tw,04-22840290 # 412。

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