請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/39367
標題: | UMTS無線電資源分配之研究 Radio Resource Allocation for Universal Mobile Telecommunications System |
作者: | Chai-Hien Gan 顏在賢 |
指導教授: | 林風(Phone Lin) |
共同指導教授: | 許清琦(Ching-Chi Hsu),林逢慶(Ferng-Ching Lin) |
關鍵字: | 專用通道,共用通道,正交展頻碼, Dedicated Channel,UMTS,Shared Channel,OVSF,WCDMA, |
出版年 : | 2005 |
學位: | 博士 |
摘要: | The {it Universal Mobile Telecommunications System} (UMTS) adopts WCDMA as the air interface to provide variable data rate services. In WCDMA, Orthogonal Variable Spreading Factor (OVSF) codes are assigned to different users to preserve the orthogonality among users' physical channels. The data rate supported by an OVSF code
depends on its Spreading Factor ($SF$). An OVSF code with smaller $SF$ can support higher data rate services than that with larger $SF$s. Four classes of traffics are identified in UMTS, which are conversational, streaming, interactive, and background traffics. The traffic for the conversational and streaming classes has the fairly constant characteristics. The dedicated physical channels (DPCHs) are preferred channels to serve these two classes of traffics. The interactive traffic is highly dependent on request-response patterns of end users, which has the bursty characteristics, and the applications with the background traffic does not request stringent response-time. To efficiently utilize the radio bandwidth, the shared channel technology is proposed to deliver interactive and background traffics. In this dissertation, we study the radio resource allocation for UMTS, where the dedicated and shared channel approaches are considered. For the dedicated code channel assignment, we propose two OVSF code assignment schemes, CADPB1 (Code Assignment with Dynamic Partition and Buffering 1) and CADPB2. Both schemes are simple and only incur low system overhead. The analytic model and simulation experiments are conducted to evaluate the performance of the two schemes. For the shared channel approach, we propose a Shared-Channel Assignment and Scheduling (SCAS) algorithm to allocate shared code channels to interactive and background connections, which incurs low complexity and is considered practical. We formally prove the correctness of the SCAS and also conduct simulation experiments to investigate the performance of the SCAS algorithm. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/39367 |
全文授權: | 有償授權 |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-94-1.pdf 目前未授權公開取用 | 551.65 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。