[TS36.523-1]:7.1.1.2

p.MsoNormal,li.MsoNormal,div.MsoNormal { margin-top: 0in; margin-right: 0in; margin-bottom: 8.0pt; margin-left: 0in; line-height: 107%; font-size: 11.0pt; font-family: "Calibri", sans-serif }
h3 { margin-top: 2.0pt; margin-right: 0in; margin-left: 0in; margin-bottom: .0001pt; line-height: 107%; page-break-after: avoid; font-size: 12.0pt; font-family: "Calibri Light", sans-serif; color: #1F4D78; font-weight: normal }
h4 { margin-top: 6.0pt; margin-right: 0in; margin-bottom: 9.0pt; margin-left: 70.9pt; text-indent: -70.9pt; page-break-after: avoid; font-size: 12.0pt; font-family: "Arial", sans-serif; font-weight: normal }
h5 { margin-top: 2.0pt; margin-right: 0in; margin-left: 0in; margin-bottom: .0001pt; line-height: 107%; page-break-after: avoid; font-size: 11.0pt; font-family: "Calibri Light", sans-serif; color: #2E74B5; font-weight: normal }
pre { margin: 0in; margin-bottom: .0001pt; font-size: 10.0pt; font-family: "Courier New" }
p.TAL,li.TAL,div.TAL { margin: 0in; margin-bottom: .0001pt; page-break-after: avoid; font-size: 9.0pt; font-family: "Arial", sans-serif }
span.TALChar { font-family: "Arial", sans-serif }
p.TAH,li.TAH,div.TAH { margin: 0in; margin-bottom: .0001pt; text-align: center; page-break-after: avoid; font-size: 9.0pt; font-family: "Arial", sans-serif; font-weight: bold }
p.TAC,li.TAC,div.TAC { margin: 0in; margin-bottom: .0001pt; text-align: center; page-break-after: avoid; font-size: 9.0pt; font-family: "Arial", sans-serif }
span.TACCar { font-family: "Arial", sans-serif }
span.TAHCar { font-family: "Arial", sans-serif; font-weight: bold }
p.TH,li.TH,div.TH { margin-top: 3.0pt; margin-right: 0in; margin-bottom: 9.0pt; margin-left: 0in; text-align: center; page-break-after: avoid; font-size: 10.0pt; font-family: "Arial", sans-serif; font-weight: bold }
span.THChar { font-family: "Arial", sans-serif; font-weight: bold }
p.H6,li.H6,div.H6 { margin-top: 6.0pt; margin-right: 0in; margin-bottom: 9.0pt; margin-left: 99.25pt; text-indent: -99.25pt; page-break-after: avoid; font-size: 10.0pt; font-family: "Arial", sans-serif }
span.H6Char { font-family: "Arial", sans-serif }
p.PL,li.PL,div.PL { margin: 0in; margin-bottom: .0001pt; font-size: 8.0pt; font-family: "Courier New" }
span.PLChar { font-family: "Courier New" }
span.Heading5Char { font-family: "Calibri Light", sans-serif; color: #2E74B5 }
span.HTMLPreformattedChar { font-family: "Courier New" }
span.Heading4Char { font-family: "Arial", sans-serif }
span.Heading3Char { font-family: "Calibri Light", sans-serif; color: #1F4D78 }
span.grame { }
p.h60,li.h60,div.h60 { margin-right: 0in; margin-left: 0in; font-size: 12.0pt; font-family: "Times New Roman", serif }
.MsoPapDefault { margin-bottom: 8.0pt; line-height: 107% }
div.WordSection1 { }

1【测试目的】

DTCH or DCCH mapped to UL SCH/ DL-SCH / Reserved Logical Channel ID

主要测试的是DTCH映射到UL-SCH, DL-SCH 和保留LCID的功能.

2【测试条件】

LTE Rel8 and UEs supporting E-UTRA

3【PASS LOG 信令流程一览】

4【测试步骤】

7.1.1.2            DTCH or DCCH mapped to UL SCH/ DL-SCH / Reserved Logical Channel ID

7.1.1.2.1                    Test Purpose (TP)

(1)

with { UE in E-UTRA RRC_Connected state with DRB [Logical channel ID 3] established }

ensure that {

when { UE receives a MAC PDU on DL SCH and addressed to its CRNTI but including a reserved value for LCID }

then { UE shall not forward the disassembled and demultiplexed SDU on the configured logical channels }

}

(2)

with { UE in E-UTRA RRC_IDLE state and after transmitting a RRCConnectionRequest message }

ensure that {

when { UE receives a MAC PDU on DL SCH and addressed to its CRNTI with value ‘00011’B as LCID }

then { UE shall forward the disassembled and demultiplexed SDU on the corresponding logical channel }

}

}

[LTE R8]

Table 6.2.1-1: Values of LCID for DL-SCH


Index
LCID values

00000
CCCH

00001-01010
Identity of the logical channel

01011-11011
Reserved

11100
UE Contention Resolution Identity

11101
Timing Advance

11110
DRX Command

11111
Padding

[LTE R10]

Table 6.2.1-1 Values of LCID for DL-SCH


Index
LCID values

00000
CCCH

00001-01010
Identity of the logical channel

01011-11010
Reserved

11011
Activation/Deactivation

11100
UE Contention Resolution Identity

11101
Timing Advance Command

11110
DRX Command

11111
Padding

Table 7.1.1.2.3.2-1: Main behaviour


St
Procedure
Message Sequence
TP
Verdict
UE log and comments

U - S
Message

EXCEPTION:

IF UE is Release 8 or Release 9, steps 1 and 2 are repeated for decreasing reserved LCID values from 01011 to 11011

ELSE IF UE is Release 10 onwards, steps 1 and 2 are repeated for decreasing reserved LCID values from 01011 to 11010.
-
-
-
-
// 从UE能力上看，UE is Release10, 所以LCID的范围是01011(11) – 11010(26)

2017 Jan 9 08:10:54.001 [DE] 0xB0C0 LTE RRC OTA Packet -- UL_DCCH / UECapabilityInformation

// UE 收到ACTIVATE TEST MODE,  the TEST MODE is MODE A: DRB

// UE 发送ACTIVATE TEST MODE COMPLETE, 但是APEX上没有该LOG显示

 

// UE 收到CLOSE UE TEST LOOP，开始闭环还回测试

 

// UE发送CLOSE UE TEST LOOP COMPLETE，同样APEX上也没有显示

1
The SS transmits a valid MAC PDU containing a RLC PDU except for LCID in MAC Header set to reserved value .
<--
MAC PDU
-
-
// UE  MAC 收到LCID=11的MAC PDU,  UE丢弃

// UE  MAC 收到LCID=12的MAC PDU,  可以看出LCID的变化为生序，UE丢弃

// UE  MAC 收到LCID=25的MAC PDU,  UE丢弃。但是这是最后一包保留LCID的MAC PDU.这与协议是不相符的，协议规定对于LTE R10，最后一包保留LCID=26.  这应该是安利仪表的一个bug.

2
Check: does the UE transmit a Scheduling Request on PUCCH within 5  seconds after step 1?
-->
(SR)
1
1
F

3
The SS Transmits a valid MAC PDU containing RLC PDU with  LCID in MAC Header set correctly to DRB 00011.
<--
MAC PDU
-
-
// UE  MAC 收到LCID=3的MAC PDU （346/8）,  这是一包合法MAC PDU

4
Check: does the UE transmit a Scheduling Request on PUCCH?
-->
(SR)
2
2
P

// UE send SR at 347/5

2017 Jan  9  08:12:14.327  [CC]  0xB16D  LTE GM TX Report

5
The SS sends an UL grant suitable for the loop back PDU to transmitted
<--
(UL Grant)
-
-
// UE receive the UL GRANT at 347/9

6
Check: does the UE transmit a MAC PDU with LCID set to DRB 00011?
-->
MAC PDU
2
2
P

// UE 发送UL  MAC PDU LCID=3
时间： 2024-10-29 19:12:17

[TS36.523-1]:7.1.1.2的相关文章

nyoj 523 双向广搜

题目链接: http://acm.nyist.net/JudgeOnline/problem.php?pid=523 #include<iostream> #include<cstdio> #include<queue> using namespace std; /* 用普通搜索TLE,已知起点和终点,可以考虑双向广搜或A*算法加速搜索 双向广搜,一个方向从出发点向终点搜索,一个方向从终点向出发点搜索,搜索到相同的结点时,即找到最短路径. */ const int N

HDU 1253 胜利大逃亡 NYOJ 523【BFS】

胜利大逃亡 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24608    Accepted Submission(s): 9427 Problem Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会. 魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的

5-23

MVC(Model/View/Controller)模式是国外用得比较多的一种设计模式,好象最早是在Smaltalk中出现.MVC包括三类对象.Model是应用对象,View是它在屏幕上的表示,Controller定义用户界面对用户输入的响应方式. 模型-视图-控制器(MVC)是80年代Smalltalk-80出现的一种软件设计模式,现在已经被广泛的使用. 1.模型(Model) 模型是应用程序的主体部分.模型表示业务数据,或者业务逻辑. 2.视图(View) 视图是应用程序中用户界面相关的部分

NYOJ 搜索题目汇总 NYOJ 20、21、27、42、58、82、202、284、325、353、488、491、523、592、722

NYOJ 搜索题目汇总 NYOJ 20 #include<iostream> #include<cstdio> #include<cstring> #include<string> #include<vector> #include<algorithm> using namespace std; int pre[100005]; vector<int>v[100005];//存储每个结点相邻的边 void DFS(int

[TS36.523-1]:7.1.1.1

p.MsoNormal,li.MsoNormal,div.MsoNormal { margin-top: 0in; margin-right: 0in; margin-bottom: 8.0pt; margin-left: 0in; line-height: 107%; font-size: 11.0pt; font-family: "Calibri", sans-serif } h5 { margin-top: 2.0pt; margin-right: 0in; margin-lef

CODEFORCES #523 C. GCD Table

题目描述: 有一个序列,给出该序列中的数两两的gcd,并打乱顺序,求原序列. 解题思路: 首先,原序列中的数一定会在新序列中出现,而且gcd(a, b) <= a, b.那么新序列中最大和次大的数一定是原序列中的数,那第三大是不是呢?显然要先去除已经确定的数的两两gcd,再找剩下的数最大数. 代码: 写完才发现写得有点蠢. 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #incl

523

http://www.cnblogs.com/zhengyuhong/p/3485792.html http://www.cnblogs.com/liping13599168/archive/2011/03/31/2000320.html http://m.blog.csdn.net/blog/zh01085105/19414075 http://blog.csdn.net/hw_henry2008/article/details/6439128 http://www.cnblogs.com/z

nyoj 523 亡命逃窜 【BFS】

亡命逃窜 时间限制:1000 ms  |  内存限制:65535 KB 难度:4 描述 从前有个叫hck的骑士,为了救我们美丽的公主,潜入魔王的老巢,够英雄吧.不过英雄不是这么好当的.这个可怜的娃被魔王抓住了,倍受折磨,生死一线.有一天魔王出去约会了,这可是一个千载难逢的逃命机会.你现在的任务就是判断一下这个英雄未遂的孩子能不能在魔王回来之前逃出魔王的城堡,成功逃生,最后迎娶我们美丽的公主. 魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始hck被关在(0,

leetcode 523. Continuous Subarray Sum

Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up to n*k where n is also an integer. Example 1: Input: