08_ResourceManager_2004
更新时间:2023-07-24 21:24:01 阅读量: 实用文档 文档下载
- 08热搜推荐度:
- 相关推荐
08_ResourceManager_2004
Course Content
Radio Resource Management Overview Parameter Configuration
Common Channels & Power Control Load Control Admission Control Packet Scheduling Handover Control Resource Manager
08_ResourceManager_2004
Course Objectives At the end of the course you will be able to: Explain spreading code allocation strategies Explain code tree usage optimisation and parameters
2
© NOKIA
30/11/2003 RANPAR Version 1.1
08_ResourceManager_2004
Resource Menager
Functions Code Allocation
08_ResourceManager_2004
ResourceManager
The main function of RM is to allocate logical radio resources of BS according to the channel request by the RRC layer for each radio connection The RM is located in the RNC and it works in close co-operation with AC and PS The actual input for resource allocation comes from AC/PS and RMinforms the PS about the resource situation The RM is able to switch codes and code types for different reasons such as soft handover and defragmentation of code tree Manages the BS logical resources
BS reports the available logical HW resourcesTransport resource manager RNC HW manager (L1/L2)
Requests for other resources such as ATM Maintains the code tree
Allocates the DL spreading (=channelization) codes, UL scrambling code, UL spreading (=channelisation) code type
Prevents fragmentation, may cause extraHO's
08_ResourceManager_2004
Resource Manager Downlink: Scrambling code separates the cells and spreading code separates connections Uplink: Scrambling code separates the MS's All physical channels are spread with individual spreading codes, Cm(n) and subsequently by the scrambling code, CFSCR RM generates DL spreading codes
user data spreading scrambling code code
widespread data
5
© NOKIA
30/11/2003 RANPAR Version 1.1
08_ResourceManager_2004
Resource Menager
Functions Code Allocation
08_ResourceManager_2004
Spreading Code Allocation Code Allocation Algorithm chooses the correct spreading code depending on the TFC typeC 2 (0)=(1,1,1,1) C1 (0)=(1,1) C 2 (1)=(1,1,-1,-1) C 0 (0)=(1) C 2 (2)=(1,-1,1,-1) C1 (1)=(1,-1) C 2 (3)=(1,-1,-1,1) C 3 (0)=(…) C 3 (1)=(…) C 3 (2)=(…) C 3 (3)=(…) C 3 (4)=(…) C 3 (5)=(…) C 3 (6)=(…) C 3 (7)=(…)
Code Order 0 (SF 1)
Code Order 1 (SF 2)
Code Order 2 (SF 4)
Code Order 3 (SF 8)
The codes are layered from 0 to 11 according to the Spreading Factor (SF) Cm(n): The code order, m, and the code number, n, designates each and every code in the layered orthogonal code sequences In DL code order 2 to 8 (SF 4 to 512) are available In UL code order 2 to 7 (SF 4 to 256) are available7© NOKIA 30/11/2003 RANPAR Version 1.1
08_ResourceManager_2004
Spreading Code AllocationExample Ordinary downlink speech channel, requires 30 ksps physical capacity (AMR 12.2– 4.75 kbit/s). The code order is 8, which means there are 128 chips to illust
rate one symbol (2n, n=7). If the requested channel is 120kbit/s (including DPCCH and channel coding) data channel, then the type of code is 6. Spreading code cycle depends on the symbol rate.
Code Order 9 8 7 6 5 4 3 2
Channel symbolrate (ksps) 15 30 60 120 240 480 960 1920
Channel bitrate (kbps) 7.5 15 30 60 120 240 480 960
SF 512 256 128 64 32 16 8 4
DPDCH bits/frame 40 160 340 600 1400 2880 6080 12480
8
© NOKIA
30/11/2003 RANPAR Version 1.1
08_ResourceManager_2004
Spreading Code Allocation A code is always allocated from the optimum location in the code tree. It makes the allocated codes and the codes in the branches below and above the allocated code unavailable Code tree will fragment quickly if releases is not re-arranged Re-arrangements in the code tree is done by reallocating the codes in better locations
The above code tree has 4 codes of equal order. The best locations are in the same branch and very close to one another. The badly located codes are released and optimally reallocated allowing the use of upper layer codes9© NOKIA 30/11/2003 RANPAR Version 1.1
08_ResourceManager_2004
CodeTreeOptimisation
The parameter indicates if rearrangement can be applied to a specific cell.range: 0 (optimisationnot used), 1 (optimisationused)default:1;
CodeTreeOptTimer
The parameter defines the timer value that triggers code treeoptimisation, if it is not triggered otherwise.range:1 ... 65535 s, step 1 s
default:3600 s; 1 ... 65535 s, step 1 s
08_ResourceManager_2004
CodeTreeOptimisation
The parameter defines the minimum usage of code tree before rearrangement is applied to a specific cell.range: 0 ... 100 %, step 1 %default:25%;
MaxCodeReleases
The parameter defines the maximum number of code release actions allowed in a code tree before rearrangement is applied to this code tree.range: 1 ... 65535, step 1default25;
08_ResourceManager_2004
Each cell uses one permanent DL scrambling code that is allocated by O&Mandistaken into use when the cell is started. This requires scrambling codeplanning, e.g. for adjacent cells.
PriScrCode
Identifies the downlink scrambling code of the Primary CPICH (Common Pilot Channel) of the Cellrange: 0 ... 511, step 1default:No default
08_ResourceManager_2004
UL scrambling codes are mobile specific and are allocated in connection establishment.
The codes are indexed from 0 to 224(16,777,216). Different UEswithin the same cell should use different UL scrambling codes RM allocates UL scrambling code from a list of codes inside a single RNC.
For example RNC_123 can allocate codes from 1000000 to 1999999 and in the end it starts from 1000000 again.
This allocation unit saves all used codes in a table and checks if allocated code is used or not Since different RNCs allocate their own codes there is a possibility that two mobiles get the same code. With code planning and Iur signaling (negotiating within RNCs) the above problem is avoided.
08_ResourceManager_2004
Scrambling Code Allocation
ULScrCodeMax
Defines the maximum value of the uplink scrambling code. The uplink scrambling code is unique for each MS, and it is used continuously even if the frequency is changed. The first 0...8191 scrambling codes are reserved for future use.range: 8192 ... 16.777.215, step 1default:2.000.000
ULScrCodeMin
Defines the minimum value of uplink scrambling code. The uplink scrambling code is unique for each MS.
range: 8192 ... 16.777.215, step 1default:1.000.000
08_ResourceManager_2004
-ResourceManager-1.
What are the tasks of resource manager?
Chapter8
2.What has the RM to do with the URA?
3.Which type of code allocation will typically be performed by a network planning tool/team?
正在阅读:
计算机基础《Windows》考试试题10-28
广州市建设工程质量检测监管信息网联网检测企业名单(第二批)09-04
2019年春一年级下册数学: 整十数加一位数及相应的减法导学案设计(Word版)03-13
古符离中学安全制度汇编01-27
酒店个人述职报告范文04-10
武隆教研信息01-26
运动会100米通讯稿09-27
微笑的力量作文400字07-15
- 教学能力大赛决赛获奖-教学实施报告-(完整图文版)
- 互联网+数据中心行业分析报告
- 2017上海杨浦区高三一模数学试题及答案
- 招商部差旅接待管理制度(4-25)
- 学生游玩安全注意事项
- 学生信息管理系统(文档模板供参考)
- 叉车门架有限元分析及系统设计
- 2014帮助残疾人志愿者服务情况记录
- 叶绿体中色素的提取和分离实验
- 中国食物成分表2020年最新权威完整改进版
- 推动国土资源领域生态文明建设
- 给水管道冲洗和消毒记录
- 计算机软件专业自我评价
- 高中数学必修1-5知识点归纳
- 2018-2022年中国第五代移动通信技术(5G)产业深度分析及发展前景研究报告发展趋势(目录)
- 生产车间巡查制度
- 2018版中国光热发电行业深度研究报告目录
- (通用)2019年中考数学总复习 第一章 第四节 数的开方与二次根式课件
- 2017_2018学年高中语文第二单元第4课说数课件粤教版
- 上市新药Lumateperone(卢美哌隆)合成检索总结报告
- ResourceManager
- 2004
- 08
- IPMP培训之二(第二部分项目组织与团队)
- 2015网络认证杯A题优秀论文
- presentation--HEMT终稿
- 历史必修一 八国联军侵华与义和团运动
- 安全操作规程Microsoft Word 文档
- 各时期银锭铭文特征
- 何谓压舱水?【国立成功大学】
- 四年级语文教学质量目标及措施
- 急诊科食物中毒突发事件应急预案
- 全新版大学英语综合教程3课后答案.doc
- 美学专题复习资料
- 第4章 汇编语言程序设计
- 2014-2019年中国电力电容器行业市场调查及投资运行态势报告
- 湖北省咸宁市2007年初中毕业生学业考试数学试卷
- 第九章 电力系统稳定的基本概念
- Composite Operators and Topological Contributions in Gauge Theory
- 企业风险管理体系的构建
- 雏鸡饲养技术要点
- 小学语文S版三年级下册期末测试卷
- 控制理论专题:时滞相关鲁棒控制的自由权矩阵方法