Concept of Channel Element:

The concept of channel element varies by vendor implementation. In the first-deployed CDMA systems, a channel element was effectively an integrated circuit IC! capable of encoding or demodulating a single code channel. Currently, channel element can refer either to a physical IC or to a processing capability. In terms of processing capability, it is easy to understand that a lower "# $adio %earer uses more channel element resources than a higher "#. Therefore, Channel &lement is related to the 'ardware limitations of the (ode-% itself.

Planning Aspects of Channel Elements:

The number of channel elements is not set during planning. Instead, the re)uired number of channel elements is estimated on the basis of the traffic carried by each cell, or each (ode %, if the channel elements are pooled. In this estimation, it is important to dimension the channel element pool large enough to ensure low bloc*ing probability. This is what we are doing these days by adding more resource to the Channel Elements (3900 Node-B replacement)

Concept of Credit Resources:

The principles of (ode% credit resources are similar to those of power resources, that is, to chec* in the local cell and local cell group, if any! whether the remaining credit can support the re)uesting services. According to the common and dedicated channels capacity consumption laws, and the addition, removal, and reconfiguration of the common and dedicated channels, the Controlling $(C C$(C! debits the amount of the credit resource consumed from or credit the amount to the Capacity credit of the local cell and local cell group, if any! based on the spreading factor from the available pool. If the +, Capacity credit and D, Capacity credit are separate, then resources for +, and D, are allocated separately This capacity consumption law indicates the consumption law to be used with the following procedures- $adio ,in* "etup $adio ,in* Addition $adio ,in* $econfiguration $adio ,in* Deletion

#or the $adio ,in* "etup and $adio ,in* Addition procedures, the cost given in the consumption law shall be debited from the Capacity Credit, whereas it shall credited to the Capacity Credit for the $adio ,in* Deletion procedure. #or the $adio ,in* $econfiguration procedure, the difference of the consumption cost for the new spreading factor and the consumption cost for the old spreading factor shall be debited from the Capacity Credit or credited when this difference is negative!.

The details about local cell local cell group and capacity consumption law one can re!er to the 3"## T$ %&'(33

Huawei Concepts:
Impact on Resource Pool Application in RAN Sharing
'uawei (ode%s adopt the resource pool design. $esource pools are of two types- hardware based and software based. The hardware based resource pool aims to improve the reliability and the license based resource pool aims to enable sharing between different sectors and different fre)uencies. There is no impact on hardware resource pool when $A( sharing is introduced.

Hard are !ased Resource Pool

The 'uawei (ode% architecture is interconnected. It can be easily designed for resource pools. There are uplin* and downlin* resource pools. In the uplin*, each %%+ supports access channel resources of three cells and dedicated channel resources of si. cells. The dedicated channel resource pool is based on the channel level. ,oad sharing can be applied in the uplin* dedicated channel. In the downlin*, each %%+ supports the downlin* processing of three cells and the resource pool is based on the cell level. (/0 redundancy can be available in downlin* resources. The cell means sector . carrier, that is, the %%+ is not dependent on sector or fre)uency, but on cell only. #igure 0 shows the hardware based resource pool in 1 . 2 configuration.

In 1 . 2 configuration, access resources and D, processing resources can be allocated to any three cells among the si. cells of %%+ 3. The remaining resources are allocated to %%+ 0. #or a better performance achieved by softer handover, the resources of one %%+ are preferentially allocated to intra-fre)uency neighboring cells. The +, dedicated channel shares the +, DC' hardware capacity of %%+ 3 and %%+ 0. The allocation rule is that a new $, is set up to the idlest module. #igure 2 shows the hardware based resource pool in 1 . 4 configuration.

The resource pool can improve the hardware reliability of (ode%s. There is no impact when $A( sharing is introduced.

Soft are "icense !ased Resource Pool

The baseband resource is license managed. The resources of one e#ui$alent %&.& 'bit(s A)R $oice* including +., 'bit(s -CCH* consumed in baseband processing is defined as one channel element license.

." / -" Channel Element Concept:

There are two *inds of Channel &lements C&s!- one is uplin* C& for uplin* service and the other is downlin* C& for downlin* service. The C& calculation is based on the "# regardless of the type of radio lin*, sector, and fre)uency. Therefore uplin* C& and downlin* C& form a resource pool based on licenses. The number of C& licenses configured must be within the baseband hardware capacity. If the number of consumed C&s reaches the configured number of C& licenses, an alarm is generated, which indicates the need to e.pand operator licenses. The resource pool based on licenses can fle.ibly evolve to meet the re)uirements of $A( sharing. 5hen $A( sharing is introduced, C& licenses can be fle.ibly partitioned into several C& license groups. The summed groups must be within the baseband hardware capacity. &ach group is managed by one license. The hardware capacity can be shared by all the groups. The baseband processing resources used by various traffic types are always normali6ed to the 02.2 *bit7s voice channels. "ince the number of the voice channel is e.pressed in Channel Element C&!, capacity of the traffic channels supported by the (ode% is also e.pressed in C&s

Consumption of Credit on DCH

Consumption of Credit on HSUPA (E-DPDCH)

The reason why +, credit consumption 8 2 9 +, C& consumption for the same data rates and services is that 0.: C&s are consumed by +, ;" 12 *bps. <nly an integer value can be supported in )E$*+)CE $T,T+$ -N.-C,T-*N over the Iub interface. During implementation, +, credit are provided by multiplying +, C& by 2. #or e.ample, in a standard low capacity license of D,4=7+,4=, the digitals are channel elements and the corresponding credits are D,4= and +,>?. The amount of credit consumed by the &-D;CC' e)uals one. Moreover, certain credit are reserved for '"D;A $A%@ so credit admission for '"D;A is not needed.

HSDPA/HSUPA service utili ation wit! respect to Credit "esources

For the network elements and the terminal itself the use of HSDPA and HSUPA causes a lot of changes, especially on the physical layer as well as on the MAC and !C layers" From the #C point of $iew there is an impact which is due not only to the already mentioned flow control %ut also, on the other hand, to the changes in M" Mo%ility e$ents cause some changes in addition to the opportunity to share &u% resources dynamically %etween all users" Further, the data rates increase from the practical ma'imum of ()* k%ps for elease ++ de$ices up to ,*M%ps also cause change in &u% utili-ation"

5ith the ;D; Conte.t Activation Accept message, the "A"( signals to the +& that thedesired ;" connection is now available. Independent from this (A", the signalling $(C initialises another measurement procedure in the +&. &specially the capacity allocation procedure contains important performance-related parameters. "ince '"-D"C' resources are controlled by (ode %, the $(C as*s for provision of necessary transport resources using the #; '"D"C' capacity re)uest message. In the capacity allocation message (ode % signals what was granted. $,C ;D+s transmitted for this specific call are prioriti6ed using a priority indicator that has a value in the range from 3 to 0: 0: indicates highest priority!. The credit information element represents the number of $,C ;D+s that the $(C is allowed to transmit within a certain time interval. The interval is a multiple of the TTI used in the '"-D"C', a typical TTI value is 2 ms. 5hen performance-related data from (ode % is available together with the data captured by the lub porbes, it can be proved that there is a linear correlation between CBI sent by +& on radio interface to the serving '"-D"C' cell and the credits sent by the cellCs (ode % to the "$(C. 'ence, evaluation of credits allows to estimate values of CBI although CBI is not transmitted via lub interface. After all data has been transmitted by the $(C, (ode % will send anther capacity allocation message that starts the ne.t se)uence of D, data transfer and this procedure will continue in the same way as long as '"-D"C' is used by a +&. Data transmission starts after each capacity allocation on Iub- uplin* data is transported in the Iub physical transport bearer of the DC' and

downlin* I; data is transmitted in the AA,2 "DC of MAC-d flow, which will be multiple.ed onto the '"-D"C' by (ode %.