Académique Documents
Professionnel Documents
Culture Documents
HSUPA Description
Issue Date
02 2008-07-30
Huawei Technologies Co., Ltd. provides customers with comprehensive technical support and service. For any assistance, please contact our local office or company headquarters.
Website: Email:
http://www.huawei.com support@huawei.com
Notice
The information in this document is subject to change without notice. Every effort has been made in the preparation of this document to ensure accuracy of the contents, but all statements, information, and recommendations in this document do not constitute the warranty of any kind, expressed or implied.
Contents
Contents
1 HSUPA Change History .......................................................................................................1-1 2 HSUPA Introduction ............................................................................................................2-1 3 HSUPA Principles.................................................................................................................3-1
3.1 HSUPA Protocol Architecture ................................................................................................................. 3-1 3.2 HSUPA Channel Mapping ...................................................................................................................... 3-2 3.2.1 Mapping of Services onto The E-DCH ........................................................................................... 3-2 3.2.2 Mapping of Logical Channels onto Transport Channels .................................................................. 3-2 3.2.3 Mapping of Transport Channels onto Physical Channels................................................................. 3-3 3.3 HSUPA Physical Channels...................................................................................................................... 3-4 3.3.1 E-DPCCH ..................................................................................................................................... 3-4 3.3.2 E-DPDCH ..................................................................................................................................... 3-6 3.3.3 E-AGCH ....................................................................................................................................... 3-6 3.3.4 E-RGCH........................................................................................................................................ 3-9 3.3.5 E-HICH....................................................................................................................................... 3-12 3.4 HSUPA Physical Channel Timing ......................................................................................................... 3-13 3.4.1 E-DPDCH/E-DPCCH Timing Relative to the DPCCH ................................................................. 3-13 3.4.2 E-AGCH Timing Relative to the P-CCPCH.................................................................................. 3-13 3.4.3 E-RGCH Timing Relative to the P-CCPCH.................................................................................. 3-14 3.4.4 E-HICH Timing Relative to the P-CCPCH ................................................................................... 3-15 3.4.5 Association Between Frames of Different Physical Channels........................................................ 3-15 3.5 HSUPA Key Technologies .................................................................................................................... 3-17 3.5.1 HSUPA HARQ ............................................................................................................................ 3-17 3.5.2 HSUPA Short TTI........................................................................................................................ 3-19 3.5.3 HSUPA Fast Scheduling............................................................................................................... 3-19 3.6 MAC-e PDU Generation....................................................................................................................... 3-19 3.6.1 MAC-e PDU Overview................................................................................................................ 3-19 3.6.2 MAC-e PDU Generation Process ................................................................................................. 3-20 3.6.3 MAC-e PDU Encapsulation ......................................................................................................... 3-25
4 HSUPA Algorithms...............................................................................................................4-1
4.1 Overview of HSUPA Related Algorithms ................................................................................................ 4-1 4.1.1 Algorithm of HSUPA Fast Scheduling............................................................................................ 4-1 4.1.2 Algorithm of Flow Control............................................................................................................. 4-1 Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright Huawei Technologies Co., Ltd i
Contents
RAN HSUPA Description 4.1.3 Algorithm of CE Allocation ........................................................................................................... 4-1 4.1.4 Relation Among HSUPA Algorithms.............................................................................................. 4-2
4.2 HSUPA Fast Scheduling ......................................................................................................................... 4-2 4.2.1 Overview of HSUPA Scheduling.................................................................................................... 4-2 4.2.2 User Queuing in the Scheduling Algorithm..................................................................................... 4-4 4.2.3 AG UP Processing in the Scheduling Algorithm ............................................................................. 4-6 4.2.4 RG UP Processing in the Scheduling Algorithm ............................................................................. 4-9 4.2.5 GBR Processing in the Scheduling Algorithm................................................................................. 4-9 4.2.6 MBR Processing in the Scheduling Algorithm.............................................................................. 4-10 4.3 HSUPA Flow Control ............................................................................................................................4-11 4.3.1 Overview of HSUPA Flow Control................................................................................................4-11 4.3.2 Adjusting the Maximum Available Bandwidth of the Iub Port ....................................................... 4-12 4.3.3 Adjusting the Available Bandwidth of HSUPA ............................................................................. 4-14 4.3.4 Handling Iub Buffer Congestion................................................................................................... 4-14 4.4 Dynamic CE Resource Management ..................................................................................................... 4-15 4.5 Other HSUPA Related Algorithms......................................................................................................... 4-20 4.5.1 HSUPA Cell Load Control ........................................................................................................... 4-20 4.5.2 HSUPA DCCC............................................................................................................................. 4-20 4.5.3 HSUPA Power Control................................................................................................................. 4-21 4.5.4 HSUPA Mobility Management..................................................................................................... 4-21 4.5.5 HSUPA Directed Retry ................................................................................................................ 4-22
ii
Issue 02 (2008-07-30)
1
Document and Product Versions
Document Version 02 (2008-07-30) 10.0
HSUPA Change History provides information on the changes between different document versions.
Table 1-1 Document and product versions RAN Version RNC Version V200R010C01B061 NodeB Version V100R010C01B050 V200R010C01B041 01 (2008-05-30) 10.0 V200R010C01B051 V100R010C01B049 V200R010C01B040 Draft (2008-03-20) 10.0 V200R010C01B050 V100R010C01B045
Feature change: refers to the change in the HSUPA feature of a specific product version. Editorial change: refers to changes in information that has already been included, or the addition of information that was not provided in the previous version.
02 (2008-07-30)
This is the document for the second commercial release of RAN10.0. Compared with 01 (2008-05-30) of RAN10.0, issue 02 (2008-07-30) of RAN10.0 incorporates the changes described in the following table. Change Type Feature change Change Description Dynamic CE Resource Management is optimized For details, refer to 4.4 Dynamic CE Resource Management Parameter Change
l
The parameters that are changed to be non-configurable are listed as follows: Happy bit delay time HSUPA service rate extend scale
l l
Issue 02 (2008-07-30)
1-1
Change Type
Change Description
Parameter Change
l l l
Editorial change
None.
01 (2008-05-30)
This is the document for the first commercial release of RAN10.0. Compared with draft (2008-03-20) of RAN10.0, issue 01 (2008-05-30) of RAN10.0 incorporates the changes described in the following table. Change Type Feature change Change Description None. Parameter Change The parameters that are changed to be non-configurable are listed as follows:
l l
Editorial change
None.
The HSUPA Parameters is removed because of the creation of RAN10.0 parameter reference. The structure is optimized.
Draft (2007-03-20)
This is a draft of the document for the first commercial release of RAN10.0. Compared with issue 03 (2008-01-20) of RAN 6.1, this issue incorporates the changes described in the following table: Change Type Feature change Change Description SRB can be carried on E-DCH. The algorithm of HSUPA scheduled transmission is changed. The algorithm of HSUPA flow control is changed. The algorithm of HSUPA CE scheduling is introduced. Parameter Change None. None. None. None.
1-2
Issue 02 (2008-07-30)
Issue 02 (2008-07-30)
1-3
2 HSUPA Introduction
2
l l l
HSUPA Introduction
HSUPA (High Speed Uplink Packet Access) is an important feature of 3GPP R6. As an uplink (UL) high speed data transmission solution, HSUPA provides a theoretical maximum uplink MAC-e rate of 5.73 Mbit/s on the Uu interface. The MAC-e peak data rate supported by Huawei RAN10.0 is 5.73 Mbit/s. The main features of HSUPA are as follows: 2 ms short frame: It enables less Round Trip Time (RTT) in the Hybrid Automatic Repeat reQuest (HARQ) process, which is controlled by NodeB. It also shortens the scheduling response time. HARQ at the physical layer: It is used to achieve rapid retransmission for erroneously received data packets between the User Equipment (UE) and NodeB. NodeB-controlled UL fast scheduling: It is used to increase resource utilization and efficiency.
HSUPA improves the performance of the UMTS network in the following aspects:
l l l l l l l l l l l l l l l l
Higher UL peak data rate Lower latency: enhancing the subscriber experience with high-speed services Faster UL resource control: maximizing resource utilization and cell throughput Better Quality of Service (QoS): improving the QoS of the network UL peak rate: 5.73 Mbit/s per user 10 ms and 2 ms TTI Maximum 60 HSUPA users per cell Soft handover and softer handover Multiple RABs (3 PS) Dedicated/co-carrier with R99 UE categories 1 to 6 Basic load control OLPC for E-DCH Iub flow control CE scheduling Power control of E-AGCH/E-RGCH/E-HICH
Issue 02 (2008-07-30)
2-1
2 HSUPA Introduction
= NE involved
UE = User Equipment, RNC = Radio Network Controller, MSC Server = Mobile Service Switching Center Server, MGW = Media Gateway, SGSN = Serving GPRS Support Node, GGSN = Gateway GPRS Support Node, HLR = Home Location Register
Impact
l
Impact on System Performance Compared with 3GPP R99, 3GPP R6 introduces HSUPA to provide a significant enhancement in the uplink in terms of peak data rate and cell throughput, a shorter latency, and a good balance between downlink and uplink.
Impact on Other Features The impact of HSUPA on the other features is as follows:
HSUPA does not affect the effectiveness of the other features. The implementation of HSUPA requires the support of power control, load control, admission control, and mobility management. HSUPA and the other features have an impact on each other. For detailed information, see Other HSUPA Related Algorithms.
2-2
Issue 02 (2008-07-30)
3 HSUPA Principles
3
l l l l l l
HSUPA Principles
The principles of HSUPA cover the technical aspects of the feature: HSUPA Protocol Architecture HSUPA Channel Mapping HSUPA Physical Channels HSUPA Physical Channel Timing HSUPA Key Technologies MAC-e PDU Generation
To enhance the Access Stratum (AS), HSUPA is implemented in the following ways:
l
A new MAC entity (MAC-es/MAC-e) is added to UE below the MAC-d to handle HARQ retransmission, scheduling, MAC-e multiplexing, and E-DCH Transport Format Combination (E-TFC) selection.
Issue 02 (2008-07-30)
3-1
3 HSUPA Principles
l l l
A new MAC entity (MAC-e) is added to NodeB to handle the HARQ retransmission, scheduling, and MAC-e demultiplexing. A new MAC entity (MAC-es) is added to SRNC to combine signals from different NodeBs in soft handover and deliver data to the MAC-d in sequence. A new transport channel (E-DCH) is added to transfer data blocks between NodeB MAC-e and SRNC MAC-es.
The HSUPA data flow is as follows: Step 1 The MAC-es/MAC-e of the UE sends the MAC-e PDUs to the physical layer (PHY) of UE. Step 2 The MAC-e of NodeB sends the MAC-es PDUs through E-DCH FP to the MAC-es of SRNC. Step 3 The E-DCH FP of Iub interface controls the data flow between NodeB MAC-e and SRNC MAC-es. Step 4 The MAC-es of SRNC sends MAC-d PDUs to SRNC MAC-d. ----End With HSUPA, the Universal Terrestrial Radio Access Network (UTRAN) supports higher-rate transmission. Accordingly, the Packet Switched Core Network (PS CN) requires a higher rate of service assignment, user plane transmission, and switching.
Mapping services information on the E-DCH, Mapping of logical channels onto the transport channels Mapping of transport channels onto the physical channels
3-2
Issue 02 (2008-07-30)
3 HSUPA Principles
Figure 3-2 Mapping of logical channels onto transport channels on the UE side
Figure 3-3 Mapping of logical channels onto transport channels on the UTRAN side
Issue 02 (2008-07-30)
3-3
3 HSUPA Principles
3.3.1 E-DPCCH
The E-DCH Dedicated Physical Control Channel (E-DPCCH) carries the control information associated with the E-DCH. Each radio link has at most one E-DPCCH. The spreading factor of the E-DPCCH is 256.
3-4
Issue 02 (2008-07-30)
3 HSUPA Principles
Retransmission Sequence Number (RSN): 2 bits E-TFC Indicator (E-TFCI): 7 bits Happy Bit: 1 bit
E-TFCI: 7 Bits
E-TFCI is used on the current E-DPDCH. There are four transport block size tables defined in 3GPP 25.321. Each TTI has two tables, the details for which are as follows:
l l l l
2 ms TTI E-DCH Transport Block Size Table 0 2 ms TTI E-DCH Transport Block Size Table 1 10 ms TTI E-DCH Transport Block Size Table 0 10 ms TTI E-DCH Transport Block Size Table 1
Table 0 or Table 1 is selected according to the signaling from the RNC.The E-TFCI Table Index is 0 for V oip service and 1 for all the others. With the table, the E-TFCI can be mapped to a transport block size.
Issue 02 (2008-07-30)
3-5
3 HSUPA Principles
For every E-DCH transmission, the Happy Bit is set to Unhappy if the following conditions are met:
l l l
The UE transmits as much scheduled data as allowed by the current SG during E-TFC selection. The UE has enough power to transmit data at a higher rate. Based on the same power offset as the one selected during E-TFC selection to transmit data in the same TTI as the Happy Bit, the Total E-DCH Buffer Status (TEBS) may require more than Happy bit delay time which equals to 50 ms to be transmitted with the current SG multiplied by the ratio of the number of active processes to the total number of processes.
3.3.2 E-DPDCH
The E-DCH Dedicated Physical Data Channel (E-DPDCH) carries the data associated with the E-DCH. Each radio link can have none, one, or several E-DPDCHs. The spreading factor of the E-DPDCH ranges from 2 to 256.
RAN10.0 provides a maximum of four E-DPDCHs with two SF4s and two SF2s.
Generally, the E-DPDCH and the E-DPCCH are transmitted simultaneously, except with the power scaling as described in 3GPP TS 25.214, the E-DPCCH is transmitted discontinuously.
3.3.3 E-AGCH
The E-DCH Absolute Grant Channel (E-AGCH) carries AGs for uplink E-DCH scheduling. The E-AGCH is a common downlink physical channel with a fixed rate of 30 kbit/s. The spreading factor of the E-AGCH is 256. The E-AGCH is a shared channel for all HSUPA UE in the serving E-DCH cell.
3-6
Issue 02 (2008-07-30)
3 HSUPA Principles
An E-DCH AG has to be carried by one E-AGCH subframe or one E-AGCH frame, depending on the E-DCH TTI is 2 ms or 10 ms. The information transmitted on the E-AGCH includes a 5-bit field of the AG value and a 1-bit field of the AG scope.
l l
The AG value indicates the maximum power ratio of the E-DPDCH to the corresponding DPCCH. The mapping of AG values is described in Table 3-1. The AG scope indicates whether the HARQ process activation or deactivation will affect one or all of the processes. The AG scope can take two different values: "Per HARQ process" or "All HARQ processes".
"Per HARQ process" means that the AG is for one HARQ process. "All HARQ processes" means that the AG is for all HARQ processes.
When the E-DCH is configured with 10 ms TTI, only the value "All HARQ processes" is valid. For detailed information on SG update, see HSUPA Serving Grant Update (subclause 11.8.1.3 in 3GPP 25.321). The RNC-assigned sequence of 16-bit CRC on the E-AGCH is masked with either a primary or a secondary E-RNTI. Here, the E-RNTI stands for E-DCH Radio Network Temporary Identifier.
l l
The primary E-RNTI is unique for each UE. The secondary E-RNTI is usually for a group of UEs.
When the UE demodulates the E-AGCH, the E-AGCH will again mask the CRC with the primary or secondary E-RNTI. Only the UE having the same E-RNTI can demodulate the information correctly. Only the primary E-RNTI is used in the current RAN version.
Issue 02 (2008-07-30)
3-7
3 HSUPA Principles
Table 3-1 Mapping of AG values Absolute Grant Value (168/15)2 x 6 (150/15)2 x 6 (168/15)2 x 4 (150/15)2 x 4 (134/15)2 x 4 (119/15)2 x 4 (150/15) x 2 (95/15) x 4 (168/15)2 (150/15)2 (134/15)2 (119/15)2 (106/15)2 (95/15)2 (84/15)2 (75/15)2 (67/15)2 (60/15)2 (53/15)2 (47/15)2 (42/15)2 (38/15)2 (34/15)2 (30/15)2 (27/15)2 (24/15)2 (19/15)2 (15/15)2 (11/15)2 (7/15)2
2 2
Index 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2
3-8
Issue 02 (2008-07-30)
3 HSUPA Principles
Index 1 0
3.3.4 E-RGCH
The E-DCH Relative Grant Channel (E-RGCH) carries RGs for uplink E-DCH scheduling. The E-RGCH is a dedicated downlink physical channel with a fixed rate of 60 kbit/s. The spreading factor of the E-RGCH is 128. Figure 3-8 Frame structure of the E-RGCH
An RG is transmitted in 3, 12, or 15 consecutive slots. Each slot carries a sequence of 40 binary values.
l l
If the cell transmitting the E-RGCH is in the serving E-DCH Radio Link Set (RLS), then 3 or 12 slots are used, depending on the E-DCH TTI is 2 ms or 10 ms. If the cell transmitting the E-RGCH is not in the serving E-DCH RLS, 15 slots are used.
The RG commands are mapped to the RG values, as described in the following table. Table 3-2 Mapping of RG commands RG Command UP HOLD DOWN RG Value (for Serving E-DCH RLS) 1 0 1 RG Value (for Non-Serving E-DCH RL) Not allowed 0 1
When the UE receives an RG command, the SG is adjusted upwards or downwards by one step. The step can be 1, 2, or 3 in the Scheduling Grant Table according to the current SG
Issue 02 (2008-07-30)
3-9
3 HSUPA Principles
value, E-RGCH 3-Index-Step Threshold whose value is 17 for 2ms TTI and 9 for 10ms TTI, and E-RGCH 2-Index-Step Threshold. Wose value is 18 for 2ms TTI and 12 for 10ms TTI. The Scheduling Grant Table is provided in Table 3-3. When the SG needs to be determined due to E-RGCH signaling:
l
The UE determines the lowest power ratio and the corresponding index in the Scheduling Grant Table: SGIndexLUPR. The lowest power ratio is in the Scheduling Grant Table (Table 3-3), and is equal to, or higher than the reference_ETPR. The reference_ETPR is the power ratio of E-DPDCH to DPCCH. The ratio is used for the E-TFC selected for the previous TTI in this HARQ process and calculated by the amplitude ratios prior to the quantization according to 4.5.3 HSUPA Power Control.
If the UE receives a serving RG "UP", the UE determines the SG (based on the "3-index-step threshold" and "2-index-step threshold" configured by higher layers) as follows: If SGIndexLUPR < 3-index-step threshold, then SG = SG [MIN (SGLUPR + 3, 37)]. For example, if SGIndexLUPR = 15 and 3-index-step threshold = 20, then the new SG index is 18. If 3-index-step threshold SGIndexLUPR < 2-index-step threshold, then SG = SG [MIN (SGLUPR + 2, 37)]. For example, if SGIndexLUPR = 21 and 2-index-step threshold = 25, then the new SG index is 23. If SGLUPR 2-index-step threshold, then SG = SG [MIN (SGLUPR + 1, 37)]. For example, if the SGIndexLUPR = 28 and 2-index-step threshold = 25, then the new SG index is 29. If the UE receives an RG "DOWN", then SG = SG[MAX (SGLUPR - 1, 0)]. SG = SG[SGIndex] which means to get an SG from the Scheduling Grant Table according to the SGIndex.
l l l l l l l l
Table 3-3 Scheduling Grant Table Index 37 36 35 34 33 32 31 30 29 28 27 Scheduled Grant (168/15)2 x 6 (150/15)2 x 6 (168/15)2 x 4 (150/15)2 x 4 (134/15)2 x 4 (119/15)2 x 4 (150/15)2 x 2 (95/15)2 x 4 (168/15)2 (150/15)2 (134/15)2
3-10
Issue 02 (2008-07-30)
3 HSUPA Principles
Index 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
Scheduled Grant (119/15)2 (106/15)2 (95/15)2 (84/15)2 (75/15)2 (67/15)2 (60/15)2 (53/15)2 (47/15)2 (42/15)2 (38/15)2 (34/15)2 (30/15)2 (27/15)2 (24/15)2 (21/15)2 (19/15)2 (17/15)2 (15/15)2 (13/15)2 (12/15)2 (11/15)2 (9/15)2 (8/15)2 (7/15)2 (6/15)2 (5/15)2
Issue 02 (2008-07-30)
3-11
3 HSUPA Principles
3.3.5 E-HICH
The E-DCH Hybrid ARQ Indicator Channel (E-HICH) carries uplink E-DCH HARQ acknowledgement indicators. The E-HICH is a dedicated downlink physical channel with a fixed rate of 60 kbit/s. The spreading factor of the E-HICH is 128. The frame structure of the E-HICH is the same as that of the E-RGCH. An HARQ acknowledgement indicator is transmitted in 3 or 12 consecutive slots and in each slot a sequence of 40 binary values is transmitted as follows:
l l
3 slots are used for the UE with 2 ms E-DCH TTI. 12 slots are used for the UE with 10 ms E-DCH TTI.
The ACK and NACK mappings on the E-HICH are described in the following table. For the RLSs that do not contain the serving E-DCH cell, the NACK is transmitted discontinuously. Table 3-4 Mapping of HARQ acknowledgement Command ACK NACK (for the RLSs not containing the serving E-DCH cell) NACK (for the RLS containing the serving E-DCH cell) HARQ Acknowledgement Indicator +1 0 1
When an ACK and an NACK are received at the same time, the UE combines them as shown in the following table.
3-12
Issue 02 (2008-07-30)
3 HSUPA Principles
Table 3-5 ACK/NACK combining Transmission Data Type ACK/NACK from Serving RLS ALL NACK ACK/NACK from Non-Serving RLs ALL NACK Operation of UE
All data
The UE performs HARQ (re)transmissions until the maximum number of transmissions is reached. ACK ACK The UE notifies the Scheduling Information Reporting function that the Scheduling Information is not received by the serving the RLS, flushes the packet, and includes the scheduling information with new data payload in the next packet. The UE performs HARQ (re)transmissions until an ACK from the RLS containing the serving cell is received or until the maximum number of transmissions is reached.
All data High-level data only Higher layer data and SI triggered by an event or timer
SI only
ALL NACK
Issue 02 (2008-07-30)
3-13
3 HSUPA Principles
If the E-RGCH is transmitted to the UE, and the cell transmitting the E-RGCH is in the serving E-DCH RLS, the E-RGCH frame offset should be as follows:
l
If the E-DCH TTI is 10 ms, the E-RGCH frame offset from the P-CCPCH is chips.
In this case,
l
If the E-DCH TTI is 2 ms, the E-RGCH frame offset from the P-CCPCH is chips.
3-14
Issue 02 (2008-07-30)
3 HSUPA Principles
If the E-RGCH is transmitted to the UE, and the cell transmitting the E-RGCH is not in the serving E-DCH RLS, the E-RGCH frame offset from the P-CCPCH should be 5120 chips. =
If the E-DCH TTI is 10 ms, the E-HICH frame offset from the P-CCPCH should be chips.
If the E-DCH TTI is 2 ms, the E-HICH frame offset from the P-CCPCH should be chips.
Issue 02 (2008-07-30)
3-15
3 HSUPA Principles
For each cell that belongs to the serving E-DCH RLS: The UE first takes into account the E-DCH control information received through the E-RGCH frame SFNi in the higher layer procedures that correspond to the E-DCH transmission in the E-DPDCH frame SFNi+1. For each cell that does not belong to the serving E-DCH RLS: The UE first takes into account the E-DCH control information received through the E-RGCH frame SFNi in the higher layer procedures that correspond to the E-DCH transmission in the E-DPDCH frame SFNi+1+s, Where,
For the E-AGCH frame: The UE first takes into account the E-DCH control information received through the E-AGCH frame SFNi in the higher layer procedures that correspond to the E-DCH transmission in the E-DPDCH frame SFNi+1+s, Where,
2 ms E-DCH TTI For each cell in the E-DCH active set: The UE associates the E-DCH control information received through subframe j of the E-HICH frame SFNi with subframe t of the E-DPDCH frame SFNi-s, Where: and .
For each cell that belongs to the serving E-DCH RLS: The UE first takes the E-DCH control information received through subframe j of the E-RGCH frame SFNi into account in the higher layer procedures that correspond to the E-DCH transmission in subframe j of the E-DPDCH frame SFNi+1. For each cell that does not belong to the serving E-DCH RLS: The UE first takes the E-DCH control information received through the E-RGCH frame SFNi into account in the higher layer procedures that correspond to the E-DCH transmission in sub-frame t of the E-DPDCH frame SFNi+1+s, where
3-16
Issue 02 (2008-07-30)
3 HSUPA Principles
and For the E-AGCH frame, UE first takes the E-DCH control information received through sub-frame j of the E-AGCH frame SFNi into account in the higher layer procedures that correspond to E-DCH transmission in sub-frame t of the E-DPDCH frame SFNi+s, where
and
HARQ Entity
In the UE, the HARQ entity is located in MAC-es/MAC-e. The HARQ entity can store the MAC-e payloads and retransmit them. The RRC can configure the HARQ over MAC-controlled Service Access Point (SAP). In the NodeB, the HARQ entity is located in MAC-e. Each process is responsible for generating ACKs or NACKs, which indicate the status of E-DCH transmissions. The HARQ entity has the following parameters:
l l l
E-TFC Retransmission Sequence Number (RSN) Power offset: used to calculate the power ratio of E-DPDCH to UL DPCCH
The E-TFC and the power offset are decided by HSUPA E-TFC Selection. RSN (2-bit) is sent from the UE to the NodeB. If the number of transmissions is larger than three, the RSN is set to 3. The RSN can help to indicate the Redundancy Version (RV) of each HARQ transmission and to assist in the NodeB soft buffer management.
Issue 02 (2008-07-30)
3-17
3 HSUPA Principles
If more than three consecutive E-DPCCH transmissions in the HARQ process cannot be decoded or the last received RSN is incompatible with the current one, the NodeB flushes the soft buffer associated with the HARQ process to ensure that the soft buffer is in a good condition.
Redundancy Version
Redundancy Version (RV) defines the selection of bits that can be transmitted on the air interface resource, which is known as the rate matching pattern. The RV can be derived by L1 from RSN and Connection Frame Number (CFN), or in the case of 2 ms TTI from the subframe number. The E-DCH RV index specifies the used RV. The UE uses the E-DCH RV indexes as listed in the Table 3-7 . Table 3-7 Relationship between RSN values and E-DCH RV indexes RSN Value E-DCH RV Index (When Nsys/Ne,data,j < 1/2) 0 1 2 3
Note: is to round down a value. If configured by higher layers, only E-DCH RV index 0 can be used.
0 2 0 [ mod 2 ] x 2
mod 4
3-18
Issue 02 (2008-07-30)
3 HSUPA Principles
Ne,data,j is the total number of bits available for the E-DCH transmission per TTI with transport format j. TTIN is the TTI number.
For 10 ms TTI, TTIN = CFN. For 2 ms TTI, TTIN = 5 x CFN + subframe number.
In this case, the subframe number counts the five TTIs within a given CFN, starting from 0 for the first TTI to 4 for the last TTI.
l
Issue 02 (2008-07-30)
3-19
3 HSUPA Principles
In the figure, the left part shows the functional split, while the right part shows PDU architecture. An RLC PDU enters MAC-d on a logical channel. The MAC-d C/T multiplexing is bypassed. In the MAC-e header, the DDI (Data Description Indicator) field (6 bits) identifies logical channel, MAC-d flow and MAC-d PDU size. A mapping table is signaled over RRC, to allow the UE to set DDI values. The N field (fixed size of 6 bits) indicates the number of consecutive MAC-d PDUs corresponding to the same DDI value. A special value of the DDI field indicates that no more data is contained in the remaining part of the MAC-e PDU. The TSN field (6 bits) provides the transmission sequence number on the E-DCH. The MAC-e PDU is forwarded to a Hybrid ARQ entity, which then forwards the MAC-e PDU to layer 1 for transmission in one TTI.
3-20
Issue 02 (2008-07-30)
3 HSUPA Principles
AG_Timer and Non_serving_RG_timer: They are equal to one HARQ RTT (40 ms in the case of 10 ms TTI, or 16 ms in the case of 2 ms TTI), as defined in 3GPP TS 25.321. Primary_Grant_Available: This state variable is a Boolean, indicating whether the UE SG is affected only by Primary Absolute Grants and Relative Grants (that is, not by Secondary Absolute Grants). Primary Absolute Grant: An AG received with the primary E-RNTI. Secondary Absolute Grant: An AG received with the secondary E-RNTI. Serving E-DCH RLS or Serving RLS: A set of cells that contains at least the serving E-DCH cell and from which the UE can receive and combine one RG. The UE has only one serving E-DCH RLS. Identity Type: It takes the value "Primary" or "Secondary" based on whether the message is addressed to the primary or the secondary E-RNTI. Stored_Secondary_Grant: This state variable is used to store the last received Secondary Absolute Grant value. The possible values are "Zero_Grant" and numerical values.
l l l
l l
Issue 02 (2008-07-30)
3-21
3 HSUPA Principles
3-22
Issue 02 (2008-07-30)
3 HSUPA Principles
According to the two procedures shown above, the SG update is described as follows:
l l l l
If any non-serving RGs indicate DOWN for a TTI, then The UE updates the SG and sets the Maximum_Serving_Grant to SG. The Non_Servig_RG_Timer is started (if it is inactive) and set to one HARQ RTT, and The AG or RG from the serving RLS at the same TTI is ignored.
Issue 02 (2008-07-30)
3-23
3 HSUPA Principles
l
If no non-serving RGs indicate DOWN for a TTI, the UE updates the SG according to the AG or RG (used when no AG has been received and the AG_Timer has expired) received from the serving RLS. In addition, the new SG cannot exceed the Maximum_Serving_Grant saved last time if the Non_Serving_RG_Timer has not expired.
If the HSUPA UE receives more than one RG command, then one is from the serving RLS and the others are from non-serving RLs. The RG commands from the serving RLS and non-serving RLs are listed in the following table. For detailed information on SG update, see subclause 11.8.1.3 in 3GPP 25.321. Table 3-8 RG commands RG Command from Serving RLS UP RG Commands from Non-Serving RLs All HOLD Final RG Command
UP The new SG, however, can not exceed the Maximum _Serving_Grant if the Non_Serving_RG_Timer has not expired.
UP
DOWN The UE saves a new Maximum_Serving_Grant. If the Non_Serving_RG_Timer is inactive, start it.
HOLD HOLD
HOLD DOWN The UE saves a new Maximum_Serving_Grant. If the Non_Serving_RG_Timer is inactive, start it.
DOWN DOWN
DOWN DOWN The UE saves a new Maximum_Serving_Grant. If the Non_Serving_RG_Timer is not active, start it.
The HARQ profile includes the power offset and the maximum number of HARQ transmissions. The configuration of the HARQ profile is described in E-DCH Outer-Loop Power Control.
Huawei Proprietary and Confidential Copyright Huawei Technologies Co., Ltd Issue 02 (2008-07-30)
3-24
3 HSUPA Principles
The multiplexing list identifies the other MAC-d flows from which data can be multiplexed for transmission that uses the power offset included in its HARQ profile. The principle of configuring the multiplexing list is that the MAC-d packet of lower priority logical channel can be multiplexed into the MAC-e PDU of the higher priority logical channel, but the MAC-d packet of higher priority logical channel cannot be multiplexed into the MAC-e PDU of the lower priority logical channel.
If the Scheduling Information (SI) needs to be transmitted without any higher-layer data, the RRC configures the MAC with a special HARQ profile for "Control-only" transmissions:
l l
The power offset is fixed to 6dB. The maximum number of HARQ transmissions is eight in this case.
At each TTI boundary, the UE in CELL_DCH state with an E-DCH transport channel determine the state of each E-TFC for each configured MAC-d flow based on its required transmit power and the maximum UE transmit power. Note that:
l l l
The calculation of the required transmit power for each E-TFC is the same as that described in Power Control. For each configured MAC-d flow, a given E-TFC can be in Supported state or Blocked state. Only E-TFCs in Supported state are considered in E-TFC selection. The SG update function provides the E-TFC selection function with the maximum E-DPDCH to DPCCH power ratio that the UE is allowed to allocate for the upcoming transmission for scheduled data.
If a 10 ms TTI is configured and the TTI for the upcoming transmission overlaps with a compressed mode gap, the SG provided by the SG update function is scaled down according to the following equation: SG' = SG x (NC/15) Where:
l l
SG' represents the modified SG considered by the E-TFC selection algorithm. NC represents the number of non DTX slots in the compressed TTI.
Nc depends on the compressed mode which can be configured by the SET TGPSCP command. Through power offset and E-DCH Transport Format Combination (E-TFC) restriction procedure, the TB size can be obtained in the next TTI. For the detailed procedure of E-TFC selection, refer to the 25.321 protocol.
The SI is always sent when the transmission is triggered. Logical channels support absolute priority, that is, the UE maximizes the transmission amount of higher-priority data. For all logical channels:
Issue 02 (2008-07-30)
3-25
3 HSUPA Principles
If the logical channel belongs to a non-scheduled MAC-d flow, the current non-scheduled grant of the user determines whether the data can be transmitted. If the logical channel does not belong to a non-scheduled MAC-d flow, the current SG of the user determines whether the data can be transmitted. The MAC-d flows are configured in non-scheduled transmission mode or scheduled transmission mode.
If only non-scheduled MAC-d flows are configured for a UE, the NodeB does not send any AG or RG to this UE. Therefore, in non-scheduled mode, the E-DCH becomes a "fast retransmission DCH" without scheduling. If an MAC-d flow is configured with the non-scheduled transmission mode, the MAC-d PDUs for logical channels belonging to this MAC-d flow shall not exceed the size specified by the IE "Max MAC-e PDU contents size". The value of "Max MAC-e PDU contents size" is calculated in the RNC by the following formula: MaxMACePDUSize = [Ceil(MBR x TTILen / RLCPDUpayload) x MACdPDUSize + 18 ] x MaxRateUpScale Where:
l l l l l l l l
MaxMACePDUSize: Max MAC-e PDU contents size Ceil(): to get the larger integer MBR: maximum bit rate specified by the Iu message RAB ASSIGNMENT REQUEST TTILen: TTI length RLCPDUpayload: RLC PDU payload, namely RLC PDU size minus RLC PDU header MACdPDUSize: MAC-d PDU size 18: sum of bits for the Transmission Sequence Number (TSN), Data Description Indicator (DDI), and N (Number of MAC-d PDUs) fields MaxRateUpScale: used for multiplying the UL MBR in the RAB assignment to achieve the peak bit rate for the service bearers on the E-DCH The default value of MaxRateScale is 1.01 for each RAB and 5 for each SRB.
3-26
Issue 02 (2008-07-30)
4 HSUPA Algorithms
HSUPA Algorithms
HSUPA algorithms introduce the HSUPA related algorithms, and provide the detailed information on algorithms for fast scheduling, flow control, and CE scheduling.
Efficient use of uplink resources: The algorithm maximizes the uplink throughput of a cell under the condition that the QoS requirements of all the UEs are met. Fairness of services: If some UEs have the same Scheduling Priority Indicator (SPI), the algorithm allocates the same uplink resources to these UEs. Differentiated services: If a user has a higher SPI, it can obtain more uplink resources compared with a user with a lower SPI.
Issue 02 (2008-07-30)
4-1
4 HSUPA Algorithms
The CE scheduling algorithm dynamically adjusts the CE resources allocated to the UEs according to their data rates and preferentially serves the E-DCH RLS UE. It aims to reduce the probability of demodulation failure caused by CE resources, thus fully using the CE resources.
The figure shows the relation among the three HSUPA algorithms on the NodeB side. The HSUPA CE scheduler provides the MAC-e scheduler with the number of CEs allocated to the UE and the maximum SG. The HSUPA flow control entity sends the available bandwidth of HSUPA UE and the grant indicator to the MAC-e scheduler. In addition to the Uu resources, the MAC-e scheduling also considers the impact of flow control and CE scheduling results when giving the scheduling grants.
Assigning the AG based on the SI and Happy Bit sent by the UE to control the maximum rate that can be used by the UE. Assigning the RG according to the Happy Bit.
4-2
Issue 02 (2008-07-30)
4 HSUPA Algorithms
If the user is configured with the GBR by the RNC, and the GBR Schedule Switch parameter is set to TRUE (OPEN), the algorithm guarantees the GBR.
If the conditions for sending AG UP are met, the algorithm assigns AG to the user. Else if the conditions for sending RG UP are met, the algorithm assigns RG to the user.
b.
8.
Issue 02 (2008-07-30)
4-3
4 HSUPA Algorithms
If the available load resource of the cell where the UE camps or the available bandwidth of the Iub port where the UE is carried is smaller than zero, the algorithm sends RG DOWN to the UE and updates the remaining resources. In the process, if the GBR Schedule Switch is ON and the value of Reff of an unhappy user is smaller than the GBR, the algorithm performs 4.2.5 GBR Processing in the Scheduling Algorithm. The update is necessary to the remaining UL load source and remaining UL Iub bandwidth after sending the AG and RG to the UEs. The NodeB does not send the non-serving RL RG DOWN command unless both of the following criteria are met:
l l
Experienced RTWP of the NodeB > target RTWP sent from the CRNC Non-serving E-DCH to total E-DCH power ratio > Target Non-serving E-DCH to Total E-DCH Power ratio sent from the CRNC
Target Non-serving E-DCH to Total E-DCH Power ratio can be set on the RNC LMT.
Priorityn is the priority value of user n SPI is assigned by the RNC, which is used to provide different scheduling opportunities according to the scheduling priority. SPI and SPI (SPI weight) are the same as those used for HSDPA. For details, see QoS Management of Services Mapped on HSDPA. The smaller the SPI, the greater the value of Priorityn. During the scheduling, the rate of such a user is decreased before that of a user with a smaller Priorityn.
Reff is calculated according to the formula described in Calculating the Effective Data Rate.
4-4
Issue 02 (2008-07-30)
4 HSUPA Algorithms
Priorityn is the priority value of user n. SPI is assigned by the RNC, which is used to provide different scheduling opportunities according to the scheduling priority. Rreq is calculated according to the formula described in Calculating the Requested Data Rate (Rreq).
If the GBR Schedule Switch is set to ON, the algorithm queues the users according to the following principles:
For the users whose requirements for the GBRs are not met, the algorithm arranges them in descending order by Priorityn and puts them before the zero_grant users. Priorityn is calculated by using the following formula: Priorityn = Reff/(SPI x RGBR) RGBR is the GBR of the user.
For the users whose requirements for the GBRs are met, the algorithm arranges them in descending order by Priorityn and puts them before the users whose requirements for the GBRs are not met. Priorityn is calculated by using the following formula: Priorityn = Reff/SPI.
The rate of a user is decreased before that of a following user but increased after that of the following user.
l
If the GBR Schedule Switch is OFF, the users are queued according to the following principles: For non-zero_grant users, the algorithm arranges them in descending order by Priorityn: Priorityn = Reff/SPI The rate of a user is decreased before that of a following user but increased after that of a following user.
(n, k) means user n and TTI k. If the data is received correctly, R(n, k) is equal to the total size of all the MAC-es PDUs (which are from the same MAC-e PDU) divided by the TTI length. Otherwise, R(n, k) is equal to zero. Reff(n, 1) is an initial value and is zero. eff is an effective rate smooth factor and is fixed to 0.6%.
Issue 02 (2008-07-30)
4-5
4 HSUPA Algorithms
The formula for calculating Rreq is as follows: Rreq(n,k) = min(Rmax(UPH), argmax{R|Q(k) R x TTI}, Rsupport), where (n,k) means user n and TTI k. 1. Calculate Rmax(UPH). a. Calculate (ed/c)2UPH according to UPH. Assume that UPH = (ed/c)2UPH + (ec/c)2 + 1, where 1 stands for (c/c)2, the power of DPCCH. Because (ec/c)2 is known, (ed/c)2UPH can be obtained from the equation. b. Calculate all (ed/c)2 for all E-TFCIs according to 3GPP. 1-1 Get the TB size for jth E-TFCI based on the TB table configured by the RNC. 1-2 Calculate the quantized ed,j for jth E-TFCI using the method presented in HSUPA Power Control. Here, harq is the HARQ power offset of the MAC-d flow carrying the logical channel with the ID of HLID. 1-3 j ++ ; If the value exceeds the range of the TB table, the process stops. Otherwise, return to 1-2. c. Select Rmax(UPH). The maximum (ed/c)2 is (ed/c)2UPH. From the TB table, select one E-TFCI whose (ed/c)2 is the most similar to but smaller than (ed/c)2UPH. Then, the TB size can be obtained. With the TTI attribute of the UE, the Rmax(UPH) is easy to obtain. 2. Calculate R, which acts as the TB size divided by the TTI length for each E-TFC.
Argmax{R|Q(K) R x TTI} means finding a value R that is the maximum one and meets the condition Q(k) R x TTI. Q(k) is the buffer size.
According to the buffer size and the TTI attribute of the UE, the R restricted by Q(k) is obtained. 3. Calculate Rsupport. Rsupport = min{R (Maximum set of E-DPDCHs), R(E-DCH MBR)}
The user is unhappy and the SI sent from the user is received. The AGCH code allocated to the user is idle and not used by other users. The user meets the requirement: SGIndexreq - SGIndexcur > AG Threshold. SGIndexreq and SGIndexcur are obtained from Rreq and Rcur.
4-6
Issue 02 (2008-07-30)
4 HSUPA Algorithms
Rcur is the current bit rate of the UE, which is calculated on the basis of the E-TFCI carried on the E-DPCCH. Rcur is equal to the MAC-e PDU size divided by the TTI length. The MAC-e PDU size can be obtained according to the E-TFCI.
Rreq is calculated according to the formula described in 4.2.2 User Queuing in the Scheduling Algorithm.
The AG threshold is adjusted dynamically according to the traffic volume at the service source. For details, see Dynamically Setting the AG Threshold.
l l
The rate of the user is not decreased because of MBR processing, Iub bandwidth limitation, and CE resource limitation. The user demodulates the data on the E-DPDCH correctly.
If the user meets all these conditions, the scheduling algorithm calculates the AG to be assigned to the user based on the Uu bandwidth and Iub bandwidth.
When the traffic volume of a service source is small, the AG threshold is set to 3 so that the user can get enough resource to send data out as soon as possible. It helps to improve user experience with smaller latency. When the traffic volume of a service source is large, the AG threshold is set to 37 to avoid usage of AG, and instead RG can be used to provide a steady cell uplink load and a steady throughput for each user.
When an SI is received by NodeB, the scheduler checks a Flag to decide the AG threshold:
l l
If the Flag is TRUE, the AG threshold is 3, the scheduler assigns AG to this UE when SGIndexreq - SGIndexcur > AG Threshold. If the Flag is FALSE, AG threshold is 37 and only the RG can be used.
The scheduler in NodeB maintains the Flag for each user periodically. The Flag can be decided in the following ways:
l l
The initial value of the Flag is TRUE. The period is set to 500ms. In the period, the Flag is set to FALSE when one of the following requirements is met:
If the total received data bit number is greater than 2 k bytes or the data rate is greater than 4 k byte/sec, AG will not be used except at the beginning of transmission. If any TEBS in SI received in this period is greater than 20, which means 1658byte < TEBS 2202byte.
SI Transmission
The SI is attached to the end of the MAC-e PDU and is used to notify the serving NodeB of the amount of system resources required by the UE.
Issue 02 (2008-07-30)
4-7
4 HSUPA Algorithms
The SI is sent by the UE to the NodeB, as shown in the following figures. Figure 4-2 SI transmission
Where,
l l
UPH: UE Power Headroom, which indicates the ratio of the maximum UE transmission power to the corresponding DPCCH code power. TEBS: Total E-DCH Buffer Status, which identifies the total amount of data available across all logical channels (for which the reporting has been requested by the RRC) and indicates the amount of data in bytes available for transmission and retransmission at the RLC layer. HLBS: Highest priority Logical channel Buffer Status, which indicates the amount of data available from the logical channel identified by the HLID. HLID: Highest priority Logical channel ID, which identifies the highest-priority logical channel with available data.
l l
The transmission of SI is initiated by the quantization of the transport block sizes that can be supported, or by the triggering conditions. For details, see 3GPP25.321. The reporting of SI is triggered according to the SG after SG is updated. The triggering of a report is indicated to the E-TFC selection function at the first new transmission. This process may be delayed if the HARQ processes are occupied by retransmissions. When the TEBS is not zero, the SI transmission can be triggered by the following conditions:
l
Triggered by events At each TTI boundary, the UE checks the SG and the buffer status. If the SG has the value Zero_Grant or all processes are deactivated and the TEBS becomes greater than zero, then the SI transmission is triggered. If the serving E-DCH cell changes, the SI transmission is triggered. The change occurs, for example, when the RNC sends a reconfiguration message in response to a 1D event measurement report. In this case, a new serving E-DCH cell is indicated in the message and the new serving E-DCH cell is not in the previous serving E-DCH RLS.
4-8
Issue 02 (2008-07-30)
4 HSUPA Algorithms
Triggered periodically Triggered by the timer T_SIG (Timer Scheduling Information - not "Zero_Grant"), which can be configured on the RNC LMT through the parameter HSUPA schedule period with grant. Triggered by the timer T_SING (Timer Scheduling Information - "Zero_Grant"), which can be configured on the RNC LMT through the parameter HSUPA schedule period without grant.
If the HARQ process fails to deliver an MAC-e PDU that contains a triggered SI to the RLS that contains the serving cell, and the SI is transmitted together with higher-layer data multiplexed into the same MAC-e PDU, the transmission of a new SI is triggered. If the SI transmission is not triggered under the previous condition, but the size of the data plus the header is smaller than or equal to the TB size of the UE-selected E-TFC minus 18 bits, the SI is concatenated into this MAC-e PDU. In this case, however, no new SI is triggered if the HARQ process fails to deliver the MAC-e PDU. For details of SI triggering, see 3GPP 25.321.
The user is unhappy. The user does not meet the conditions for sending AG UP. The rate of the user is not decreased because of MBR processing, Iub bandwidth limitation, and CE resource limitation. The user demodulates the data on the E-DPDCH correctly.
If all these conditions are met and both the Uu bandwidth and the Iub bandwidth allow an increase in the user rate, the algorithm sends RG UP to the user.
If the RAB ASSIGNMENT REQUEST message from the CN carries the GBR when the RAB is set up, the GBR is sent to the NodeB. Otherwise, the GBR configured on the RNC LMT is sent to the NodeB when the RAB is carried on HSUPA. The GBR can be configured for each user priority (gold, silver, or copper) through the SET USERGBR command on the RNC LMT.
If the load on the Uu interface exceeds the value of Maximum Target Uplink Load Factor, the algorithm does not send AG UP or RG UP to those users whose requirements for the GBRs are already met. If the load on the Uu interface exceeds the value of Maximum Target Uplink Load Factor but does not exceed the load congestion threshold, the algorithm meets the requirements of the users for the GBRs.
Issue 02 (2008-07-30)
4-9
4 HSUPA Algorithms
l
If the load on the Uu interface exceeds the load congestion threshold, the algorithm does not meet the requirements of the users for the GBRs.
If Rreq is smaller than the GBR, only Rreq needs to be assigned to the user. If Rreq is larger than the GBR,
If the estimated load does not exceed the load congestion threshold after the GBR is reached, at least the GBR is assigned to the user. Otherwise, the algorithm calculates the maximum grant that can be assigned to the user according to the load congestion threshold.
When the user does not meet the conditions for sending AG UP but meets the conditions for sending RG UP,
l l
If the estimated load does not exceed the load congestion threshold after RG UP is sent, RG UP is sent to the user. Otherwise, RG UP is not sent to the user.
The load congestion threshold is 0.95. If the estimated load does not exceed the load congestion threshold, neither the serving RLS nor the non-serving RL will send RG DOWN to those users whose Reff is smaller than the GBR. In addition, no matter whether the requirement for the GBR can be met, the grant assigned to the user can not cause the throughput of the user to exceed the bandwidth available for the HSUPA users in the NodeB.
(n, k) indicates user n and TTI k. avg is an Average Rate Smooth Factor, which is an coefficient. Ravg(n,1) is an Average Rate Initial Value, which is used at the beginning. Rcur(n, k) is the current bit rate of the UE, which is calculated on the basis of the E-TFCI carried on the E-DPCCH.
Rcur is equal to the MAC-e PDU size divided by the TTI length. The MAC-e PDU size can be obtained according to the E-TFCI. Average Rate Initial Value is set to 0 kbit/s and avg is set to 0.6%. Thus, the smoothing time is 1.6s, about 10 times the period of fast fading that occurs during 3 km/h movement. The purpose is to reflect the impact of the channel fading and to smooth it.
4-10
Issue 02 (2008-07-30)
4 HSUPA Algorithms
The uplink throughput of a UE on the Uu interface may vary in a wide range. HSUPA UEs would share Iub resources in a more flexible way than R99 UEs. If the uplink throughput on the Uu interface is continuously wider than the Iub bandwidth, the data stored in the Iub buffer will be continuously increased. Without flow control, a higher delay or packet loss rate may be incurred. When the Iub bandwidth becomes the bottleneck of uplink data transmission, the delay must be kept within the given range and packet loss must be minimized, thus maximizing the uplink throughput and achieving better use of the Iub bandwidth.
To control the packet loss and the delay on the Iub interface, the flow control algorithm performs the following functions:
l
Adjusts the maximum available bandwidth of Iub port according to the congestion state of the transport network. This prevents large amounts of data from being discarded when data convergence causes congestion in the transport network. Adjusts the available bandwidth of HSUPA according to the change trend of the Iub buffer, and informs the scheduler of controlling the total traffic volume of HSUPA UEs according to their available bandwidth. Controls the Iub buffer usage to ensure that the buffer-caused delay is within the allowed range without any packet loss.
The functional modules of the flow control algorithm are shown in the following figure.
Issue 02 (2008-07-30)
4-11
4 HSUPA Algorithms
l l
Scheduling Module: allocates grants to the UEs according to the Uu load resources and the available bandwidth of the HSUPA users. Flow Control Module: adjusts the available bandwidth of every HSUPA user according to the reported change trend of the buffer usage and the maximum available bandwidth, and provides the buffer congestion state of Iub port according to the buffer use. Transport Network Congestion Control Module: detects the congestion state of the transport network and adjusts the maximum available bandwidth of Iub port accordingly. Buffer Usage Reporting Module: reports the buffer use of Iub port.
l l
The detailed functions of each module are described in the following sections.
l l l
4.3.2 Adjusting the Maximum Available Bandwidth of the Iub Port 4.3.3 Adjusting the Available Bandwidth of HSUPA 4.3.4 Handling Iub Buffer Congestion
4-12
Issue 02 (2008-07-30)
4 HSUPA Algorithms
Where the Congestion Status indicates whether there is transport network congestion. Its value range is described as follows:
l l l l
0: no TNL congestion 1: reserved for future use 2: TNL Congestion detected by delay build-up 3: TNL Congestion detected by frame loss
When the period for adjusting the maximum available bandwidth arrives, the NodeB takes statistics on the congestion indications of all the MAC-d flows on the Iub port and performs the following operations:
l
If there is a congestion indication "TNL Congestion detected by frame loss", the NodeB subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth. This step is set to 2%. Otherwise,
If there is a congestion indication "TNL Congestion detected by delay build-up", the NodeB subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth. This step is set to 1%. If neither congestion indication is received during three consecutive periods nor the use of the Iub bandwidth exceeds a preset value which equals to 85%, the NodeB increases the maximum available bandwidth by one step. The initial step is 10 kbit/s. The step is doubled every time the five consecutive increases are complete. The maximum step is 100 kbit/s.
Issue 02 (2008-07-30)
4-13
4 HSUPA Algorithms
l
If the congestion is due to frame loss, the NodeB subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth. This step is set to 2%. Otherwise,
If the congestion is due to delay, the NodeB subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth. This step is set to 1%. If neither congestion is detected during three consecutive periods nor the NodeB increases the maximum available bandwidth by one step. The initial step is 10 kbit/s. The step is doubled every time the five consecutive increases are complete.
If the occupancy ratio of the Iub buffer increases, the NodeB reduces the available bandwidth of HSUPA users based on the variation. The adjustment upper limit is 150 kbit/s. The adjustment is in direct proportion to the variation. If the occupancy ratio of the Iub buffer decreases and the use of the Iub bandwidth exceeds a preset value, which equals to 85% in the buffer non-congestion state, the NodeB increases the available bandwidth of HSUPA users based on the variation. The adjustment is in direct proportion to the variation. The adjustment upper limit is 150 kbit/s.
The adjustment must guarantee that the available bandwidth of HSUPA users cannot exceed the maximum available bandwidth. When a lot of R99 users access the network in a short period of time, the occupancy rate of the Iub buffer jumps and even the buffer may overflow. To avoid this problem, the backpressure mechanism is introduced to the flow control algorithm based on the occupancy rate of the buffer. For detailed information, see 4.3.4 Handling Iub Buffer Congestion.
4-14
Issue 02 (2008-07-30)
4 HSUPA Algorithms
The Iub flow control module measures and stores the value of the Iub buffer occupancy rate every 40 ms and compares it with the previous one. The detection of the buffer state is as follows:
l
If the Iub buffer occupancy rate > The Congestion Threshold of IUB Buffer Used Ratio + The Congestion Threshold Hysteresis of IUB Buffer Used Ratio, the buffer state is marked congested. If the Iub buffer occupancy rate < The Congestion Threshold of IUB Buffer Used Ratio The Congestion Threshold Hysteresis of IUB Buffer Used Ratio, the buffer state is marked not congested. Otherwise, the buffer status remains unchanged. Where,
The Congestion Threshold of IUB Buffer Used Ratio is 30%, The Congestion Threshold Hysteresis of IUB Buffer Used Ratio is 5%.
If the Iub buffer is congested, the NodeB compares the value of the Iub buffer occupancy rate with the previous one every 40 ms.
If the Iub buffer occupancy rate increases, the scheduler sends the RG Down message to all the HSUPA users on this Iub port, and no AG is allowed to be sent to these users. If the Iub buffer occupancy rate does not increase, neither AG Up nor RG Up is allowed to be sent to the users on this Iub port.
If the Iub buffer is not congested, the flow control algorithm does not affect the decision of the scheduler.
Issue 02 (2008-07-30)
4-15
4 HSUPA Algorithms
case, the utility of the CE resource is inefficient. Thus, the dynamic CE resource management is necessary. Considering that the rate of HSUPA user changes fast, the algorithm periodically adjusts CE resources of users according to the users rate and the available CE resources. When a new RL is admitted, the algorithm also adjusts CE resources. Dynamic CE management can minimize the failures in demodulation and decoding due to CE. Meanwhile, it also can maximize the CE usage and UL throughput. Figure 4-8 Overview of CE resource management
MAC-e scheduler always takes the CE resources allocated to the user into consideration. CE resource adjustment is performed periodically or triggered by events.
4-16
Issue 02 (2008-07-30)
4 HSUPA Algorithms
When each adjustment period arrives, the algorithm performs the following operations: 1. Call back the CE resources of the serving RLS
The NodeB determines whether to call back the CEs based on the CEavg during the previous period. If the CEallocate is greater than both CEinit and CEavg, the NodeB calls back some CEs and decreases CEallocate to Max(CEavg,CEinit). The CE resources called back takes effect during the next period. The algorithm notifies the SGmax to the MAC-e scheduler at current TTI.
l l
CEallocate: The number of CEs allocated to the serving RLS. CEinit: Initial number of CEs, which is calculated on the basis of the configured GBR. If the user is not configured with the GBR, then CEinit is the CE resources for transmitting an RLC PDU. CEavg: Average number of CEs, which is calculated on the basis of the average rate of the serving RLS. SGmax: Maximum SG for the UEs, which is determined by the function of the dynamic CE resource management. Since one SG may correspond to different CE numbers, if MAC-e scheduler uses this SG, the allocated CE resources may be insufficient. Therefore, the algorithm needs to notify the MAC-e scheduler of the SGmax to avoid CE insufficiency. Processing CE resources among serving RLS for fairness
l l
2.
Issue 02 (2008-07-30)
4-17
4 HSUPA Algorithms
If the available CE resources for serving RLS are less than the CE resources that are required for increasing the SF4 to 2xSF4, the algorithm performs fairness processing. Table 4-1 HSUPA CEs consumption rules MinSF SF64 SF32 SF16 SF8 SF4 2xSF4 2xSF2 2xSF2 + 2xSF4
The deference of CEs consumption rules for HSUPA phase1 and HSUPA phase2 is causes by deference hardware version.
The algorithm selects a user with the largest value of priority and reduces its rate. The users whose GBR are met are downsized before the users whose GBR are not met. When the next period arrives, this user s CE resources will be called back. The queuing of users is as follows:
l l
For the users whose Reff is smaller than the GBR, the algorithm queues the users based on Priority = Reff/(SPI x GBR). For the users whose Reff is greaterr than or equal to the GBR or the users whose GBR is not configured, the algorithm queues the users based on Priority = Reff/SPI.
For the users of the serving RLS, the algorithm stops decreasing its CE resources if the CE resources equals to CEinit. After processing, the algorithm notifies the MAC-e scheduler of the new SGmax. 3. Increasing CE resources of the serving RLS
If the CEavg during the previous period is greater than or equal to CEallocate, the algorithm can increase the CE resources of theses users by one step if there are available CE resources. For example, if the CE resource of a user corresponds to SF4, the algorithm increases the CE resources to that correspond to 2xSF4, as listed in Table 4-1. The operation of increasing CE resources is based on the user queuing. The users are queued in ascending order based on priority value. The smaller the priority value of a user is, the earlier this user s CE is increased. The queuing of users is as follows:
l l
For the users whose Reff is smaller than the GBR, the algorithm queues the users based on Priority = Reff/(SPI x GBR). For the users whose Reff is greaterr than or equal to the GBR or the users whose GBR is not configured, the algorithm queues the users based on Priority = Reff/SPI.
4 HSUPA Algorithms
The users whose GBR is not reached are increased before the users whose GBR is satisfied or not configured. During the increasing procedure, the algorithm can preempt the CE resources of the non-serving RLs until their resource decreases to the minimum CE resources, which are required for E-DPCCH demodulation and decoding.
After the increase of CE, the algorithm notifies the MAC-e scheduler of the new allocated CEs and SGmax. 4. Allocating CE resources to non-serving RLs
When there are available CE resources for non-serving RLs, the algorithm allocates them to the users of non-serving RLs. The algorithm allocates available CE resources as much as possible to non-serving RLs, so that more users can obtain the gain of soft handover. Based on the CEavg of non-serving RLs during the previous period, the algorithm increases the number of CEs to CEup, where CEup is obtained by increasing CEavg by one step, as listed in Table 1-1. The users are queued in ascending order based on their priority value. The smaller the value of priority is, the earlier the user is processed. The priority value is calculated as follows: Priority = CEneed / SPI
l
CEneed = NRL * (CEnew - CEassign) NRL: the number of RLs on the current UL board. CEassign: the CE resource allocated to this user CEnew = Min[CEup, CEE-DCH MBR, CEMaximum Set of E-DPDCHs]
CEE-DCH MBR: the CE resources corresponding to the E-DCH MBR CEMaximum Set of E-DPDCHs: the CE resources corresponding to the Maximum Set of E-DPDCHs CEup: the CEassign after increasing by a step
If the available CE resources can meet the requirements for CEneed of a user, the algorithm allocate the CE resources to this user. If no enough CE resources are available, the algorithm allocates the minimum CE resources. After increasing, the algorithm notifies the MAC-e scheduler of the new CEs and SGmax. 5. Allocating the remaining CE resources
This NodeB allocates the remaining CE resources to the users of serving RLS in order to improve the efficiency of utility of CE resources. NodeB schedules the user of serving RLS by the ascending order of priority until the remaining CE resources are not enough to increase the user by a step or all users have gotten the CE resources of Min[ CE(E-DCH MBR), CE(Maximum Set of E-DPDCHs)]. The priority is calculated as follows: Priority = CEneed / F(SPI), and Where,
Issue 02 (2008-07-30)
4-19
4 HSUPA Algorithms
l l l
CEneed = NRL * (CEup CEassign) CEassign is the CE resources allocated to the user of the serving RLS. CEup is the CE resources that are required for increasing the CEassign by a step.
The algorithm preempts the CEs of non-serving RLs until their CE resources decrease to the minimum CE number. If the CE resources are still insufficient after preemption of non-serving RL, the algorithm preempts the CE resources of serving-RLSs until the CE resources decreases to CEinit.
Type1: users with the GBR and Reff GBR, or the user without GBR Type2: users with the GBR and Reff < GBR
In each type, the algorithm preempts the CE resources according to the priority value of the users: Priority= Reff / SPI
l
Reff, and SPI are the same as those described in HSUPA Fast Scheduling.
Rate Reallocation Based on Throughput UL BE Rate Downsizing and Recovery Based on UL Basic Congestion UE State Transition Algorithm
4-20
Issue 02 (2008-07-30)
4 HSUPA Algorithms
Power Control on E-DPCCH Power Control on E-DPDCH E-DCH Outer-Loop Power Control Downlink Power Control on E-AGCH, E-RGCH, and E-HICH
The E-DCH active set and the DCH active set are maintained separately. The E-DCH active set is a subset of the DCH active set or the same. The HSUPA serving cell always tries to change with the best cell in the DCH active set. The type of bearer carrying the uplink services is decided on the basis whether the best cell in the DCH active set supports HSUPA. If the best cell in the DCH active set supports HSUPA, the uplink services are preferentially carried on the E-DCH. Otherwise, the uplink services are preferentially carried on the DCH.
Intra-Frequency Handover
Issue 02 (2008-07-30)
4-21
4 HSUPA Algorithms
l l
In the R99 cell, the UE initiates a service that has to be set up on the E-DCH according to the service mapping rules. The traffic volume of the UE increases when the UE stays in CELL_FACH state in the R99 cell, and the service fulfills the criteria of service mapping to HSUPA. The associated timer expires. For a service that must be set up on the E-DCH according to the service mapping rules, it can be set up on the DCH of the R99 cell because, for example, the admission request is rejected. Under such a circumstance, the system starts a timer for the inconsistency between the channel that is suitable for the service and the channel that carries the service. The length of this timer is defined by the H Retry timer length parameter.
If DRD_SWITCH, HSUPA_DRD_SWITCH and INTRA_HO_D2H_DRD_SWITCH are enabled, DCH to HSUPA retry is allowed only when it is required after a soft handover or an intra-frequency hard handover. If DRD_SWITCH, HSUPA_DRD_SWITCH and INTER_HO_D2H_DRD_SWITCH are enabled, DCH to HSUPA retry is allowed only when it is required after an inter-frequency hard handover.
The access to an HSUPA cell is rejected when the service is set up. The access to an HSUPA cell is rejected when the channel switching from FACH to E-DCH is triggered by the increase of the traffic volume. The access to an HSUPA cell is rejected when the channel switching from DCH to E-DCH is triggered.
When one of the preceding conditions is met, the system assigns the service to the E-DCH of the other HSUPA cell through directed retry. For detailed information of the following parameters, refer to Load Control:
l
DRD_SWITCH
4-22
Issue 02 (2008-07-30)
4 HSUPA Algorithms
Issue 02 (2008-07-30)
4-23
5 HSUPA Parameters
5
Table 5-1 Parameter Name Parameter ID Maximum Target Uplink Load Factor
HSUPA Parameters
Inter-RAT Handover Parameters provides information on the effective level and configuration of the parameters related to the feature.
Effective Level
Configuration on ...
Cell(ADD CELLHSUPA) RNC(SET COIFTIMER) RNC(SET FRC) RNC(SET FRC) Cell(ADD CELLHSUPA) Cell(SET MACEPARA) Cell(SET MACHSSPIPARA)
H Retry timer length HSUPA schedule period with grant HSUPA schedule period without grant
Target Non-serving E-DCH to Total E-DCH Power ratio
RNC
NodeB NodeB
Issue 02 (2008-07-30)
5-1
6
l l l l l l l l l l l l l
HSUPA Reference Documents lists 3GPP protocols and documents related to HSUPA. 3GPP TS 25.101: User Equipment (UE) radio transmission and reception (FDD) 3GPP TS 25.211: Physical channels and mapping of transport channels onto physical channels (FDD) 3GPP TS 25.212: Multiplexing and channel coding (FDD) 3GPP TS 25.213: Spreading and modulation (FDD) 3GPP TS 25.214: Physical layer procedures (FDD) 3GPP TS 25.309: FDD Enhanced Uplink 3GPP TS 25.301: Radio Interface Protocol Architecture 3GPP TS 25.302: Services provided by the physical layer 3GPP TS 25.321: Medium Access Control (MAC) protocol specification 3GPP TS 25.420: UTRAN Iur interface general aspects and principles 3GPP TS 25.423: UTRAN Iur interface RNSAP signaling 3GPP TS 25.430: UTRAN Iub interface: general aspects and principles 3GPP TS 25.433: UTRAN Iub interface NBAP signaling
Issue 02 (2008-07-30)
6-1