Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊工程學系
請用此 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 kBAdobe PDF
顯示文件完整紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved