This file (the following parts after this page) is the original Huawei documentation, which Huawei provides

to Motorola in term of the mutual agreement. This document is classified as Motorola Confidential Restricted. Moreover, in accordance with relevant agreements with Huawei, it can only be shared with the authorized JRDC projects related people and can only be used for the purpose of those projects.

Motorola Confidential Restricted

RAN

HSUPA Description

Issue Date

02 2008-07-30

Huawei Proprietary and Confidential Copyright © Huawei Technologies Co., Ltd

Huawei Technologies Co., Ltd. provides customers with comprehensive technical support and service. For any assistance, please contact our local office or company headquarters.

Huawei Technologies Co., Ltd.
Address: Huawei Industrial Base Bantian, Longgang Shenzhen 518129 People's Republic of China

Website: Email:

http://www.huawei.com support@huawei.com

Copyright © Huawei Technologies Co., Ltd. 2008. All rights reserved.
No part of this document may be reproduced or transmitted in any form or by any means without prior written consent of Huawei Technologies Co., Ltd.

Trademarks and Permissions
and other Huawei trademarks are trademarks of Huawei Technologies Co., Ltd. All other trademarks and trade names mentioned in this document are the property of their respective holders.

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.

Huawei Proprietary and Confidential Copyright © Huawei Technologies Co., Ltd

..........................................................4 E-RGCH..3-17 3.....................................................2...........................................2 MAC-e PDU Generation Process.............................................................................................................................................................................................................................................................................3-17 3....................................1 Overview of HSUPA Related Algorithms ...4 E-HICH Timing Relative to the P-CCPCH..............................................................6......................................3-14 3..............................3-20 3............................................................................................................................4......3 HSUPA Fast Scheduling ................3 Mapping of Transport Channels onto Physical Channels.................RAN HSUPA Description Contents Contents 1 HSUPA Change History ..............................3-12 3.....................2......................1 HSUPA Protocol Architecture ........2 HSUPA Short TTI ..............................3.....6.........3-6 3.......................3-19 3............3 E-RGCH Timing Relative to the P-CCPCH .......................3-15 3..6 MAC-e PDU Generation..................................................................................................4................................3-15 3...................................5.........................................................................................2 E-AGCH Timing Relative to the P-CCPCH ..3...........................................................................3-1 3........................................................................................................................................................3-2 3.............................................................................1 E-DPCCH ....................................3-4 3..........................................................................................1 MAC-e PDU Overview......1 Mapping of Services onto The E-DCH ........3 HSUPA Physical Channels......................................................2 Algorithm of Flow Control .................................................2......................4-1 Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co...............................................................3-1 3.......................................4-1 4...............................6.........4-1 4..........................................................................5....................................................5 Association Between Frames of Different Physical Channels ................................................4 HSUPA Physical Channel Timing .......................3.......................... Ltd i .........3-13 3..........1 HSUPA HARQ.......5 HSUPA Key Technologies..2 HSUPA Channel Mapping...................3-2 3...........1........................4.................................1 Algorithm of HSUPA Fast Scheduling.....3-19 3....................................................................2-1 3 HSUPA Principles..............................................................................................................................................................................................................................................4-1 4................................5 E-HICH....................................................................3....................................................................3-2 3................................3-9 3....1.............................................................................................................3-3 3......2 Mapping of Logical Channels onto Transport Channels...................4................................................................................................................................4.......................................................5..............................................................3 E-AGCH ...........................................................................................2 E-DPDCH ...........3-6 3.................3-4 3...........................................................3-19 3..........................3...............3-19 3...........................................................................3 MAC-e PDU Encapsulation.......................................3-13 3....3-25 4 HSUPA Algorithms .......................3-13 3............................................1-1 2 HSUPA Introduction ...........................1 E-DPDCH/E-DPCCH Timing Relative to the DPCCH .......

........................................................4-14 4.......................................................................................................................................1 HSUPA Cell Load Control ..................4-2 4..............................4-2 4..............................................5..................3 Adjusting the Available Bandwidth of HSUPA..................4 Dynamic CE Resource Management .....................................................6-1 ii Huawei Proprietary and Confidential Copyright © Huawei Technologies Co...........................................................................................3........... Ltd Issue 02 (2008-07-30) .1........................................................1.............3 HSUPA Power Control.................4-21 4.......................4-9 4..............3 Algorithm of CE Allocation ....2..........................3 AG UP Processing in the Scheduling Algorithm......................................................................................................................................................................................................2..........................4 Relation Among HSUPA Algorithms ..................................4-20 4....................................................................................................................................................................................4-14 4.....5 HSUPA Directed Retry ....................................5.........................................................................................5-1 6 HSUPA Reference Documents ....................4-20 4................5 Other HSUPA Related Algorithms ...4 RG UP Processing in the Scheduling Algorithm..............3 HSUPA Flow Control................4-11 4....................................................................4-2 4....................................4-21 4...................................2 HSUPA DCCC ...............................................................................................................................4 HSUPA Mobility Management ..............................................Contents RAN HSUPA Description 4........................2 User Queuing in the Scheduling Algorithm ....................4-6 4...1 Overview of HSUPA Flow Control......5...................4-15 4........................4-11 4......................................4-1 4....................4-20 4........................................4-12 4.2...........................2............5............4-9 4...........................................4 Handling Iub Buffer Congestion.................2 Adjusting the Maximum Available Bandwidth of the Iub Port ...........................................4-10 4....................................2...................6 MBR Processing in the Scheduling Algorithm ...................................................................................................5 GBR Processing in the Scheduling Algorithm...........................................................................1 Overview of HSUPA Scheduling .......................................................................................................................3.....3.....4-22 5 HSUPA Parameters .................................4-4 4.......................2...................3.........5.........2 HSUPA Fast Scheduling................

Editorial change: refers to changes in information that has already been included.0 10.0.. Change Type Feature change Change Description Dynamic CE Resource Management is optimized For details. which are defined as follows: Feature change: refers to the change in the HSUPA feature of a specific product version.0 HSUPA Change History HSUPA Change History provides information on the changes between different document versions.4 Dynamic CE Resource Management Parameter Change The parameters that are changed to be non-configurable are listed as follows: Happy bit delay time HSUPA service rate extend scale Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.0 incorporates the changes described in the following table.0. 02 (2008-07-30) This is the document for the second commercial release of RAN10. or the addition of information that was not provided in the previous version. issue 02 (2008-07-30) of RAN10. Ltd 1-1 . Compared with 01 (2008-05-30) of RAN10.0 10.RAN HSUPA Description 1 HSUPA Change History 1 Document and Product Versions Document Version 02 (2008-07-30) 01 (2008-05-30) Draft (2008-03-20) 10. refer to 4. Table 1-1 Document and product versions RAN Version RNC Version V200R010C01B061 V200R010C01B051 V200R010C01B050 NodeB Version V100R010C01B050 V200R010C01B041 V100R010C01B049 V200R010C01B040 V100R010C01B045 There are two types of changes.

1 HSUPA Change History RAN HSUPA Description Change Type Change Description Parameter Change E-TFCI Table Index E-RGCH 3-Index-Step Threshold E-RGCH 2-Index-Step Threshold Editorial change A parameter list is added. Compared with issue 03 (2008-01-20) of RAN 6. The structure is optimized. issue 01 (2008-05-30) of RAN10..0. The algorithm of HSUPA flow control is changed. 1-2 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Compared with draft (2008-03-20) of RAN10. Parameter Change The parameters that are changed to be non-configurable are listed as follows: HARQ Info for E-DCH HSUPA Scheduling Info power offset Editorial change General documentation change: The HSUPA Parameters is removed because of the creation of RAN10.0. Ltd Issue 02 (2008-07-30) .0 parameter reference. None. See chapter 5 HSUPA Parameters. The algorithm of HSUPA scheduled transmission is changed. None. 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 CE scheduling is introduced. None. Draft (2007-03-20) This is a draft of the document for the first commercial release of RAN10.0.0 incorporates the changes described in the following table. None. 01 (2008-05-30) This is the document for the first commercial release of RAN10. Parameter Change None. Change Type Feature change Change Description None. None.1.

RAN HSUPA Description

1 HSUPA Change History

Change Type Editorial change

Change Description General documentation change is as follows: Implementation information has been moved to a separate document.

Parameter Change None.

Issue 02 (2008-07-30)

Huawei Proprietary and Confidential Copyright © Huawei Technologies Co., Ltd

1-3

RAN HSUPA Description

2 HSUPA Introduction

2

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: 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)

Huawei Proprietary and Confidential Copyright © Huawei Technologies Co., Ltd

2-1

admission control. load control. 3GPP R6 introduces HSUPA to provide a significant enhancement in the uplink in terms of peak data rate and cell throughput. GGSN = Gateway GPRS Support Node.2 HSUPA Introduction RAN HSUPA Description Network Elements Involved The following table describes the Network Elements (NEs) involved in HSUPA. 2-2 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. MGW = Media Gateway. The implementation of HSUPA requires the support of power control. HLR = Home Location Register Impact Impact on System Performance Compared with 3GPP R99. a shorter latency. MSC Server = Mobile Service Switching Center Server. Table 2-1 NEs involved in HSUPA UE √ NodeB √ RNC √ MSC Server – MGW – SGSN – GGSN – HLR – NOTE – = NE not involved √ = NE involved UE = User Equipment. RNC = Radio Network Controller. HSUPA and the other features have an impact on each other. Ltd Issue 02 (2008-07-30) .. see Other HSUPA Related Algorithms. 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. and a good balance between downlink and uplink. For detailed information. SGSN = Serving GPRS Support Node. and mobility management.

. Figure 3-1 shows the HSUPA protocol architecture. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.RAN HSUPA Description 3 HSUPA Principles 3 HSUPA Protocol Architecture HSUPA Channel Mapping HSUPA Physical Channels HSUPA Physical Channel Timing HSUPA Key Technologies MAC-e PDU Generation HSUPA Principles The principles of HSUPA cover the technical aspects of the feature: 3. MAC-e multiplexing. HSUPA is implemented in the following ways: A new MAC entity (MAC-es/MAC-e) is added to UE below the MAC-d to handle HARQ retransmission.1 HSUPA Protocol Architecture HSUPA Protocol Architecture describes the protocol architecture of HSUPA. Figure 3-1 Protocol architecture of HSUPA To enhance the Access Stratum (AS). scheduling. Ltd 3-1 . and E-DCH Transport Format Combination (E-TFC) selection.

and switching.1 Mapping of Services onto The E-DCH When the UE sends a service request. 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. see Mapping of Signaling and Traffic onto Transport Channels in Radio Bearers. Ltd Issue 02 (2008-07-30) .2 HSUPA Channel Mapping HSUPA Channel Mapping describes the following: Mapping services information on the E-DCH. user plane transmission. service rate. 3. scheduling. the Packet Switched Core Network (PS CN) requires a higher rate of service assignment. 3-2 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Step 4 The MAC-es of SRNC sends MAC-d PDUs to SRNC MAC-d. and MAC-e demultiplexing. Step 2 The MAC-e of NodeB sends the MAC-es PDUs through E-DCH FP to the MAC-es of SRNC. the RNC determines whether to map the service onto the E-DCH according to the factors.2.3 HSUPA Principles RAN HSUPA Description A new MAC entity (MAC-e) is added to NodeB to handle the HARQ retransmission. Accordingly.2. 3. such as. the traffic class.2 Mapping of Logical Channels onto Transport Channels Both Dedicated Control Channel (DCCH) and Dedicated Traffic Channel (DTCH) can be mapped onto the E-DCH in HSUPA. 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. ----End With HSUPA. the Universal Terrestrial Radio Access Network (UTRAN) supports higher-rate transmission. Mapping of logical channels onto the transport channels Mapping of transport channels onto the physical channels 3. Step 3 The E-DCH FP of Iub interface controls the data flow between NodeB MAC-e and SRNC MAC-es. For detailed information on mapping of signaling and traffic onto transport channels.. A new transport channel (E-DCH) is added to transfer data blocks between NodeB MAC-e and SRNC MAC-es. scheduling scheme. cell HSUPA capability and UE HSUPA capability.

3 Mapping of Transport Channels onto Physical Channels After the coding and multiplexing on the E-DCH are performed.. Ltd 3-3 .2. first out) and directly onto the physical channels. the subsequent data streams are mapped sequentially (first in.RAN HSUPA Description 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 3. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.

. The spreading factor of the E-DPCCH is 256.3 HSUPA Principles RAN HSUPA Description Figure 3-4 Mapping of transport channels onto physical channels 3. Each radio link has at most one E-DPCCH. Ltd Issue 02 (2008-07-30) .1 E-DPCCH The E-DCH Dedicated Physical Control Channel (E-DPCCH) carries the control information associated with the E-DCH.3 HSUPA Physical Channels HSUPA Physical Channels describes five types of HSUPA physical channels: E-DPCCH E-DPDCH E-AGCH E-RGCH E-HICH 3. 3-4 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.3.

E-TFCI: 7 Bits E-TFCI is used on the current E-DPDCH. the E-TFCI can be mapped to a transport block size. Otherwise. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.321. This field takes two values: Unhappy and Happy. passed from the MAC to the physical layer for the E-DPCCH inclusion. With the table. Happy Bit: 1 Bit Happy Bit is a single bit field that is. the Happy Bit is set to Happy. The Unhappy value indicates a higher data rate than that supported by the current SG.RAN HSUPA Description 3 HSUPA Principles Figure 3-5 Frame structure of the E-DPCCH The E-DPCCH carries the following control information: Retransmission Sequence Number (RSN): 2 bits E-TFC Indicator (E-TFCI): 7 bits Happy Bit: 1 bit Retransmission Sequence Number (RSN): 2 Bits RSN is transmitted on the E-DPCCH and used to convey the uplink HARQ transmission number. There are four transport block size tables defined in 3GPP 25. the details for which are as follows: 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. Each TTI has two tables.The E-TFCI Table Index is 0 for Voip service and 1 for all the others. due to the sufficient data in the buffer and enough power in the UE. Ltd 3-5 . which indicate whether the UE wants more resources..

0 provides a maximum of four E-DPDCHs with two SF4s and two SF2s.3. The spreading factor of the E-AGCH is 256.214. The spreading factor of the E-DPDCH ranges from 2 to 256.3. The ratio mentioned in the third criteria is always 1 for 10 ms TTI.2 E-DPDCH The E-DCH Dedicated Physical Data Channel (E-DPDCH) carries the data associated with the E-DCH. 3. the E-DPDCH and the E-DPCCH are transmitted simultaneously. Each radio link can have none.. The E-AGCH is a common downlink physical channel with a fixed rate of 30 kbit/s. the Happy Bit is set to Unhappy if the following conditions are met: 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. Ltd Issue 02 (2008-07-30) . one. RAN10. the E-DPCCH is transmitted discontinuously. 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. except with the power scaling as described in 3GPP TS 25.3 HSUPA Principles RAN HSUPA Description For every E-DCH transmission. 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.3 E-AGCH The E-DCH Absolute Grant Channel (E-AGCH) carries AGs for uplink E-DCH scheduling. The E-AGCH is a shared channel for all HSUPA UE in the serving E-DCH cell. or several E-DPDCHs. Figure 3-6 Frame structure of the E-DPDCH Generally. 3-6 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. 3.

The primary E-RNTI is unique for each UE. The AG value indicates the maximum power ratio of the E-DPDCH to the corresponding DPCCH. see HSUPA Serving Grant Update (subclause 11.8. Here. the E-AGCH will again mask the CRC with the primary or secondary E-RNTI. Only the primary E-RNTI is used in the current RAN version. When the E-DCH is configured with 10 ms TTI. 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".RAN HSUPA Description 3 HSUPA Principles Figure 3-7 Frame structure of the E-AGCH An E-DCH AG has to be carried by one E-AGCH subframe or one E-AGCH frame. For detailed information on SG update. only the value "All HARQ processes" is valid. When the UE demodulates the E-AGCH. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. depending on the E-DCH TTI is 2 ms or 10 ms.. "All HARQ processes" means that the AG is for all HARQ processes. Only the UE having the same E-RNTI can demodulate the information correctly. − − "Per HARQ process" means that the AG is for one HARQ process. 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.1. The mapping of AG values is described in Table 3-1.321).3 in 3GPP 25. The RNC-assigned sequence of 16-bit CRC on the E-AGCH is masked with either a primary or a secondary E-RNTI. Ltd 3-7 . The secondary E-RNTI is usually for a group of UEs. the E-RNTI stands for E-DCH Radio Network Temporary Identifier.

.3 HSUPA Principles RAN HSUPA Description 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) x 4 (119/15)2 x 4 (150/15)2 x 2 (95/15)2 x 4 (168/15)2 (150/15) 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 (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 3-8 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Ltd Issue 02 (2008-07-30) .

The RG commands are mapped to the RG values. depending on the E-DCH TTI is 2 ms or 10 ms. or 15 consecutive slots. Each slot carries a sequence of 40 binary values. 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.3. The spreading factor of the E-RGCH is 128.. The E-RGCH is a dedicated downlink physical channel with a fixed rate of 60 kbit/s. Ltd 3-9 .RAN HSUPA Description 3 HSUPA Principles Absolute Grant Value ZERO_GRANT INACTIVE Index 1 0 3. 2. Figure 3-8 Frame structure of the E-RGCH An RG is transmitted in 3. as described in the following table. If the cell transmitting the E-RGCH is not in the serving E-DCH RLS. 15 slots are used. or 3 in the Scheduling Grant Table according to the current SG Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.4 E-RGCH The E-DCH Relative Grant Channel (E-RGCH) carries RGs for uplink E-DCH scheduling. The step can be 1. 12. then 3 or 12 slots are used. the SG is adjusted upwards or downwards by one step. If the cell transmitting the E-RGCH is in the serving E-DCH Radio Link Set (RLS).

Wose value is 18 for 2ms TTI and 12 for 10ms TTI.. then SG = SG [MIN (SGLUPR + 1. 37)]. 37)].5. For example. 0)]. 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 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. or higher than the reference_ETPR. For example. 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. If SGLUPR ≥ 2-index-step threshold. For example. and E-RGCH 2-Index-Step Threshold. The lowest power ratio is in the Scheduling Grant Table (Table 3-3). if SGIndexLUPR = 15 and 3-index-step threshold = 20. If 3-index-step threshold ≤ SGIndexLUPR < 2-index-step threshold. then SG = SG [MIN (SGLUPR + 3. then SG = SG[MAX (SGLUPR . When the SG needs to be determined due to E-RGCH signaling: The UE determines the lowest power ratio and the corresponding index in the Scheduling Grant Table: SGIndexLUPR. If the UE receives a serving RG "UP". The reference_ETPR is the power ratio of E-DPDCH to DPCCH. Ltd Issue 02 (2008-07-30) . E-RGCH 3-Index-Step Threshold whose value is 17 for 2ms TTI and 9 for 10ms TTI. then SG = SG [MIN (SGLUPR + 2. then the new SG index is 18. SG = SG[SGIndex] which means to get an SG from the Scheduling Grant Table according to the SGIndex. then the new SG index is 29. 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. 37)]. If the UE receives an RG "DOWN". if the SGIndexLUPR = 28 and 2-index-step threshold = 25. if SGIndexLUPR = 21 and 2-index-step threshold = 25. The Scheduling Grant Table is provided in Table 3-3. and is equal to.1.3 HSUPA Power Control.3 HSUPA Principles RAN HSUPA Description value. then the new SG index is 23.

RAN HSUPA Description 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) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.. Ltd 3-11 .

5 E-HICH The E-DCH Hybrid ARQ Indicator Channel (E-HICH) carries uplink E-DCH HARQ acknowledgement indicators. 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. Ltd Issue 02 (2008-07-30) . The E-HICH is a dedicated downlink physical channel with a fixed rate of 60 kbit/s.. the UE combines them as shown in the following table. Figure 3-9 Frame structure of the E-HICH The ACK and NACK mappings on the E-HICH are described in the following table. 3-12 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. For the RLSs that do not contain the serving E-DCH cell. 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: 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.3. The frame structure of the E-HICH is the same as that of the E-RGCH.3 HSUPA Principles RAN HSUPA Description 3. The spreading factor of the E-HICH is 128. the NACK is transmitted discontinuously.

Ltd 3-13 . is used as a timing reference for all the physical channels. 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. 3. ACK ACK The UE notifies the Scheduling Information Reporting function that the Scheduling Information is not received by the serving the RLS.. 3. All data High-level data only Higher layer data and SI triggered by an event or timer At least one ACK ALL NACK ALL NACK Either ACK or NACK At least one ACK At least one ACK SI only ALL NACK Either ACK or NACK 3. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.4. and includes the scheduling information with new data payload in the next packet.4.4 HSUPA Physical Channel Timing The Primary Common Control Physical Channel (P-CCPCH).2 E-AGCH Timing Relative to the P-CCPCH The E-AGCH frame offset from the P-CCPCH should be = 5120 chips.1 E-DPDCH/E-DPCCH Timing Relative to the DPCCH The timing of the E-DPCCH and all the E-DPDCHs transmitted from the UE is the same as that of the uplink DPCCH.RAN HSUPA Description 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. flushes the packet. on which the cell System Frame Number (SFN) is transmitted. directly for the downlink and indirectly for the uplink.

If the E-DCH TTI is 2 ms..3 E-RGCH Timing Relative to the P-CCPCH The timing of the E-RGCH relative to the P-CCPCH is shown in the following figure. Ltd Issue 02 (2008-07-30) . is the DPCH frame offset from the P-CCPCH. 3-14 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. In this case. Figure 3-11 E-RGCH timing relative to the P-CCPCH If the E-RGCH is transmitted to the UE. the E-RGCH frame offset from the P-CCPCH is chips. the E-RGCH frame offset from the P-CCPCH is chips.4. and the cell transmitting the E-RGCH is in the serving E-DCH RLS. the E-RGCH frame offset should be as follows: If the E-DCH TTI is 10 ms.3 HSUPA Principles RAN HSUPA Description Figure 3-10 E-AGCH timing relative to the P-CCPCH 3.

the E-HICH frame offset from the P-CCPCH should be chips..4. the E-HICH frame offset from the P-CCPCH should be chips. 3.5 Association Between Frames of Different Physical Channels 10 ms E-DCH TTI For each cell in the E-DCH active set: The UE associates the control information received through the E-HICH frame SFNi with the data transmitted in the E-DPDCH frame SFNi-3.RAN HSUPA Description 3 HSUPA Principles If the E-RGCH is transmitted to the UE. The following figure shows an example of timing of the E-HICH with 10 ms TTI. the E-RGCH frame offset from the P-CCPCH should be 5120 chips. Ltd 3-15 .4. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Figure 3-12 E-HICH timing relative to the P-CCPCH If the E-DCH TTI is 10 ms. and the cell transmitting the E-RGCH is not in the serving E-DCH RLS. If the E-DCH TTI is 2 ms.4 E-HICH Timing Relative to the P-CCPCH The timing of the E-HICH relative to the P-CCPCH is shown in the following figure. = 3.

Ltd Issue 02 (2008-07-30) .3 HSUPA Principles RAN HSUPA Description Figure 3-13 E-HICH timing relative to the P-CCPCH 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. Where: and . 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.. 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. 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. where 3-16 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. 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. 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 . The RRC can configure the HARQ over MAC-controlled Service Access Point (SAP). the HARQ entity is located in MAC-es/MAC-e.73 Mbit/s on the Uu interface. each having eight HARQ processes in the case of 2 ms TTI or four HARQ processes in the case of 10 ms TTI. The HARQ entity has the following parameters: 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. If the number of transmissions is larger than three. which indicate the status of E-DCH transmissions. In the NodeB. The RSN can help to indicate the Redundancy Version (RV) of each HARQ transmission and to assist in the NodeB soft buffer management. Several HARQ processes used together can fully use the transmission capability of the Uu interface. short TTI. 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. It is a combination of Forward Error Correction (FEC) and ARQ. RSN (2-bit) is sent from the UE to the NodeB.RAN HSUPA Description 3 HSUPA Principles and For the E-AGCH frame. an HARQ entity is present on both UE and NodeB sides. For every HSUPA user.5 HSUPA Key Technologies HSUPA Key Technologies describes the HSUPA key technologies: HARQ. HSUPA provides a theoretical maximum uplink MAC-e rate of 5. the HARQ entity is located in MAC-e. 3. the RSN is set to 3.1 HSUPA HARQ Hybrid Automatic Repeat reQuest (HARQ) is a multi-instance Stop-And-Wait (SAW) protocol. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.. The HARQ entity can store the MAC-e payloads and retransmit them. which increases the cell throughput. HARQ Entity In the UE. With these key technologies.5. and fast scheduling. 3. Each process is responsible for generating ACKs or NACKs. Ltd 3-17 .

The incremental redundancy mode is better because inconsistency between the retransmitted bit set and the former bit set leads to an increase in the redundant data and the possibility of recovery from errors on the Uu interface. The E-DCH RV index specifies the used RV.data. If configured by higher layers. The RV can be derived by L1 from RSN and Connection Frame Number (CFN). Ltd Issue 02 (2008-07-30) . Table 3-7 Relationship between RSN values and E-DCH RV indexes RSN Value 0 1 2 3 Note: is to round down a value.j ≥ 1/2) 0 3 2 mod 4 The parameters in the table are described as follows: Nsys is the number of system bits after channel coding. the same bit set is retransmitted.. only E-DCH RV index 0 can be used. E-DCH RV Index (When Nsys/Ne. Table 3-6 Coding combining modes of HARQ Coding Combining Mode Chase combining mode Incremental redundancy mode Description In this mode. the NodeB flushes the soft buffer associated with the HARQ process to ensure that the soft buffer is in a good condition. which is known as the rate matching pattern.data. or in the case of 2 ms TTI from the subframe number. In this mode. Combining Modes of HARQ HARQ supports two coding combining modes as shown in the following table. Redundancy Version Redundancy Version (RV) defines the selection of bits that can be transmitted on the air interface resource.j < 1/2) 0 2 0 [ mod 2 ] x 2 E-DCH RV Index (When Nsys/Ne. The UE uses the E-DCH RV indexes as listed in the Table 3-7 . different bit sets are retransmitted.3 HSUPA Principles RAN HSUPA Description 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. 3-18 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.

the fast scheduling helps improve cell throughput. see 4.0 supports both 10 ms TTI and 2 ms TTI. HSUPA can implement faster data scheduling and data transmission with lower delay.j is the total number of bits available for the E-DCH transmission per TTI with transport format j. Ltd 3-19 . the subframe number counts the five TTIs within a given CFN. For 2 ms TTI..1 MAC-e PDU Overview MAC-e PDU Overview describes the overview of MAC-e PDU. The MAC-e entity uses the scheduling information contained in the enhanced uplink and the information carried by the E-DPCCH to quickly adjust the rates of UEs based on the Uu resources. In this case.2 HSUPA Fast Scheduling. TTIN is the TTI number.6 MAC-e PDU Generation MAC-e PDU Generation describes the data transmission and MAC-e PDU generation on the UE side. − − For 10 ms TTI.data. 3. RAN10.3 HSUPA Fast Scheduling The MAC-e entity of the NodeB performs scheduling.5.5. starting from 0 for the first TTI to 4 for the last TTI. TTIN = 5 x CFN + subframe number.RAN HSUPA Description 3 HSUPA Principles Ne. NARQ is the number of HARQ processes. The 10 ms TTI is mandatory for R6 UE and the 2 ms TTI is optional for R6 UE. For details about fast scheduling. TTIN = CFN. 3.2 HSUPA Short TTI By using a short TTI on the Uu interface. 3.6. 3. Thus. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.

The TSN field (6 bits) provides the transmission sequence number on the E-DCH. HSUPA Serving Grant Update The Serving Grant (SG) update applies to every TTI boundary and takes into account the Absolute Grant (AG). MAC-d flow and MAC-d PDU size. In the MAC-e header. A mapping table is signaled over RRC. Related terms and definitions are as follows: 3-20 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. to allow the UE to set DDI values. while the right part shows PDU architecture. The SG update procedure is shown in the Figure 3-15. A special value of the DDI field indicates that no more data is contained in the remaining part of the MAC-e PDU. which then forwards the MAC-e PDU to layer 1 for transmission in one TTI. The MAC-e PDU is forwarded to a Hybrid ARQ entity. The MAC-d C/T multiplexing is bypassed.2 MAC-e PDU Generation Process On UE side. and non-serving RGs that apply to every TTI. the UE selects the E-DCH Transport Format Combination Indicator (E-TFCI) and finally creates the MAC-e PDU according to the information on different logical channels in the buffer. the DDI (Data Description Indicator) field (6 bits) identifies logical channel..3 HSUPA Principles RAN HSUPA Description Figure 3-14 Simplified Architecture for MAC Inter-working in UE In the figure. Based on the SG. An RLC PDU enters MAC-d on a logical channel. the left part shows the functional split. 3. The N field (fixed size of 6 bits) indicates the number of consecutive MAC-d PDUs corresponding to the same DDI value. the UE performs Serving Grant (SG) update upon reception from the downlink control command.6. in each TTI. and the AG processing procedure is shown in Figure 3-16. serving Relative Grant (RG). Ltd Issue 02 (2008-07-30) .

Primary Absolute Grant: An AG received with the primary E-RNTI.RAN HSUPA Description 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. not by Secondary Absolute Grants). The possible values are "Zero_Grant" and numerical values. 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. Secondary Absolute Grant: An AG received with the secondary E-RNTI. Identity Type: It takes the value "Primary" or "Secondary" based on whether the message is addressed to the primary or the secondary E-RNTI.321. The UE has only one serving E-DCH RLS. as defined in 3GPP TS 25. Stored_Secondary_Grant: This state variable is used to store the last received Secondary Absolute Grant value. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. 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.. or 16 ms in the case of 2 ms TTI). Ltd 3-21 .

.3 HSUPA Principles RAN HSUPA Description Figure 3-15 SG update procedure 3-22 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Ltd Issue 02 (2008-07-30) .

Ltd 3-23 . Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. then The UE updates the SG and sets the Maximum_Serving_Grant to SG.. the SG update is described as follows: If any non-serving RGs indicate DOWN for a TTI. and The AG or RG from the serving RLS at the same TTI is ignored.RAN HSUPA Description 3 HSUPA Principles Figure 3-16 AG processing procedure According to the two procedures shown above. The Non_Servig_RG_Timer is started (if it is inactive) and set to one HARQ RTT.

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. see subclause 11. 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. The configuration of the HARQ profile is described in E-DCH Outer-Loop Power Control. then one is from the serving RLS and the others are from non-serving RLs. start it.8. If the Non_Serving_RG_Timer is inactive. DOWN DOWN All HOLD At least one DOWN DOWN DOWN The UE saves a new Maximum_Serving_Grant.3 HSUPA Principles RAN HSUPA Description If no non-serving RGs indicate DOWN for a TTI. If the HSUPA UE receives more than one RG command. start it.321. 3-24 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. If the Non_Serving_RG_Timer is not active. HSUPA E-TFC Selection At every TTI boundary. The RRC configures the MAC with a HARQ profile and a multiplexing list for each MAC-d flow. where a new transmission is required by the HARQ entity. UP At least one DOWN DOWN The UE saves a new Maximum_Serving_Grant. In addition. For detailed information on SG update. HOLD HOLD All HOLD At least one DOWN HOLD DOWN The UE saves a new Maximum_Serving_Grant. as described below: The HARQ profile includes the power offset and the maximum number of HARQ transmissions. the new SG cannot exceed the Maximum_Serving_Grant saved last time if the Non_Serving_RG_Timer has not expired.3 in 3GPP 25. The RG commands from the serving RLS and non-serving RLs are listed in the following table.. can not exceed the Maximum _Serving_Grant if the Non_Serving_RG_Timer has not expired. If the Non_Serving_RG_Timer is inactive. however. the UE performs the E-TFC selection procedure. start it.1. Ltd Issue 02 (2008-07-30) .

RAN HSUPA Description 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. that is.3 MAC-e PDU Encapsulation The detailed procedure for encapsulating the MAC-e PDUs is described in Section 11. If a 10 ms TTI is configured and the TTI for the upcoming transmission overlaps with a compressed mode gap. Only E-TFCs in Supported state are considered in E-TFC selection. Note that: The calculation of the required transmit power for each E-TFC is the same as that described in Power Control.321.8. The maximum number of HARQ transmissions is eight in this case. Through power offset and E-DCH Transport Format Combination (E-TFC) restriction procedure. 3. the RRC configures the MAC with a special HARQ profile for "Control-only" transmissions: The power offset is fixed to 6dB.321 protocol. If the Scheduling Information (SI) needs to be transmitted without any higher-layer data. 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. At each TTI boundary. 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. the SG provided by the SG update function is scaled down according to the following equation: SG' = SG x (NC/15) Where: SG' represents the modified SG considered by the E-TFC selection algorithm. the TB size can be obtained in the next TTI. 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. the MAC-e PDUs can be encapsulated on the basis of the following principles.6. According to the priority levels of logical channels and the scheduling modes. but the MAC-d packet of higher priority logical channel cannot be multiplexed into the MAC-e PDU of the lower priority logical channel. Logical channels support absolute priority. Nc depends on the compressed mode which can be configured by the SET TGPSCP command. The SI is always sent when the transmission is triggered. a given E-TFC can be in Supported state or Blocked state. For each configured MAC-d flow. refer to the 25.. For all logical channels: Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. NC represents the number of non DTX slots in the compressed TTI. the UE maximizes the transmission amount of higher-priority data. For the detailed procedure of E-TFC selection. Ltd 3-25 .1.4 and Appendix C of 3GPP 25.

Non-Scheduled Transmission Mode In non-scheduled transmission mode. only the streaming service. the UE can transmit data at the rate specified by the RNC. The MAC-d flows are configured in non-scheduled transmission mode or scheduled transmission mode.. Scheduled Transmission Mode In scheduled transmission mode. without a grant from the Node B.01 for each RAB and 5 for each SRB. the current non-scheduled grant of the user determines whether the data can be transmitted.3 HSUPA Principles RAN HSUPA Description If the logical channel belongs to a non-scheduled MAC-d flow. the current SG of the user determines whether the data can be transmitted. If an MAC-d flow is configured with the non-scheduled transmission mode. If the logical channel does not belong to a non-scheduled MAC-d flow. 3-26 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. The non-scheduled transmission mode is suitable for the services with the requirements for low delay and steady source data rate. see 4. 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. conversational service can be mapped onto the E-DCH in non-scheduled transmission mode. 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: 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. in non-scheduled mode. Data Description Indicator (DDI). If only non-scheduled MAC-d flows are configured for a UE. Ltd Issue 02 (2008-07-30) . In RAN10. Therefore.0. 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 NodeB does not send any AG or RG to this UE. For detailed information.2 HSUPA Fast Scheduling. the UE receives a grant from the NodeB before sending data. namely RLC PDU size minus RLC PDU header MACdPDUSize: MAC-d PDU size 18: sum of bits for the Transmission Sequence Number (TSN). the E-DCH becomes a "fast retransmission DCH" without scheduling.

and CE scheduling algorithm. and CE scheduling. Differentiated services: If a user has a higher SPI.2 Algorithm of Flow Control Flow control is implemented to reduce delay and packet loss rate. and uses the corresponding algorithms to perform the following functions: 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. 4. more CEs are required. and to achieve better utilization of the Iub bandwidth. to maximize uplink throughput. Ltd 4-1 . HSUPA fast scheduling algorithm. the buffer usage. it can obtain more uplink resources compared with a user with a lower SPI. 4. and provide the detailed information on algorithms for fast scheduling.1. and the CE resource may become a bottleneck. Iub resources. Fairness of services: If some UEs have the same Scheduling Priority Indicator (SPI). Iub flow control information. and CE resources on the NodeB. The scheduling procedure takes into account such factors as Scheduling Priority Indicator (SPI). the NodeB uses three algorithms.1.RAN HSUPA Description 4 HSUPA Algorithms 4 HSUPA Algorithms HSUPA algorithms introduce the HSUPA related algorithms. With the introduction of HSUPA. namely.. As the number of HSUPA UEs increases. the NodeB performs fast scheduling to adjust the data rates of the UE. 4. 4. the algorithm allocates the same uplink resources to these UEs. absolute grant (AG).1. and CE resources for the UE. These algorithms respectively consider the Uu resources. flow control.1 Overview of HSUPA Related Algorithms This section describes the relation among algorithms in HSUPA. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. thus matching the Uu rate with the Iub transport capability. This algorithm can also affect the way the fast scheduling algorithm grants the UE. and variation trend of the Iub port. or relative grant (RG).1 Algorithm of HSUPA Fast Scheduling By sending a scheduling grant. flow control algorithm. the consumption of CEs also increases. Guaranteed Bit Rate (GBR).3 Algorithm of CE Allocation After HSUPA is introduced. Flow control algorithm dynamically adjusts the available bandwidth of HSUPA UE based on the congestion state of the transport network.

Figure 4-1 Overview of HSUPA algorithms relation The figure shows the relation among the three HSUPA algorithms on the NodeB side. In this mode. the results of both flow control and CE scheduling shall be reported to the MAC-e entity. the algorithm can control the UL interference on the Uu interface and avoid congestion on the Iub interface.. 4. available uplink Iub bandwidth. and CE resource. That is.4 HSUPA Algorithms RAN HSUPA Description 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. Ltd Issue 02 (2008-07-30) . the MAC-e scheduling also considers the impact of flow control and CE scheduling results when giving the scheduling grants. the UE sends resource requests with the Scheduling Information (SI) on the E-DPDCH and the Happy Bit on the E-DPCCH. 4-2 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.4 Relation Among HSUPA Algorithms Flow control and CE scheduling cannot directly control the transmit data rate of the UE. 4. The HSUPA CE scheduler provides the MAC-e scheduler with the number of CEs allocated to the UE and the maximum SG.2. thus fully using the CE resources. the MAC-e scheduling controls the UE maximum data rate. the NodeB can control uplink interference. The scheduling algorithm mainly performs the following operations: 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.1 Overview of HSUPA Scheduling In scheduled transmission mode. The HSUPA flow control entity sends the available bandwidth of HSUPA UE and the grant indicator to the MAC-e scheduler. Principle of the Scheduling Algorithm The scheduling algorithm considers the UL load factor. It uses the DL control channel (E-AGCH or E-RGCH) to affect the E-TFCIs used by the UEs. In addition to the Uu resources. Thus. It aims to reduce the probability of demodulation failure caused by CE resources.2 HSUPA Fast Scheduling 4. and the NodeB assigns a granted power ratio to the UE to determine the UE rate. Assigning the RG according to the Happy Bit.1.

If the conditions for sending RG UP are met.. the algorithm assigns AG to the user based on the available load resource of the cell where the UE camps or the available bandwidth of the Iub port where the UE is carried. 8.4 Handling Iub Buffer Congestion.3. Scheduling the unhappy queues in a reverse order a. and effective data rate. see 4. For details about how to judge the buffer status. and the GBR Schedule Switch parameter is set to TRUE (OPEN). Process of the Scheduling Algorithm When the scheduling period (equal to one TTI) arrives. Calculating the uplink Uu load resource of each cell and the uplink Iub bandwidth for NodeB Uplink Uu load resource of a cell = Maximum Target Uplink Load Factor . the scheduling algorithm functions are as follows: 1. and updates the remaining resources. see 4. thus obtaining a sequence of happy queues and a sequence of unhappy queues. the algorithm assigns RG to the user. the algorithm guarantees the GBR. the algorithm assigns AG to the user.4 Dynamic CE Resource Management 3. For detailed information on CE preemption and SGmax. 5.2.RAN HSUPA Description 4 HSUPA Algorithms If the user is configured with the GBR by the RNC. Limiting the UE rates according to the MBR The algorithm directly sends RG DOWN to the UEs whose rates need to be downsized by MBR limitation and updates the UL load based on the current UL load. Limiting the UE rates according to the buffer congestion state The algorithm sends RG DOWN to the user on the Iub port whose buffer is in a congested state. see 4.3 AG UP Processing in the Scheduling Algorithm. the algorithm sends AG DOWN. 4. b. Queuing users The algorithm arranges all the users that are not granted within the NodeB based on Happy Bit. The factors to be considered include the scheduling information.2. Updating the remaining resources The algorithm calculates the maximum resources that can be released by the happy users for the unhappy users. If the conditions for sending AG UP are met.4 RG UP Processing in the Scheduling Algorithm. If the conditions for sending AG UP are met. 7. For detailed information. scheduling priority indicator. Ltd 4-3 .6 MBR Processing in the Scheduling Algorithm.2. For details.total throughput of the users 2.actual load Uplink Iub bandwidth of a NodeB = bandwidth available for HSUPA users within the NodeB range . 6. Else if the conditions for sending RG UP are met. GBR. For an unhappy user. see 4. see 4. and updates the remaining resources. Limiting the UE rates according to the CE resource Based on SGmax and CE preemption. Scheduling the happy queues and the unhappy queues in turn Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. For details. rather than sends RG DOWN to the happy users. the algorithm assigns RG to the user based on the available load resource of the cell where the UE camps or the available bandwidth of the Iub port where the UE is carried.

For details.5 GBR Processing in the Scheduling Algorithm. The smaller the SPI. the users must be queued first.2. During the queuing. the algorithm also considers the SPI. which is used to provide different scheduling opportunities according to the scheduling priority. for zero_grant users. Priorityn is calculated by using the following formula: 4-4 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. 4. Queuing Unhappy Users When queuing unhappy users. The algorithm arranges zero_grant users in descending order by Priorityn and puts them to the end of the unhappy sequence.2 User Queuing in the Scheduling Algorithm Regardless of whether AG or RG is assigned. The NodeB does not send the non-serving RL RG DOWN command unless both of the following criteria are met: 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.2. and current effective data rate of each user. 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 algorithm performs 4. Queuing Happy Users Regardless of whether the requirements of the users for the GBRs are met. if the GBR Schedule Switch is ON and the value of Reff of an unhappy user is smaller than the GBR. SPI and γSPI (SPI weight) are the same as those used for HSDPA. Firstly. the greater the value of Priorityn. Priorityn is the priority value of user n SPI is assigned by the RNC. When the scheduling period arrives. the algorithm queues all the happy users in descending order by Priorityn. and the NodeB receives the data or SI correctly. In the process. Priorityn = Reff/γSPI Where.. the algorithm considers the effective data rate. Reff is calculated according to the formula described in Calculating the Effective Data Rate. the scheduling algorithm puts the users who can correctly receive data or SI into a happy sequence or an unhappy sequence according to the happy bit carried on the E-DPCCH. During the scheduling. GBR. the rate of such a user is decreased before that of a user with a smaller Priorityn. the algorithm sends RG DOWN to the UE and updates the remaining resources. γSPI.4 HSUPA Algorithms RAN HSUPA Description 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. and GBR satisfaction degree. see QoS Management of Services Mapped on HSDPA. Ltd Issue 02 (2008-07-30) .

Calculating the Requested Data Rate (Rreq) The NodeB must determine the requested data rate (Rreq) based on the available data amount obtained from TEBS in the UE buffer.. Priorityn is the priority value of user n. Calculating the Effective Data Rate (Reff) Reff is the effective data rate. If the data is received correctly. the algorithm queues the users according to the following principles: − For the users whose requirements for the GBRs are not met. Then. Priorityn is calculated by using the following formula: Priorityn = Reff/(γSPI x RGBR) RGBR is the GBR of the user. k) means user n and TTI k. which is used to provide different scheduling opportunities according to the scheduling priority. − 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. 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.RAN HSUPA Description 4 HSUPA Algorithms Priorityn = 1/(γSPI x Rreq) Where. Rreq is calculated according to the formula described in Calculating the Requested Data Rate (Rreq). If the GBR Schedule Switch is OFF.αeff) x Reff(n. which is a filtered value of the successfully received data rate with a α-filter: Reff(n.k) = (1 . The rate of a user is decreased before that of a following user but increased after that of the following user. for non-zero_grant users. If the GBR Schedule Switch is set to ON. Otherwise. Ltd 4-5 . αeff is an effective rate smooth factor and is fixed to 0. 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. Priorityn is calculated by using the following formula: Priorityn = Reff/γSPI. The Rreq can not exceed the maximum data rate configured by the RNC and the power can not exceed the available power obtained from UE Power Headroom (UPH). the algorithm arranges them in descending order by Priorityn and puts them before the zero_grant users. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. k) is equal to zero. –1) is an initial value and is zero.6%. k) (n. SPI is assigned by the RNC. R(n.1) + αeff x R(n. Reff(n. R(n. k . the users are queued according to the following principles: For non-zero_grant users.

Because (ßec/ßc)2 is known. 2. Calculate all (ßed/ßc)2 for all E-TFCIs according to 3GPP. The user meets the requirement: SGIndexreq . and whether the Iub bandwidth and CE resource are available.4 HSUPA Algorithms RAN HSUPA Description The formula for calculating Rreq is as follows: Rreq(n. 3. Select Rmax(UPH). select one E-TFCI whose (ßed/ßc)2 is the most similar to but smaller than (ßed/ßc)2UPH.SGIndexcur > AG Threshold. the R restricted by Q(k) is obtained.j for jth E-TFCI using the method presented in HSUPA Power Control. the Rmax(UPH) is easy to obtain. Ltd Issue 02 (2008-07-30) .k) means user n and TTI k. the algorithm calculates the grant that can be assigned to the user based on the requested rate. 1-3 j ++ . return to 1-2. SGIndexreq and SGIndexcur are obtained from Rreq and Rcur.3 AG UP Processing in the Scheduling Algorithm After the serving E-DCH cell of the UE receives the SI of the UE. If the conditions for sending AG UP are met. 1-2 Calculate the quantized ßed. The AGCH code allocated to the user is idle and not used by other users. (ßed/ßc)2UPH can be obtained from the equation. Then. Here. 1-1 Get the TB size for jth E-TFCI based on the TB table configured by the RNC. Rsupport = min{R (Maximum set of E-DPDCHs). and Uu bandwidth. If the value exceeds the range of the TB table. According to the buffer size and the TTI attribute of the UE. the TB size can be obtained. whether the AGCH code is idle. R(E-DCH MBR)} 4. Iub bandwidth. a. Otherwise.. where (n. the NodeB schedules this user through AG: The user is unhappy and the SI sent from the user is received. b. For a user in the unhappy sequence. The maximum (ßed/ßc)2 is (ßed/ßc)2UPH. Δharq is the HARQ power offset of the MAC-d flow carrying the logical channel with the ID of HLID. Calculate Rsupport. − − 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.k) = min(Rmax(UPH). From the TB table. Calculate R. argmax{R|Q(k) ≥ R x TTI}. the process stops. 4-6 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. the NodeB calculates the requested rate.2. which acts as the TB size divided by the TTI length for each E-TFC. the power of DPCCH. Calculate Rmax(UPH). 1. Calculate (ßed/ßc)2UPH according to UPH. With the TTI attribute of the UE. Rsupport). c. where 1 stands for (ßc/ßc)2. Conditions for Sending AG UP When the user meets all of the following conditions. Q(k) is the buffer size. the algorithm determines whether to assign AG UP to the user based on whether a request for the SI is received from the UE. Assume that UPH = (ßed/ßc)2UPH + (ßec/ßc)2 + 1.

see Dynamically Setting the AG Threshold. If any TEBS in SI received in this period is greater than 20. It helps to improve user experience with smaller latency. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Dynamically setting AG threshold can avoid the disadvantage described above. The scheduler in NodeB maintains the Flag for each user periodically. But if the AG threshold is too low. When an SI is received by NodeB. which increases or reduces the UE scheduling grant step by step. and instead RG can be used to provide a steady cell uplink load and a steady throughput for each user. Rcur is equal to the MAC-e PDU size divided by the TTI length. which means 1658byte < TEBS ≤ 2202byte. 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. Dynamically Setting the AG Threshold When a non-zero_grant user sends an SI request. Compared with RG. AG will not be used except at the beginning of transmission. When the traffic volume of a service source is small. For details. The AG threshold is adjusted dynamically according to the traffic volume at the service source. If the Flag is FALSE. − Rreq is calculated according to the formula described in 4. the scheduling algorithm calculates the AG to be assigned to the user based on the Uu bandwidth and Iub bandwidth. The Flag can be decided in the following ways: The initial value of the Flag is TRUE. Iub bandwidth limitation. AG causes larger fluctuation of uplink load due to a large UE data rate change. The rate of the user is not decreased because of MBR processing. The user demodulates the data on the E-DPDCH correctly. The period is set to 500ms.. the AG threshold is set to 37 to avoid usage of AG.SGIndexcur > AG Threshold. the AG threshold is 3. Ltd 4-7 . the AG threshold is set to 3 so that the user can get enough resource to send data out as soon as possible. The MAC-e PDU size can be obtained according to the E-TFCI. the NodeB can schedule the user through AG if SGIndexreq . and CE resource limitation. the scheduler checks a Flag to decide the AG threshold: If the Flag is TRUE. the scheduler assigns AG to this UE when SGIndexreq . If the user meets all these conditions. which is calculated on the basis of the E-TFCI carried on the E-DPCCH. AG can perform a faster data rate. 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.SGIndexcur > AG Threshold. When the traffic volume of a service source is large. AG threshold is 37 and only the RG can be used.2. In the period.RAN HSUPA Description − 4 HSUPA Algorithms Rcur is the current bit rate of the UE.2 User Queuing in the Scheduling Algorithm.

which indicates the amount of data available from the logical channel identified by the HLID. as shown in the following figures. then the SI transmission is triggered. When the TEBS is not zero. or by the triggering conditions. for example.4 HSUPA Algorithms RAN HSUPA Description The SI is sent by the UE to the NodeB.321. 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 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. For details. Ltd Issue 02 (2008-07-30) . UPH: UE Power Headroom. Figure 4-2 SI transmission Figure 4-3 SI structure Where. HLID: Highest priority Logical channel ID. The reporting of SI is triggered according to the SG after SG is updated.. the UE checks the SG and the 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. which identifies the highest-priority logical channel with available data. the SI transmission is triggered. when the RNC sends a reconfiguration message in response to a 1D event measurement report. The triggering of a report is indicated to the E-TFC selection function at the first new transmission. In this case. This process may be delayed if the HARQ processes are occupied by retransmissions. HLBS: Highest priority Logical channel Buffer Status. TEBS: Total E-DCH Buffer Status. If the SG has the value Zero_Grant or all processes are deactivated and the TEBS becomes greater than zero. If the serving E-DCH cell changes. The change occurs. see 3GPP25. the SI transmission can be triggered by the following conditions: Triggered by events At each TTI boundary. which indicates the ratio of the maximum UE transmission power to the corresponding DPCCH code power. The transmission of SI is initiated by the quantization of the transport block sizes that can be supported.

For details of SI triggering."Zero_Grant"). 4.. and CE resource limitation.4 RG UP Processing in the Scheduling Algorithm This part describes the conditions necessary for the algorithm to send the RG UP to the users. The user does not meet the conditions for sending AG UP. the SI is concatenated into this MAC-e PDU. If the HARQ process fails to deliver an MAC-e PDU that contains a triggered SI to the RLS that contains the serving cell.2.321. Triggered by the timer T_SING (Timer Scheduling Information . the scheduling algorithm should compare the effective data rate with the GBR and decide whether the GBR is met. 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. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. If the SI transmission is not triggered under the previous condition. no new SI is triggered if the HARQ process fails to deliver the MAC-e PDU. The rate of the user is not decreased because of MBR processing. 4.2. silver. the algorithm meets the requirements of the users for the GBRs. Ltd 4-9 . and the SI is transmitted together with higher-layer data multiplexed into the same MAC-e PDU. which can be configured on the RNC LMT through the parameter HSUPA schedule period without grant. the GBR is sent to the NodeB. In this case. The user demodulates the data on the E-DPDCH correctly.RAN HSUPA Description 4 HSUPA Algorithms Triggered periodically Triggered by the timer T_SIG (Timer Scheduling Information . Iub bandwidth limitation. the transmission of a new SI is triggered. see 3GPP 25. The user is unhappy. Otherwise.5 GBR Processing in the Scheduling Algorithm If a UE is configured with the GBR by the RNC and the GBR Schedule Switch parameter is set to TRUE (OPEN). GBR processing is as follows: If the load on the Uu interface exceeds the value of Maximum Target Uplink Load Factor. GBR is transmitted from RNC to NodeB: If the RAB ASSIGNMENT REQUEST message from the CN carries the GBR when the RAB is set up.not "Zero_Grant"). or copper) through the SET USERGBR command on the RNC LMT. The GBR can be configured for each user priority (gold. however. which can be configured on the RNC LMT through the parameter HSUPA schedule period with grant. 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 GBR configured on the RNC LMT is sent to the NodeB when the RAB is carried on HSUPA. 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 does not send AG UP or RG UP to those users whose requirements for the GBRs are already met.

Rcur(n. Rcur is equal to the MAC-e PDU size divided by the TTI length.2. In addition. When the user meets the conditions for sending AG UP. if both Rcur and Ravg of a user are greater than the E-DCH MBR. the smoothing time is 1. the algorithm does not meet the requirements of the users for the GBRs. at least the GBR is assigned to the user. If Rreq is larger than the GBR. k) = (1 . If the estimated load does not exceed the load congestion threshold. k) (n. Ltd Issue 02 (2008-07-30) .2. which is calculated on the basis of the E-TFCI carried on the E-DPCCH. which is used at the beginning.433 9. 4.95. Ravg is the average data rate of the UE. which is a smoothed value of Rcur with an α filter. Average Rate Initial Value is set to 0 kbit/s and αavg is set to 0. 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. Otherwise.4 HSUPA Algorithms RAN HSUPA Description If the load on the Uu interface exceeds the load congestion threshold. 4-10 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. no matter whether the requirement for the GBR can be met. Thus. If the estimated load does not exceed the load congestion threshold after RG UP is sent.αavg) x Ravg(n. The load congestion threshold is 0. Otherwise. The purpose is to reflect the impact of the channel fading and to smooth it.2. Ravg(n. Ravg(n. For detailed information.6 MBR Processing in the Scheduling Algorithm At each TTI.13T. RG UP is sent to the user. k) is the current bit rate of the UE. k .1) + αavg x Rcur(n. If Rreq is smaller than the GBR. When the user does not meet the conditions for sending AG UP but meets the conditions for sending RG UP. RG UP is not sent to the user.. the algorithm calculates the maximum grant that can be assigned to the user according to the load congestion threshold. − − If the estimated load does not exceed the load congestion threshold after the GBR is reached. see 3GPP 25. k) indicates user n and TTI k. about 10 times the period of fast fading that occurs during 3 km/h movement. The MAC-e PDU size can be obtained according to the E-TFCI.6s. only Rreq needs to be assigned to the user. which is an α coefficient. The E-DCH MBR is transmitted by RNC to NodeB through the signaling. neither the serving RLS nor the non-serving RL will send RG DOWN to those users whose Reff is smaller than the GBR.6%. RG DOWN is sent to this user.–1) is an Average Rate Initial Value. αavg is an Average Rate Smooth Factor.

The functional modules of the flow control algorithm are shown in the following figure. The uplink throughput of a UE on the Uu interface may vary in a wide range. This prevents large amounts of data from being discarded when data convergence causes congestion in the transport network. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. which is the input throughput of the Iub interface under the maximum rate allowed by the Iub bandwidth. the flow control algorithm restricts the throughput on the Uu interface only by affecting the grant given by the scheduler. Principles of Flow Control The data rate on the Uu interface is restricted only by the UE capability and the grant given by the MAC-e scheduler. the data stored in the Iub buffer will be continuously increased. the delay must be kept within the given range and packet loss must be minimized. When the Iub bandwidth becomes the bottleneck of uplink data transmission. the flow control algorithm performs the following functions: Adjusts the maximum available bandwidth of Iub port according to the congestion state of the transport network. Adjusts the available bandwidth of HSUPA according to the change trend of the Iub buffer.1 Overview of HSUPA Flow Control Flow control is implemented to reduce delay and packet loss rate. to maximize uplink throughput.. Controls the Iub buffer usage to ensure that the buffer-caused delay is within the allowed range without any packet loss. thus maximizing the uplink throughput and achieving better use of the Iub bandwidth.3 HSUPA Flow Control 4. Without flow control. a higher delay or packet loss rate may be incurred. Therefore. Meanwhile. the flow control algorithm needs to maintain the throughput from the Uu interface.3. Ltd 4-11 . HSUPA UEs would share Iub resources in a more flexible way than R99 UEs. Figure 4-4 Principles of flow control To control the packet loss and the delay on the Iub interface. and informs the scheduler of controlling the total traffic volume of HSUPA UEs according to their available bandwidth. and to achieve better use of the Iub bandwidth. If the uplink throughput on the Uu interface is continuously wider than the Iub bandwidth.RAN HSUPA Description 4 HSUPA Algorithms 4.

2 Adjusting the Maximum Available Bandwidth of the Iub Port In the case of network convergence or hub NodeB. the bandwidth configured for the NodeB can be greatly wider than the resource available in the transport network. ATM transport is different from IP transport. two different algorithms are provided. the RNC side sends a congestion indication to notify the NodeB of the congestion state when the MAC-d flow is transmitted on the Iub interface.3 Adjusting the Available Bandwidth of HSUPA 4.4 Handling Iub Buffer Congestion 4. 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.4 HSUPA Algorithms RAN HSUPA Description Figure 4-5 Functional Modules of Flow Control Algorithm Scheduling Module: allocates grants to the UEs according to the Uu load resources and the available bandwidth of the HSUPA users.3. and provides the buffer congestion state of Iub port according to the buffer use. Algorithm for ATM Transport The RNC side detects the delay and loss of the FP frame in each MAC-d flow by using the FSN and CFN in the FP frame. therefore. Transport Network Congestion Control Module: detects the congestion state of the transport network and adjusts the maximum available bandwidth of Iub port accordingly. 4-12 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. The HSUPA flow control algorithm automatically adjusts the maximum available bandwidth of the Iub port based on the congestion state of the transport network. 4. The detailed functions of each module are described in the following sections.3..2 Adjusting the Maximum Available Bandwidth of the Iub Port 4. Buffer Usage Reporting Module: reports the buffer use of Iub port. as shown in the following figure. Then.3.3. Ltd Issue 02 (2008-07-30) .

The initial step is 10 kbit/s. Its value range is described as follows: 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.RAN HSUPA Description 4 HSUPA Algorithms Figure 4-6 Procedure of TNL congestion indication Where the Congestion Status indicates whether there is transport network congestion. − Algorithm for IP Transport For IP transport. This step is set to 2%. to periodically detect the transmission delay and frame loss in the IP network. This step is set to 1%. the NodeB takes statistics on the congestion indications of all the MAC-d flows on the Iub port and performs the following operations: If there is a congestion indication "TNL Congestion – detected by frame loss". The step is doubled every time the five consecutive increases are complete. Otherwise. The maximum step is 100 kbit/s. Ltd 4-13 . − If there is a congestion indication "TNL Congestion – detected by delay build-up". the NodeB increases the maximum available bandwidth by one step. the NodeB subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth. the NodeB performs the following operations: Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. the NodeB side directly uses the Performance Monitor (PM) algorithm. After knowing the congestion state of the Iub interface. rather than the congestion indication from the RNC.. 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 subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth.

the maximum available bandwidth of the Iub port is just equal to the bandwidth configured for the NodeB. a scheme is introduced to estimate the bandwidth available for HSUPA users. the occupancy rate of the Iub buffer jumps and even the buffer may overflow. For detailed information. The step is doubled every time the five consecutive increases are complete. If neither congestion is detected during three consecutive periods nor the NodeB increases the maximum available bandwidth by one step. the NodeB subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth. When a lot of R99 users access the network in a short period of time.4 HSUPA Algorithms RAN HSUPA Description If the congestion is due to frame loss.3. To avoid this problem. Otherwise. When R99 users enter or exit the network. Ltd Issue 02 (2008-07-30) . the occupancy rate of the buffer also increases all the while. 4-14 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. the NodeB subtracts the product of the maximum available bandwidth and a preset step from the maximum available bandwidth. the NodeB increases the available bandwidth of HSUPA users based on the variation. The adjustment must guarantee that the available bandwidth of HSUPA users cannot exceed the maximum available bandwidth. through the variation trend of the occupancy rate of the buffer. Therefore. which equals to 85% in the buffer non-congestion state.3. The adjustment is in direct proportion to the variation. The following figure shows the procedure for handling Iub buffer congestion. the NodeB can learn how to adjust the available bandwidth of HSUPA.3. − 4. This step is set to 2%. This bandwidth is taken as an input of the scheduling algorithm. The adjustment is in direct proportion to the variation. The data is buffered on the NodeB side when the traffic on the Uu interface jumps and exceeds the capacity of the Iub interface. If the occupancy ratio of the Iub buffer decreases and the use of the Iub bandwidth exceeds a preset value. The adjustment upper limit is 150 kbit/s.4 Handling Iub Buffer Congestion The HSUPA flow control algorithm detects the status of the Iub buffer periodically and handles Iub buffer congestion to minimize Iub packet loss rate and delay in the Iub buffer. Therefore. The adjustment process is as follows: If the occupancy ratio of the Iub buffer increases. − If the congestion is due to delay. the NodeB reduces the available bandwidth of HSUPA users based on the variation.3 Adjusting the Available Bandwidth of HSUPA If the transmission bottleneck of the Iub interface lies in the NodeB rather than the transport network. If the traffic on the Uu interface exceeds the capacity of the Iub interface all the while.. the backpressure mechanism is introduced to the flow control algorithm based on the occupancy rate of the buffer.4 Handling Iub Buffer Congestion. This step is set to 1%. 4.3. The initial step is 10 kbit/s. see 4.2 Adjusting the Maximum Available Bandwidth of the Iub Port. Otherwise the Iub port bandwidth is adjusted by 4. the bandwidth available for HSUPA users changes accordingly. The adjustment upper limit is 150 kbit/s.

If there is no dynamic CE resource management. − − The Congestion Threshold of IUB Buffer Used Ratio is 30%. In this Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. the buffer status remains unchanged. even if the actual traffic volume is very low. − If the Iub buffer occupancy rate increases.. and no AG is allowed to be sent to these users.4 k DCCH. Ltd 4-15 . the buffer state is marked congested. The HUSPA improves the uplink performance of delays and rates capacity. Otherwise. the flow control algorithm does not affect the decision of the scheduler. 4. neither AG Up nor RG Up is allowed to be sent to the users on this Iub port. but HSUPA consumes large CE resources. Where. If the Iub buffer occupancy rate does not increase. The Congestion Threshold Hysteresis of IUB Buffer Used Ratio is 5%. the NodeB compares the value of the Iub buffer occupancy rate with the previous one every 40 ms.RAN HSUPA Description 4 HSUPA Algorithms Figure 4-7 Handling Iub buffer congestion 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. − If the Iub buffer is not congested.2 k AMR voice. The processing after congestion detection is as follows: If the Iub buffer is congested. The detection of the buffer state is as follows: If the Iub buffer occupancy rate > The Congestion Threshold of IUB Buffer Used Ratio + The Congestion Threshold Hysteresis of IUB Buffer Used Ratio.4 Dynamic CE Resource Management Overview of Dynamic CE Resource Management A channel element (CE) is defined as the baseband resources required in the NodeB to provide capacity for 12. 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. The HSUPA shares the CE resource with the R99 services. the scheduler sends the RG Down message to all the HSUPA users on this Iub port. the NodeB will allocate the CE resources according to the maximum rate of the UE. including 3.

the algorithm also adjusts CE resources. the utility of the CE resource is inefficient. Periodical CE Resource Adjustment The procedure for periodical CE resource adjustment is shown in the following figure. the algorithm periodically adjusts CE resources of users according to the users’ rate and the available CE resources.. Thus.4 HSUPA Algorithms RAN HSUPA Description case. Considering that the rate of HSUPA user changes fast. The period is 500 ms. 4-16 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Dynamic CE management can minimize the failures in demodulation and decoding due to CE. Meanwhile. Ltd Issue 02 (2008-07-30) . it also can maximize the CE usage and UL throughput. When a new RL is admitted. CE resource adjustment is performed periodically or triggered by events. Figure 4-8 Overview of CE resource management MAC-e scheduler always takes the CE resources allocated to the user into consideration. the dynamic CE resource management is necessary.

CEinit: Initial number of CEs. The CE resources called back takes effect during the next period.. then CEinit is the CE resources for transmitting an RLC PDU. CEallocate: The number of CEs allocated to the serving RLS. Processing CE resources among serving RLS for fairness Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.CEinit). the algorithm needs to notify the MAC-e scheduler of the SGmax to avoid CE insufficiency. if MAC-e scheduler uses this SG. The algorithm notifies the SGmax to the MAC-e scheduler at current TTI. CEavg: Average number of CEs. Ltd 4-17 . If the user is not configured with the GBR.RAN HSUPA Description 4 HSUPA Algorithms Figure 4-9 Procedure for periodical CE resource adjustment When each adjustment period arrives. If the CEallocate is greater than both CEinit and CEavg. which is calculated on the basis of the average rate of the serving RLS. the allocated CE resources may be insufficient. the algorithm performs the following operations: 1. which is determined by the function of the dynamic CE resource management. 2. the NodeB calls back some CEs and decreases CEallocate to Max(CEavg. Since one SG may correspond to different CE numbers. which is calculated on the basis of the configured GBR. Therefore. SGmax: Maximum SG for the UEs. 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.

After processing. For the users of the serving RLS. Table 4-1 HSUPA CEs consumption rules MinSF SF64 SF32 SF16 SF8 SF4 2xSF4 2xSF2 2xSF2 + 2xSF4 HSUPA phase 1 HSUPA phase 2 1+1+1 1+1+1. the algorithm queues the users based on Priority = Reff/γSPI.4 HSUPA Algorithms RAN HSUPA Description If the available CE resources for serving RLS are less than the CE resources that are required for increasing the SF4 to 2xSF4.5 3 5 10 20 32 48 The deference of CEs consumption rules for HSUPA phase1 and HSUPA phase2 is causes by deference hardware version. if the CE resource of a user corresponds to SF4. For the users whose Reff is greaterr than or equal to the GBR or the users whose GBR is not configured. The algorithm selects a user with the largest value of priority and reduces its rate. Increasing CE resources of the serving RLS If the CEavg during the previous period is greater than or equal to CEallocate. this user’s CE resources will be called back.5 1+1+3 1+1+5 1+1+10 1+1+20 Not supported Not supported 1 1. the algorithm queues the users based on Priority = Reff/(γSPI x GBR). as listed in Table 4-1. the algorithm can increase the CE resources of theses users by one step if there are available CE resources. the algorithm performs fairness processing. For example. the algorithm queues the users based on Priority = Reff/(γSPI x GBR). the algorithm increases the CE resources to that correspond to 2xSF4. Ltd Issue 02 (2008-07-30) . 3. The queuing of users is as follows: For the users whose Reff is smaller than the GBR. The operation of increasing CE resources is based on the user queuing. The smaller the priority value of a user is. the earlier this user’s CE is increased. For the users whose Reff is greaterr than or equal to the GBR or the users whose GBR is not configured. The users are queued in ascending order based on priority value. the algorithm stops decreasing its CE resources if the CE resources equals to CEinit. the algorithm queues the users based on Priority = Reff/γSPI. The processing of increasing CE resources is as follows: 4-18 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. When the next period arrives. The queuing of users is as follows: For the users whose Reff is smaller than the GBR. The users whose GBR are met are downsized before the users whose GBR are not met. the algorithm notifies the MAC-e scheduler of the new SGmax..

The users are queued in ascending order based on their priority value. The priority is calculated as follows: Priority = CEneed / F(SPI). as listed in Table 1-1. During the increasing procedure. the earlier the user is processed. Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. 4. Ltd 4-19 . the algorithm increases the number of CEs to CEup. If no enough CE resources are available. which are required for E-DPCCH demodulation and decoding. The algorithm allocates available CE resources as much as possible to non-serving RLs. The smaller the value of priority is. the algorithm allocates them to the users of non-serving RLs. where CEup is obtained by increasing CEavg by one step.CEassign) NRL: the number of RLs on the current UL board. After the increase of CE. 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. After increasing. the algorithm allocate the CE resources to this user. 5. the algorithm notifies the MAC-e scheduler of the new allocated CEs and SGmax. Allocating CE resources to non-serving RLs When there are available CE resources for non-serving RLs. the algorithm can preempt the CE resources of the non-serving RLs until their resource decreases to the minimum CE resources. CE(Maximum Set of E-DPDCHs)]. CEassign: the CE resource allocated to this user CEnew = Min[CEup. the algorithm notifies the MAC-e scheduler of the new CEs and SGmax. and Where.RAN HSUPA Description 4 HSUPA Algorithms The users whose GBR is not reached are increased before the users whose GBR is satisfied or not configured. 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). 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 γSPI : is the weight of SPI If the available CE resources can meet the requirements for CEneed of a user.. so that more users can obtain the gain of soft handover. Based on the CEavg of non-serving RLs during the previous period. CEE-DCH MBR. The priority value is calculated as follows: Priority = CEneed / γSPI CEneed = NRL * (CEnew . the algorithm allocates the minimum CE resources.

Ltd Issue 02 (2008-07-30) . the new RL requests CE resources according to CEinit. CE preemption is triggered and processed as follows: The algorithm preempts the CEs of non-serving RLs until their CE resources decrease to the minimum CE number. If the CE resources are insufficient. see the following descriptions in DCCC of Rate Control: Rate Reallocation Based on Throughput UL BE Rate Downsizing and Recovery Based on UL Basic Congestion UE State Transition Algorithm 4-20 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. The algorithm preempts the CE resources of users in Type1. CEup is the CE resources that are required for increasing the CEassign by a step..5 Other HSUPA Related Algorithms This section describes the following HSUPA related RAN features: HSUPA cell load control.5. see Load Control. and HSUPA directed retry. Type1: users with the GBR and Reff ≥ GBR. the algorithm preempts the CE resources according to the priority value of the users: Priority= Reff / γSPI Reff. 4. If the CE resources are still insufficient after preemption of non-serving RL.4 HSUPA Algorithms RAN HSUPA Description CEneed = NRL * (CEup – CEassign) CEassign is the CE resources allocated to the user of the serving RLS. the algorithm preempts the CE resources of serving-RLSs until the CE resources decreases to CEinit. CE Resource Adjustment Triggered by Event When a new RL is admitted. HSUPA DCCC. HSUPA power control. then in Type2.1 HSUPA Cell Load Control For detailed information about load control.2 HSUPA DCCC HSUPA DCCC involves rate reallocation based on throughput. and UE state transition when uplink channel is E-DCH.5. 4. For detailed information. UL BE rate downsizing and recovery based on UL basic congestion. or the user without GBR Type2: users with the GBR and Reff < GBR In each type. HSUPA mobility management. 4. and γSPI are the same as those described in “HSUPA Fast Scheduling”.

The type of bearer carrying the uplink services is decided on the basis whether the best cell in the DCH active set supports HSUPA. it is necessary to employ the channel mapping policy based on different cell capacity combinations in the active set. Cell capacity varies with R6. and inter-RAT handover. UL E-DPDCH. The principles of the HSUPA soft handover algorithm are as follows: The E-DCH active set and the DCH active set are maintained separately. inter-frequency handover.4 HSUPA Mobility Management After HSUPA is implemented. refer to manuals: Intra-Frequency Handover Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co.3 HSUPA Power Control HSUPA introduces the five new physical channels. DPCH connection Similar to handovers in R99-based systems. For details. If the best cell in the DCH active set supports HSUPA. E-RGCH. The difference is whether services are carried on E-DCH according to the channel mapping policy when both the UE and the cell support HSUPA. the uplink services are preferentially carried on the E-DCH. and E-HICH 4. HSUPA power control refers to the power control of these five channels: UL E-DPCCH. If HSUPA and DPCH connections are available at the same time. or others.5. and DL E-HICH. HSUPA handovers include intra-frequency handover. to decide whether the services can be carried on E-DCH. For detailed information on the HSUPA power control on these channels. the uplink services are preferentially carried on the DCH.RAN HSUPA Description 4 HSUPA Algorithms 4. The difference is that an HSUPA handover requires the management of the HSUPA serving cell. HSUPA. Therefore. inter-frequency handover. The E-DCH active set is a subset of the DCH active set or the same. Ltd 4-21 . DPCH handovers include intra-frequency handover. see Power Control on E-DPCCH Power Control on E-DPDCH E-DCH Outer-Loop Power Control Downlink Power Control on E-AGCH. and inter-RAT handover. Otherwise. DL E-AGCH. handover decisions for both of them are made individually according to the channel mapping policy and the capabilities of the UE and the cell. DL E-RGCH. there are two possible connections between the UE and the network..5. Table 4-2 Connections between UE and network Connection HSUPA connection Handover Similar to handovers in R99-based systems. Both HSUPA handover and DPCH handover are controlled by the network through the measurement report of the UE. The HSUPA serving cell always tries to change with the best cell in the DCH active set.

the UE initiates a service that has to be set up on the E-DCH according to the service mapping rules. Ltd Issue 02 (2008-07-30) . 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 length of this timer is defined by the H Retry timer length parameter. refer to Load Control: DRD_SWITCH 4-22 Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. The traffic volume of the UE increases when the UE stays in CELL_FACH state in the R99 cell. If DRD_SWITCH.5. directed retry is allowed only when it is required. between HSUPA cells. Directed Retry Between Two HSUPA Cells Assume that two neighboring HSUPA cells cover the same physical area and one cell supports HSUPA DRD. for example.. it can be set up on the DCH of the R99 cell because. Directed retry is triggered in the following cases: In the R99 cell. Directed Retry from an R99 Cell to an HSUPA Cell Suppose that an R99 cell and a neighboring HSUPA cell cover the same physical area and one is the other’s DRD neighboring cell. If both DRD_SWITCH and HSUPA_DRD_SWITCH are enabled. When one of the preceding conditions is met. Under such a circumstance. resources can be shared between R99 and HSUPA cells or. To support directed retry. the DRD_SWITCH needs to be enabled. and the service fulfills the criteria of service mapping to HSUPA. the system assigns the service to the E-DCH of the other HSUPA cell through directed retry. DCH to HSUPA retry is allowed only when it is required after a soft handover or an intra-frequency hard handover.5 HSUPA Directed Retry With the feature of directed retry. For a service that must be set up on the E-DCH according to the service mapping rules. Directed retry is triggered in the following cases: The access to an HSUPA cell is rejected when the service is set up. the system starts a timer for the inconsistency between the channel that is suitable for the service and the channel that carries the service.4 HSUPA Algorithms RAN HSUPA Description Inter-Frequency Handover SRNS Relocation 4. DRD is enabled after the relative switch is on: If DRD_SWITCH. HSUPA_DRD_SWITCH and INTER_HO_D2H_DRD_SWITCH are enabled. The associated timer expires. 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 channel switching from DCH to E-DCH is triggered. HSUPA_DRD_SWITCH and INTRA_HO_D2H_DRD_SWITCH are enabled. the admission request is rejected. For detailed information of the following parameters.

RAN HSUPA Description 4 HSUPA Algorithms INTRA_HO_D2H_DRD_SWITCH INTER_HO_D2H_DRD_SWITCH HSUPA_DRD_SWITCH Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Ltd 4-23 ..

.

. Ltd 5-1 . Effective Level Cell(ADD CELLHSUPA) RNC(SET COIFTIMER) RNC(SET FRC) RNC(SET FRC) Cell(ADD CELLHSUPA) Cell(SET MACEPARA) Cell(SET MACHSSPIPARA) Configuration on . MaxTargetUlLoadFact or HRetryTimerLen HsupaSchPrdForGrant HsupaSchPrdForNonG rant NonServToTotalEdch PwrRatio GBRENABLE SPIWEIGHT RNC RNC RNC RNC 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 GBR Schedule Switch weight of SPI NodeB NodeB Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co...RAN HSUPA Description 5 HSUPA Parameters 5 Table 5-1 Parameter Name Maximum Target Uplink Load Factor Parameter ID HSUPA Parameters Inter-RAT Handover Parameters provides information on the effective level and configuration of the parameters related to the feature.

.

212: Multiplexing and channel coding (FDD) 3GPP TS 25.211: Physical channels and mapping of transport channels onto physical channels (FDD) 3GPP TS 25.420: UTRAN Iur interface general aspects and principles 3GPP TS 25.213: Spreading and modulation (FDD) 3GPP TS 25.101: User Equipment (UE) radio transmission and reception (FDD) 3GPP TS 25.RAN HSUPA Description 6 HSUPA Reference Documents 6 HSUPA Reference Documents HSUPA Reference Documents lists 3GPP protocols and documents related to HSUPA.302: Services provided by the physical layer 3GPP TS 25.214: Physical layer procedures (FDD) 3GPP TS 25.430: UTRAN Iub interface: general aspects and principles 3GPP TS 25.301: Radio Interface Protocol Architecture 3GPP TS 25..309: FDD Enhanced Uplink 3GPP TS 25.433: UTRAN Iub interface NBAP signaling Issue 02 (2008-07-30) Huawei Proprietary and Confidential Copyright © Huawei Technologies Co. Ltd 6-1 . 3GPP TS 25.321: Medium Access Control (MAC) protocol specification 3GPP TS 25.423: UTRAN Iur interface RNSAP signaling 3GPP TS 25.

Sign up to vote on this title
UsefulNot useful