UTRAN Optimization Guide v3

UTRAN Optimization Guide USR3
UTRAN Optimization Guide

USR3
Systems Engineering
Abstract
This document provides a description of a number of features and algorithms supported in the Motorola
UTRAN, in particular in the area of Radio Resource Management. Guidelines to configure, optimize
and characterize the performance of these features are also included. The actual parameter settings are
documented in a separate spreadsheet.
Version Date Status Document Id
3. !!"#un"!$ Released UMT%"MRN&"%U'%(%"%)*&"+
This document and the information contained in it is &,N-./*NT.A0 .N-,RMAT.,N of Motorola, and shall not be used, published,
disclosed, or disseminated outside Motorola in 1hole or in part 1ithout Motorola2s consent. This document contains trade secrets of Motorola.
Reverse engineering of an3 or all of the information in this document is prohibited. The cop3right notice does not impl3 publication of the
document
Motorola &onfidential )roprietar3 4
Reease !istory
Version Date Aut"ors #"ange !istory
3. !!"#un"$ 5elena 5uang, 0iu (ongmei,
6iu 'in, #in %hi, 7u
&hengming, 7u 8iaobin, 8iao
/eng9un, /avid 'hatoolaul,
#onathan 7allington, 7alter
-eatherstone, %eiama9 :ahid,
%teve Aftela9, %teve 'arrett,
0uis 0opes, *ric :illier
-ormal release.
Motorola &onfidential )roprietar3 !
Tabe o$ #ontents
% O&TI'I(ATION GUIDE))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%*
4.4 .NTR,/U&T.,N................................................................................................................. 4;
4.! %TRU&TUR*...................................................................................................................... 4+
4.3 R*-*R*N&* )ARAM*T*R% %)R*A/%5**T..........................................................................4+
+ ,UA-IT. O/ SERVI#E)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+%
!.4 .NTR,/U&T.,N................................................................................................................. !4
3 RA01TO1R0 'A&&ING))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))++
3.4 %*0*&T.,N ,- RA'.N/*8*/ %*T ,- R' )ARAM*T*R%.....................................................!$
3.! %*0*&T.,N ,- 5%/)A, /&5 ,R -A&5 RA/., '*AR*R...................................................!<
3.3 )/&) 0A(*R )ARAM*T*R%...............................................................................................!<
3.= R0& 0A(*R )ARAM*T*R%.................................................................................................!>
3.$ /&5 MA& 0A(*R............................................................................................................!;
3.$.4 /&5 MA& ?T- Trimming@ Algorithm..........................................................................3
3.$.! /&5 MA& ?.ncomplete T-&% &onfiguration@ Algorithm............................................34
3.$.3 /&5 MA& AMR T-&% &onstruction..........................................................................3!
3.$.= /&5 MA& MultipleAing BT-& %electionC Algorithm....................................................3!
3.$.$ &ommon &hannel MA& MultipleAing Algorithm..........................................................33
3.< 5%/)A MA& 0A(*R........................................................................................................3=
3.<.4 5%/)A MA& 0a3er %cheduling )riorit3 .ndicator.......................................................3>
3.> /&5 )5( 0A(*R............................................................................................................. 3;
3.>.4 /0 %lot -ormat %election..............................................................................................3;
3.>.! /0 )o1er ,ffset /efinition...........................................................................................=
3.>.3 U0 %lot -ormat %election..............................................................................................=4
3.>.= U0 /)/&5 %preading -actor.......................................................................................=4
3.>.$ U0 )o1er Ratio............................................................................................................=!
3.; 5%/)A )5( 0A(*R.........................................................................................................=3
3.+ .U 6,% N*G,T.AT.,N....................................................................................................... ==
3.+.4 .u 6o% Negotiation of )% /)&5 '* %ervices..............................................................=$
3.+.! .u 6o% Negotiation impacts on %ervice *stablishment D Modification.........................=;
3.+.3 .u 6o% Negotiation impact on )% and &% %ervice Release............................................=+
3.4 /*)*N/*N&.*%................................................................................................................. =+
3.4.4 /ependenc3 on &ore Net1or9 capabilities....................................................................=+
3.4.! /ependenc3 on U* capabilities.....................................................................................$
3.44 /ATA'A%* )ARAM*T*R%....................................................................................................$=
3.4! E*( )*R-,RMAN&* .N/.&AT,R%........................................................................................$$
3.43 ,)T.M.FAT.,N GU./*0.N*%................................................................................................ $<
3.43.4 )arameters and recommendation...................................................................................$<
3.43.! *Apected E). values.....................................................................................................$<
3.43.3 %ensitivit3 anal3sis........................................................................................................$<
2 RA0 DO3NSI(ING)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 45
=.4 ,:*R:.*7........................................................................................................................ $>
=.! A0G,R.T5M /*%&R.)T.,N.................................................................................................$;
=.!.4 %ingle RA' case...........................................................................................................$;
=.!.! Multi RA' case............................................................................................................$+
=.3 /*)*N/*N&.*%................................................................................................................. <4
=.= R*0AT*/ 0MT &,MMAN/%...............................................................................................<4
=.=.4 %*T &,RRMA0G,%7.T&5......................................................................................<4
=.=.! %*T -R&......................................................................................................................<!
=.$ E*( )*R-,RMAN&* .N/.&AT,R%........................................................................................<!
=.< ,)T.M.FAT.,N GU./*0.N*%................................................................................................ <!
=.<.4 )arameters and recommendation...................................................................................<!
=.<.! *Apected E). values.....................................................................................................<!
=.<.3 %ensitivit3 anal3sis........................................................................................................<!
4 D.NA'I# #!ANNE- #ON/IGURATION #ONTRO-))))))))))))))))))))))))))))))))))))))))))))))))))))))63
$.4 /&&& A0G,R.T5M &,NTR,0 %7.T&5*%............................................................................<=
$.! /*TA.0*/ /*%&R.)T.,N.................................................................................................... <$
$.!.4 .nitial Rate %election.....................................................................................................<$
$.!.! Measurements............................................................................................................... <<
$.!.3 Multi"RA' support.......................................................................................................<;
$.!.= Algorithm flo1..............................................................................................................<+
$.!.$ .ub &ongestion &ontrol.................................................................................................>!
$.3 RR& %TAT* %7.T&5.NG A0G,R.T5M..................................................................................>3
$.3.4 &*00G/&5 H &*00G-A&5......................................................................................>3
$.3.! &*00G-A&5 H &*00G)&5......................................................................................>=
$.3.3 &*00G)&5 I URAG)&5..........................................................................................>=
$.3.= Relationship 1ith ?)% .nactivit3 Timer@ algorithm........................................................>=
$.= E*( )*R-,RMAN&* .N/.&AT,R%.......................................................................................>$
$.=.4 *Apected E). :alue.......................................................................................................>$
6 INTER1RAT !ANDOVER 7SERVI#E1 AND -OAD10ASED8)))))))))))))))))))))))))))))))))))))))))))))55
<.4 TR.GG*R &,N/.T.,N......................................................................................................... >>
<.! U*% AN/ T5*.R G%M N*.G5',UR &*00% 6UA0.-.&AT.,N..................................................>;
<.3 .NT*R"RAT M*A%UR*M*NT% AN/ TARG*T &*00 %*0*&T.,N...............................................>+
<.= 5AN/,:*R *8*&UT.,N....................................................................................................;4
<.$ /*)*N/*N&.*%................................................................................................................. ;4
<.< /ATA'A%* )ARAM*T*R%....................................................................................................;!
<.> E*( )*R-,RMAN&* .N/.&AT,R%........................................................................................;3
<.; ,)T.M.FAT.,N GU./*0.N*%................................................................................................ ;=
<.;.4 )arameters and recommendation...................................................................................;=
<.;.4.4 *Apected E). values.................................................................................................;=
<.;.! %ensitivit3 anal3sis........................................................................................................;$
5 A'R #ONTRO-)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))*6
>.4 ,:*R:.*7........................................................................................................................ ;<
>.4.4 /escription.................................................................................................................... ;<
>.4.! Uplin9 AMR &ontrol.....................................................................................................;;
>.4.3 /o1nlin9 AMR &ontrol................................................................................................;+
>.! /*)*N/*N&.*%................................................................................................................. +
>.3 E*( )*R-,RMAN&* .N/.&AT,R%........................................................................................+
>.= ,)T.M.FAT.,N GU./*0.N*%................................................................................................ +!
>.=.4 *Apected E). values.....................................................................................................+!
>.=.! %ensitivit3 anal3sis........................................................................................................+3
>.=.!.4 /0 Average )o1er B&apacit3C Gain of cells under different loads.............................+3
>.=.!.! U0 Average )o1er B&apacit3C Gain of cells under different loads.............................+=
* 'O0I-IT. 'ANAGE'ENT))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))96
;.4 .NTR,/U&T.,N................................................................................................................. +<
9 #E-- SE-E#TION AND RESE-E#TION))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))95
+.4 ,:*R:.*7........................................................................................................................ +>
+.4.4 &ell selection procedure.................................................................................................+>
+.4.4.4 &ell selection criterion %............................................................................................+;
+.4.! U* measurements..........................................................................................................+;
+.4.3 &ell reselection in .dle Mode.........................................................................................++
+.4.3.4 &ell reselection criterion %.......................................................................................4
+.4.3.! Ran9ing criterion R.................................................................................................4
Motorola &onfidential )roprietar3 =
+.4.3.3 -irst ran9ing of cells................................................................................................44
+.4.3.= %econd ran9ing of cells............................................................................................44
+.4.= &ell reselection in RR& &onnected Mode....................................................................4!
+.! /ATA'A%* )ARAM*T*R%..................................................................................................4!
+.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................4!
+.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................4=
%: INTRA1/RE,UEN#. !ANDOVER)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%:5
4.4 ,:*R:.*7...................................................................................................................... 4>
4.4.4 /escription.................................................................................................................. 4>
4.4.4.4 .ntra"freJuenc3 Reporting *vents........................................................................4;
4.4.4.4.4 *vent 4&.........................................................................................................4;
4.4.4.4.! *vents 4A and 4'............................................................................................4+
4.4.4.4.3 *vent 4/.........................................................................................................4+
4.4.4.! %oft 5andover )rocessing....................................................................................4+
4.4.4.!.4 Monitored 0ist /etermination..........................................................................444
4.4.4.!.! %ofter 5andover..............................................................................................444
4.4.4.!.3 /etected %et Management...............................................................................444
4.4.4.!.= %imultaneous A% Update )rocedures...............................................................444
4.4.4.3 5%"/%&5 &ell &hange )rocessing......................................................................444
4.4.4.3.4 *vent 4'.........................................................................................................44!
4.4.4.3.! *vent 4&.........................................................................................................44!
4.4.4.3.3 *vent 4/.........................................................................................................44!
4.4.4.3.= 5%"/%&5 to /&5 re"mapping.......................................................................44!
4.4.4.3.$ 5%"/%&5 cell change eAecution B.nter"Node 'C.............................................443
4.4.4.3.< 5%"/%&5 cell change eAecution B.ntra"Node 'C.............................................443
4.4.4.3.> 5%"/)&&5 po1er offsets..............................................................................443
4.4.! /ependencies...............................................................................................................443
4.! /ATA'A%* )ARAM*T*R%.................................................................................................. 443
4.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................44=
4.= ,)T.M.FAT.,N GU./*0.N*%.............................................................................................. 44<
4.=.4 %ensitivit3 anal3sis......................................................................................................44>
4.=.4.4 Reporting range of event 4A and event 4'...........................................................44+
4.=.4.! Time"to"trigger of event 4A and event 4'............................................................4!
4.=.4.3 &).&5 po1er......................................................................................................4!
4.=.4.= 0oading Bcarried trafficC......................................................................................4!
4.=.4.$ Radio channel model............................................................................................4!
4.=.4.< U* Mobilit3........................................................................................................4!4
4.$ 5AR/ 5AN/,:*R............................................................................................................ 4!4
4.$.4 .ntroduction................................................................................................................. 4!4
4.$.! /ependencies...............................................................................................................4!4
4.$.3 Ee3 performance indicators.........................................................................................4!!
4.$.= ,ptimization guidelines...............................................................................................4!!
%% #O'&RESSED 'ODE)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%+2
44.4 ,:*R:.*7...................................................................................................................... 4!=
44.4.4 /escription.................................................................................................................. 4!=
44.4.4.4 Gap pattern description.......................................................................................4!$
44.4.4.! -rame %tructure T3pes in &ompressed Mode......................................................4!+
44.4.4.3 )o1er &ontrol in &ompressed Mode...................................................................43
44.4.4.= &ompressed Mode ,peration..............................................................................434
44.4.! /ependencies...............................................................................................................43!
44.! /ATA'A%* )ARAM*T*R%..................................................................................................433
44.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................433
44.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................433
44.=.4 )arameters optimization..............................................................................................433
44.=.! )arameter recommendations........................................................................................43<
Motorola &onfidential )roprietar3 $
44.=.3 *Apected E). values...................................................................................................43<
%+ INTER1/RE,UEN#. !ANDOVER)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%35
4!.4 ,:*R:.*7...................................................................................................................... 43>
4!.4.4 /escription.................................................................................................................. 43>
4!.4.4.4 .nter"freJuenc3 reporting events..........................................................................43>
4!.4.4.! .nter"freJuenc3 periodic and event"triggered reporting.........................................43+
4!.4.4.3 .nter"freJuenc3 handover processing....................................................................43+
4!.4.! /ependencies...............................................................................................................4=
4!.! /ATA'A%* )ARAM*T*R%..................................................................................................4=4
4!.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................4=4
4!.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................4=4
4!.=.4 )arameter recommendations........................................................................................4=4
4!.=.! *Apected E). values...................................................................................................4=!
4!.=.3 %ensitivit3 anal3sis......................................................................................................4=!
%3 INTER1/RE,UEN#. !ANDOVER 7!SD&A8)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%23
43.4 ,:*R:.*7...................................................................................................................... 4=3
43.4.4 /escription.................................................................................................................. 4=3
43.4.! /ependencies...............................................................................................................4=3
43.! /ATA'A%* )ARAM*T*R%..................................................................................................4==
43.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................4==
%2 INTER1RAT !ANDOVER))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%24
4=.4 ,:*R:.*7...................................................................................................................... 4=$
4=.4.4 /escription.................................................................................................................. 4=$
4=.4.4.4 .nter"RAT reporting events..................................................................................4=<
4=.4.4.! .nter"RAT periodic and event"triggered reporting.................................................4=<
4=.4.4.3 .nter"RAT handover processing............................................................................4=>
4=.4.! /ependencies...............................................................................................................4=;
4=.! /ATA'A%* )ARAM*T*R%..................................................................................................4=;
4=.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................4=;
4=.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................4=+
4=.=.4 )arameter recommendations........................................................................................4=+
4=.=.! *Apected E). values...................................................................................................4=+
4=.=.3 %ensitivit3 anal3sis......................................................................................................4=+
%4 #O'0INED INTER1/RE,UEN#. AND INTER1RAT !ANDOVER))))))))))))))))))))))))))%4:
%6 SRNS RE-O#ATION))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%4%
4<.4 ,:*R:.*7...................................................................................................................... 4$4
4<.4.4 %RN% relocation..........................................................................................................4$4
4<.4.4.4 %RN% relocation triggers for &% case..................................................................4$!
4<.4.4.! %RN% relocation triggers for )% case..................................................................4$3
4<.4.! 5%/)A %RN% Relocation...........................................................................................4$=
4<.4.!.4 %RN% relocation 1ithout .ur support..................................................................4$=
4<.4.!.! %RN% relocation 1ith .ur support.......................................................................4$$
4<.4.!.!.4 Transition to /&5 state..................................................................................4$$
4<.4.!.!.! Relocation conditions......................................................................................4$$
4<.4.!.!.3 Transition bac9 to 5%"/%&5 state.................................................................4$<
4<.4.3 /ependencies...............................................................................................................4$<
4<.! /ATA'A%* )ARAM*T*R%..................................................................................................4$<
4<.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................4$<
4<.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................4$>
%5 RADIO RESOUR#E AND -OAD 'ANAGE'ENT)))))))))))))))))))))))))))))))))))))))))))))))))))))))%4*
4>.4 .NTR,/U&T.,N............................................................................................................... 4$;
Motorola &onfidential )roprietar3 <
%* !SD&A #E-- #ON/IGURATION)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%49
4;.4 5%/)A ),7*R AN/ &,/*% R*%,UR&*%..........................................................................4$+
4;.4.4 )arameter overvie1.....................................................................................................4$+
4;.4.4.4 /escription..........................................................................................................4$+
4;.4.4.! /ependencies.......................................................................................................4<
4;.4.! Related 0MT commands.............................................................................................4<
4;.4.3 Ee3 performance indicators.........................................................................................4<4
4;.4.= ,ptimization guidelines...............................................................................................4<4
4;.4.=.4 *Apected E). values...........................................................................................4<4
4;.4.=.! %ensitivit3 anal3sis..............................................................................................4<4
4;.! A&EKNA&EK&6. R*),RT.NG %*TT.NG%..........................................................................4<3
4;.!.4 )arameter overvie1.....................................................................................................4<3
4;.!.4.4 /escription..........................................................................................................4<3
4;.!.4.! /ependencies.......................................................................................................4<3
4;.!.! Related 0MT commands.............................................................................................4<=
4;.!.3 Ee3 performance indicators.........................................................................................4<=
4;.!.= ,ptimization guidelines...............................................................................................4<=
4;.!.=.4 *Apected E). values...........................................................................................4<=
4;.!.=.! %ensitivit3 anal3sis..............................................................................................4<$
4;.3 5%"/)&&5 ),7*R ,--%*T%...........................................................................................4<$
4;.3.4 )arameters overvie1...................................................................................................4<$
4;.3.4.4 /escription..........................................................................................................4<$
4;.3.4.! /ependencies.......................................................................................................4<$
4;.3.! Related 0MT commands.............................................................................................4<$
4;.3.3 Ee3 performance indicators.........................................................................................4<<
4;.3.= ,ptimization guidelines...............................................................................................4<<
4;.3.=.4 *Apected E). values...........................................................................................4<<
4;.3.=.! %ensitivit3 anal3sis..............................................................................................4<>
%9 #A-- AD'ISSION #ONTRO-))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%6*
4+.4 ,:*R:.*7...................................................................................................................... 4<;
4+.4.4 .ntroduction................................................................................................................. 4<;
4+.4.4.4 Regular /&5 &A& module.................................................................................4<+
4+.4.4.! 5%/)A"related /&5 &A& module.....................................................................4<+
4+.4.4.3 5%/)A &A& module..........................................................................................4<+
4+.4.4.= Reconfiguration bet1een /&5 and 5%"/%&5...................................................4<+
4+.4.! /&5 Admission &ontrol..............................................................................................4>4
4+.4.!.4 Measurement 'ased &all Admission &ontrol Algorithm......................................4>4
4+.4.!.4.4 Algorithm ,vervie1........................................................................................4>4
4+.4.!.4.! Trigger of Admission ReJuest.........................................................................4>3
4+.4.!.4.3 &alculation of 0oad -actor.............................................................................4><
4+.4.!.4.= 'ac9ground Noise...........................................................................................4;!
4+.4.!.4.$ '0*R vs. *bKNo &urves.................................................................................4;3
4+.4.!.4.< Activit3 -actor................................................................................................4;=
4+.4.!.4.> &ell *nvironment T3pe....................................................................................4;$
4+.4.!.! *Juivalent Number of User &all Admission &ontrol Algorithm...........................4;$
4+.4.!.3 %etting the admission threshold based on the *NU..............................................4;<
4+.4.!.3.4 Uplin9.............................................................................................................4;<
4+.4.!.3.! /o1nlin9........................................................................................................4;<
4+.4.3 5%"/%&5 Admission &ontrol.....................................................................................4;>
4+.4.3.4 Algorithm ,vervie1............................................................................................4;>
4+.4.3.! General Admission &ontrol onto 5%"/%&5........................................................4;>
4+.4.3.!.4 .nsure that the total number of users per Node ' 1ill not eAceed a threshold. .4;;
4+.4.3.!.! .nsure that the total number of users per cell 1ill not eAceed a threshold.........4;;
4+.4.3.!.3 .nsure that the sum of MaAimum 'it Rates 1ill not eAceed a threshold...........4;;
4+.4.3.3 Admission &ontrol of %treaming RA's onto 5%"/%&5.....................................4;+
Motorola &onfidential )roprietar3 >
4+.4.= /ependencies...............................................................................................................4;+
4+.4.=.4 RR Module..........................................................................................................4;+
4+.4.=.! ,:%- codes management....................................................................................4+
4+.4.=.3 /irected Retr3 /ecision B/R/C...........................................................................4+
4+.4.=.= AMR Rate &ontrol BAMR&C...............................................................................4+4
4+.4.=.$ /3namic &hannel &onfiguration and Transport &hannel %1itching B/&&&C......4+4
4+.4.=.< 0oad &ongestion &ontrol B0&&C.........................................................................4+4
4+.4.=.> )otential User &ontrol B)U&C..............................................................................4+4
4+.4.=.; R0& configuration...............................................................................................4+4
4+.4.=.+ Relationship bet1een /&5 &A& and 5%/)A &A& mechanism.........................4+!
4+.! /ATA'A%* )ARAM*T*R%..................................................................................................4+!
4+.3 E*( )*R-,RMAN&* .N/.&AT,R%.....................................................................................4+3
4+.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................4+3
4+.=.4 )arameters and recommendations................................................................................4+3
4+.=.! *Apected E). values...................................................................................................4+3
4+.=.3 %ensitivit3 anal3sis......................................................................................................4+$
+: &O3ER #ONTRO-))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))%96
!.4 ,:*R:.*7...................................................................................................................... 4+<
!.! ,)*N 0,,) ),7*R &,NTR,0.........................................................................................4+<
!.!.4 .ntroduction................................................................................................................. 4+<
!.!.! /o1nlin9..................................................................................................................... 4+>
!.!.3 Uplin9......................................................................................................................... 4+>
!.!.= /atabase parameters...................................................................................................4++
!.!.$ Ee3 )erformance .ndicators........................................................................................!
!.!.< ,ptimization guidelines...............................................................................................!4
!.!.<.4 )arameters and recommendation.........................................................................!4
!.!.<.! *Apected E). values...........................................................................................!4
!.3 &0,%*/ 0,,) ),7*R &,NTR,0.....................................................................................!4
!.3.4 .ntroduction................................................................................................................. !4
!.3.! /o1nlin9..................................................................................................................... !!
!.3.!.4 .nitialization........................................................................................................!!
!.3.!.! .nner 0oop )o1er &ontrol...................................................................................!=
!.3.!.!.4 /atabase parameters.......................................................................................!=
!.3.!.!.! Ee3 )erformance .ndicators............................................................................!$
!.3.!.!.3 )arameters and recommendation.....................................................................!<
!.3.!.!.= *Apected E). values.......................................................................................!<
!.3.!.3 ,uter 0oop )o1er &ontrol..................................................................................!<
!.3.!.= )o1er 'alancing..................................................................................................!<
!.3.!.=.4 /atabase parameters.......................................................................................!>
!.3.3 Uplin9......................................................................................................................... !;
!.3.3.4 .nitialization........................................................................................................!;
!.3.3.! .nner 0oop )o1er &ontrol...................................................................................!+
!.3.3.!.4 /atabase parameters.......................................................................................!+
!.3.3.3 ,uter 0oop )o1er &ontrol..................................................................................!4
!.3.3.3.4 ,vervie1.........................................................................................................!4
!.3.3.3.! ,peration under normal conditions..................................................................!4!
!.3.3.3.3 /efinition of abnormal conditions...................................................................!4=
!.3.3.3.= /atabase parameters.......................................................................................!4>
!.3.3.3.$ Ee3 )erformance .ndicators............................................................................!4+
+% -OAD #ONGESTION #ONTRO-)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))++%
!4.4 A0G,R.T5M ,:*R:.*7...................................................................................................!!4
!4.4.4 /escription.................................................................................................................. !!4
!4.4.4.4 0&& Measurement &ontrol.................................................................................!!3
!4.4.4.4.4 Node ' )eriodic Measurement Reporting........................................................!!3
!4.4.4.4.! Node ' *vent"triggered Measurement Reporting............................................!!3
Motorola &onfidential )roprietar3 ;
!4.4.4.! U* %election )rocess...........................................................................................!!$
!4.4.4.3 Algorithm .mplementation...................................................................................!!>
!4.4.4.3.4 0/R algorithm................................................................................................!!>
!4.4.4.3.! ,0& algorithm................................................................................................!3
!4.4.! /ependencies...............................................................................................................!34
!4.! R*0AT*/ 0MT &,MMAN/%.............................................................................................!3!
!4.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................!3!
!4.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................!33
!4.=.4 )arameters and recommendation.................................................................................!33
!4.=.! *Apected E). values...................................................................................................!33
!4.=.3 %ensitivit3 anal3sis......................................................................................................!33
++ DIRE#TED RETR. DE#ISION))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+32
!!.4 A0G,R.T5M ,:*R:.*7...................................................................................................!3=
!!.4.4 /escription.................................................................................................................. !3=
!!.4.4.4 RR& Retr3 /ecision Algorithm...........................................................................!3<
!!.4.4.! Redirection Algorithm..........................................................................................!3<
!!.4.4.3 RA' Retr3 /ecision Algorithm...........................................................................!3>
!!.4.4.3.4 /&5 RA' Retr3 /ecision Algorithm..............................................................!3>
!!.4.! /ependencies...............................................................................................................!=4
!!.! /ATA'A%* )ARAM*T*R%..................................................................................................!=4
!!.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................!=!
!!.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................!=3
!!.=.4 )arameters and recommendation.................................................................................!=3
!!.=.! *Apected E). values...................................................................................................!=3
!!.=.3 %ensitivit3 anal3sis......................................................................................................!=3
+3 -A.ERED #E-- TRA//I# A0SOR&TION))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+22
!3.4 A0G,R.T5M ,:*R:.*7................................................................................................... !==
!3.4.4 /escription.................................................................................................................. !==
!3.4.4.4 .nter"freJuenc3 Measurement Reporting for 0&TA.............................................!==
!3.4.4.! Triggering of inter"freJuenc3 0&TA 5ard 5andover...........................................!=$
!3.! R*0AT*/ 0MT &,MMAN/%.............................................................................................!=<
!3.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................!=<
+2 #E-- 0REAT!ING))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+2*
!=.4 A0G,R.T5M ,:*R:.*7................................................................................................... !=;
!=.4.4 /escription.................................................................................................................. !=;
!=.! R*0AT*/ 0MT &,MMAN/%.............................................................................................!=+
!=.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................!$
!=.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................!$!
!=.=.4 *Apected E). values...................................................................................................!$!
!=.=.! %ensitivit3 Anal3sis.....................................................................................................!$3
+4 &OTENTIA- USER #ONTRO-))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+42
!$.4 A0G,R.T5M ,:*R:.*7...................................................................................................!$=
!$.4.4 /escription.................................................................................................................. !$=
!$.4.4.4 )U& /escription in U%R!...................................................................................!$=
!$.4.4.! )U& /escription in U%R3...................................................................................!$<
!$.4.! /ependencies...............................................................................................................!$>
!$.! R*0AT*/ 0MT &,MMAN/%.............................................................................................!$>
!$.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................!$;
!$.= ,)T.M.FAT.,N GU./*0.N*%..............................................................................................!<
!$.=.4 )arameters and recommendation.................................................................................!<
!$.=.! *Apected E). values...................................................................................................!<
!$.=.!.4 %ensitivit3 anal3sis..............................................................................................!<4
Motorola &onfidential )roprietar3 +
+6 'IS#E--ANEOUS TO&I#S))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+6+
!<.4 .NTR,/U&T.,N............................................................................................................... !<!
+5 RANDO' A##ESS &RO#EDURE)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+63
!>.4 RAN/,M A&&*%% A0G,R.T5M.........................................................................................!<3
!>.4.4 Algorithm ,vervie1....................................................................................................!<3
!>.4.4.4 )RA&5 Transmission Resources........................................................................!<3
!>.4.4.! )ersistence...........................................................................................................!<$
!>.4.4.3 A%& %election.....................................................................................................!<$
!>.4.4.= U* MA& Random Access )rocedure...................................................................!<>
!>.4.4.$ U* )h3sical Random Access )rocedure..............................................................!<;
!>.4.! /atabase parameters...................................................................................................!<+
!>.4.3 Ee3 )erformance .ndicators........................................................................................!>4
!>.4.= ,ptimization Guidelines..............................................................................................!>4
!>.4.=.4 )arameters and Recommendation........................................................................!>4
!>.4.=.! *Apected E). :alue.............................................................................................!>4
+* -O#ATION SERVI#ES))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+53
!;.4 .NTR,/U&T.,N............................................................................................................... !>3
!;.! &*00 ./ 0,&AT.,N M*T5,/............................................................................................!>3
!;.!.4 /escription.................................................................................................................. !>3
!;.!.! /atabase parameters...................................................................................................!>$
!;.3 A%%.%T*/ G)% 0,&AT.,N M*T5,/..................................................................................!>>
!;.3.4 /escription.................................................................................................................. !>>
!;.3.! /atabase parameters...................................................................................................!;4
!;.3.3 Ee3 performance indicators.........................................................................................!;=
+9 AT' #ONNE#TION AD'ISSION #ONTRO-))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+*4
!+.4 A0G,R.T5M ,:*R:.*7...................................................................................................!;$
!+.4.4 Algorithm for d3namic ATM connections....................................................................!;$
!+.4.! /atabase parameters...................................................................................................!;;
!+.4.3 Ee3 )erformance .ndicators........................................................................................!;;
!+.4.= ,ptimization Guidelines..............................................................................................!;+
3: RN# OVER-OAD A-GORIT!')))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))+9%
3.4 ,:*R:.*7...................................................................................................................... !+4
3.4.4 /escription.................................................................................................................. !+!
3.4.! /ependencies...............................................................................................................!+3
3.! R*0AT*/ 0MT &,MMAN/%.............................................................................................!+3
3.!.4 %*T -&%7.................................................................................................................!+3
3.!.4.4 /escription..........................................................................................................!+3
3.!.4.! )arameters...........................................................................................................!+3
3.!.4.3 *Aample.............................................................................................................. !+=
3.!.! %*T -&&)UT5/.......................................................................................................!+=
3.!.!.4 /escription..........................................................................................................!+=
3.!.!.! )arameters...........................................................................................................!+$
3.!.!.3 *Aample.............................................................................................................. !+$
3.!.3 %*T -&M%G6T5/...................................................................................................!+$
3.!.3.4 /escription..........................................................................................................!+$
3.!.3.! )arameters...........................................................................................................!+$
3.!.3.3 *Aample.............................................................................................................. !+<
3.3 E*( )*R-,RMAN&* .N/.&AT,R%......................................................................................!+<
Abbre;iations
AA0! ATM adaptation la3er !
AA0$ ATM adaptation la3er $
A& Access &lass
A.&5 AcJuisition .ndicator &hannel
AMR Adaptive Multi"Rate Bspeech codecC
AMR& AMR Rate &ontrol
AR-&N Absolute Radio -reJuenc3 &hannel Number
A%& Access %ervice &lass
'&&5 'roadcast &ontrol &hannel
'&5 'roadcast &hannel
'*R 'it error rate
&A& &all Admission &ontrol
&&)&5 &ommon &ontrol )h3sical &hannel
&N &ore Net1or9
&M &ompressed Mode
&M&- &ompress Mode &onfiguration
&).&5 &ommon )ilot &hannel
/&5 /edicated &hannel
/)&&5 /edicated )h3sical &ontrol &hannel
/)/&5 /edicated )h3sical /ata &hannel
*cKNo The ratio of received chip energ3 B*cC to the po1er spectral densit3 of the noise BNoC
-*R -rame *rror Rate
-R& -undamental Resource &onfiguration
.&0' .nter"&arrier 0oad 'alancing
0&& 0oad &ongestion &ontrol
0/' 0oad 'alancing
0/M 0oad Monitoring
0/R 0oad Reduction Bpart of 0&&C
0MT 0ocal Maintenance Terminal Ba command line client part of the RN& ,DM %3stemC
MA& Medium Access &ontrol
M0) Mac 0ogical )riorit3
MM Mobilit3 Management
NA% Non Access %tratum
N'A) Node ' Application )art
N.' Net1or9 .nterface 'oard
,G ,ptimization Guide Bthis documentC
,0& ,verload &ontrol Bpart of 0&&C
,M& ,peration and Maintenance &entre
,:%- ,rthogonal :ariable %preading -actor BcodesC
).&5 )aging .ndicator &hannel
)0MN )ublic land mobile net1or9
)MM )ac9et Mobilit3 Management
)RA&5 )h3sical Random Access &hannel
6o% 6ualit3 ,f %ervice
RA' Radio Access 'earer
RA& Radio Admission &ontrol
RA&5 Random Access &hannel
RAN Radio Access Net1or9
R' Radio 'earer
R0& Radio 0in9 &ontrol
RN& Radio Net1or9 &ontroller
R)% Reference )arameters %preadsheet
RR& Radio Resource &ontrol
R%&) Received %ignal &ode )o1er after dispreading
R%%. Received %ignal %trength .ndicator
%- %preading -actor
%-*R %ervice -rame *rror Rate
%.' %3stem .nformation 'loc9
%.R %ignal to .nterference Ratio
%R' %ignalling Radio 'earer
%TT/ %pace Time Transmission /iversit3
Motorola &onfidential )roprietar3 4!
T' Transport 'loc9
T'% Transport 'loc9 %et
T- Transport -ormat
T-& Transport -ormat &ombination
T-&. Transport -ormat &ombination .ndicator
T-% Transport -ormat %et
TG)% Transmission Gap )attern %eJuence
T)& Transmit )o1er &ontrol
T%T/ Time %1itched Transmission /iversit3
TT. Transmission Time .nterval
T:M Traffic :olume Measurement
U* User *Juipment
UTRAN UMT% Terrestrial Radio Access Net1or9
:& :irtual &ircuit
:) :irtual )ath
Ac<no=edgements
The first release of the U%R3 UTRAN ,ptimization Guide o1es much to the contributors to the
previous releases and to their editors, /are9 God3n for U%R4 and .gnacio Rivas and 0in 7eihung for
U%R!. &redits in particular to /are9 for creating the first version of this document and tirelessl3
maintaining it and eApanding it over a long period of time. Than9s to Mi9e 7itherell and %teve 'arrett
for their proposal to restructure the guide, Miguel &arames for discussing the format of the reference
parameters spreadsheet, #onathan 7allington and /avid 'hatoolaul for their help in compiling the
different chapters. The editor is also particularl3 than9ful for the contributions of numerous authors and
eJuall3 importantl3 for the great 1or9 done b3 the revie1ers.
Motorola &onfidential )roprietar3 4=
Re$erences and -in<s
The various releases of the UTRAN ,ptimization Guide can be found atL
httpLKKcompass.mot.comKgoK443!=>3$
This includes the guides for the different UMT% %3stem Releases, including the Reference )arameters
%preadsheet in U%R3, and related material such as simulation reports.
The 3G)) technical specifications are freJuentl3 referred to in this document using the 3G)) T%
identifiers Be.g. T% !$.334C. No further description is provided here as these identifiers are accurate
enough to identif3 a specific source Bprovided the eAact version is not reJuired, 1hich is the case hereC.
The 3G)) specifications are available at 111.3gpp.orgKftpKspecs.
%ince U%R4 a number of modelling activities has ta9en place in the area of Radio Resource
Management in order to validate the algorithms, assess their performance and their impact on the
overall s3stem performance and provide some guidance 1ith respect to parameter settings. These studies
1ere performed essentiall3 b3 t1o groups, G%/ %3stems *ngineering B%*C and Net1or9 Advanced
Technolog3 BNATC and lead to a number of reports Banal3sis, simulations, etc MC that can be found at
the follo1ing lin9sL
G%/ %* httpLKKcompass.mot.comKgoK+$==;>+>
NAT httpLKKcompass.mot.comKgoK+!;43+3;.
The table of references belo1 is copied from the U%R! ,ptimization Guide for references purposes as
the3 ma3 still be used in the present document. .t could be updated in a further release to include U%R3
specific references but in an3 case the %* and NAT lin9s provided above should suffice as a starting
point.
Re$erence Description
%*A4"&"-eb! %imulation anal3sis of the /&&& and Transport &hannel s1itching
algorithm v4. B+K4$K3C
%*A!"%5,3 ?%oft 5andover Results for U%R4 ,ptimisation Guide@, *. :illier,
#une3.
?Taurus v4.! 1ith &Rs %oft 5andover Algorithm N %imulation
Results@, *. :illier, #une 3.
?&omparison of %imulation Results of %oft 5andover Algorithms for
Taurus@, *. :illier, #une 3.
%*A!"%5,= ?%imulation Results for Taurus %oft 5andover Algorithm!@, *.
:illier, Aug 3.
%*A!"%5,+ ?%ensitivit3 Anal3sis of the Taurus %oft 5andover Algorithm!@, *.
Motorola &onfidential )roprietar3 4$
:illier, Nov 3.
?%imulation Results for %ensitivit3 Anal3sis of the Taurus %oft
5andover Algorithm!@, *. :illier, Nov 3.
%*A!"RRM! ?%5, Algorithm4 /escription N v!@, *. :illier, 0i Fhen, #une 3.
%*A!"RRM3 ?%5, Algorithm! /escription v4.=@, *. :illier, 0i Fhen, #ul3 3.
%*A!"%5,= ?%imulation Results for Taurus %oft 5andover Algorithm!@, *.
:illier, Aug 3.
%*A!")& ?%imulations on the Taurus :4.! U0 ,0)& algorithm for the
optimisation guide@. Aso9a Eorale AugK3.
6o%3;"*!
6o%3;"-!
?&ombined .nter"RAT 55, &ompressed Mode )arameters@, 0.
/o1ning, %. 'enes, #une 3.
*/*"%7"++"!=!"/ ?*uropa )rogramming Model and 5ost .&/@, .an 73lie, Graham
#ohnson, #un 4.
%*AKRANK3K3! ?,uter"0oop )o1er &ontrol Taurus v4.! %imulation@, *. :illier, #une
3.
%*AKRANK3K+$ ?,uter"0oop )o1er &ontrol Taurus v4.! %imulation@, A. Eorale, Nov
3.
%*AKRANK=K+$ %imulation results on the v4.3 ,0)& algorithm 1ith respect to data
mode '*R target parameter, lo1 '0*R service and multi"RA' for
the optimisation guide, Aso9a Eorale
%*AKRANK=K4= %imulation and anal3sis of the Taurus v4.! /o1nlin9 po1er
balancing algorithm for the optimisation guide, Aso9a Eorale,
=K3K!=
6o%3;"Tas9>a ?Recommended &ompressed Mode )atterns for .nter"RAT 5ard
5andover@, %. 'enes, /. %chaeffer and 0. /o1ning, #une =
%*AKRANK=K4+ ?RA&5 %ensitivit3 Anal3sis@, *ric :illier, %*A"!, #une !=
nKa ?&M )rofile ,ptimization@, Anton Ealachev, #uan &arlos del Rio, 44
March !$
Motorola &onfidential )roprietar3 4<
% Optimization Guide
%)% Introduction
The obOective of the UTRAN ,ptimization Guide 1as originall3 to provide clear guidelines to optimize
the performance of the Motorola UTRAN, in particular Bbut not restricted toC the area of Radio
Resource Management. These guidelines 1ere to include recommendations of optimized parameter
settings from a number of sourcesL anal3sis, modelling, simulations, lab tests, field eAperience. .t
became clear ver3 Juic9l3 in U%R4 that this obOective 1as both too restrictive and eAtremel3 difficult to
fulfil.
The restriction came from the fact that, to be useful for testing and initial field deplo3ment, the guide
needed to include some detailed information on specific algorithms and the related commands and
parameters to configure their operation. This 1as done from U%R4 on1ards and it 1as Juite a time"
consuming activit3. At the end, the guide 1as more than Oust about optimization guidelines. 5o1ever,
according to the feedbac9 from the internal customers of the guide, this information 1as particularl3
useful to them and so the guide should carr3 on including such information.
The difficult3 came from the fact that a significant number of parameters have to be set differentl3
depending on the activit3, i.e. lab testing, drive tests, field deplo3ment. Also, a number of parameters
can onl3 be optimized for a specific deplo3ment area and radio environment. Therefore having a single
recommendation to fit all purposes 1as not reall3 practical.
-inall3, including latest findings from modelling, lab tests and field deplo3ment 1as Bor 1ould have
beenC a fairl3 high"maintenance tas9.
An attempt has been in this U%R3 guide to tr3 and address some of the issues listed above. The
follo1ing clarifications and changes have been madeL
The main customers for the UTRAN ,ptimization Guide are Motorola internal groups BNode '
development, .%T, &%.%C, therefore there should not be an issue 1ith including proprietar3
informationP the guide is not meant to be a document released to an operator Balthough it can
obviousl3 be used as a good starting pointC.
The detailed description of the 0MT commands and parameters have been removed from the guide
and are no1 documented in a separate spreadsheet, the Reference )arameters %preadsheet.
Recommendations for parameter settings and optimization guidelines are still discussed in this guide
but the actual parameter settings are in the Reference )arameters %preadsheet. Also, the definition
of ?recommended@ or ?optimized@ parameters has been clarified and the phrase ?reference@
parameters has been adopted Bsee section 4.3C.
Motorola &onfidential )roprietar3 4>
%)+ Structure
The U%R3 UTRAN ,ptimization Guide is structured in four main components coveringL
6ualit3 of %ervice Management Bsection !C,
Mobilit3 Management Bsection ;C,
Radio Resource and 0oad Management Bsection 4>C,
Miscellaneous Bsection !<C.
There is al1a3s a degree of arbitrariness involved 1hen deciding upon such a structure. %ometimes one
could argue that a particular feature or algorithm could fit in more than one component. Nevertheless it
is hoped that the classification retained above 1ill help in understanding ho1 the different features and
algorithms all fit together and 1hich part of the UTRAN the3 affect most.
-or each feature described in the guide, the follo1ing information 1ill be providedL
an overvie1 of the algorithm including a description and a list of inter"dependencies 1ith
other algorithms,
a list of the 0MT commands used to configure the algorithm parameters,
a number of 9e3 performance indicators BE).sC that can be used to assess the overall
performance of the algorithm,
some optimization guidelines, including B1henever availableC
a sensitivit3 anal3sis based on modelling or test results,
eApected values for the E).s defined above.
The last item above is probabl3 the one that should reJuire more attention in further releases of the
guide, for eAample b3 including conclusions reached during the field trials and commercial net1or9
deplo3ments.
%)3 Re$erence &arameters Spreads"eet
The Reference )arameters %preadsheet contains a description of a number of 0MT commands 1ith
their parameters. The initial release of the spreadsheet for U%R3 includes parameter settings meant to be
a ?reference@ in the sense that the3 should provide a good starting point for lab tests and initial field
deplo3ment. These settings ma3 be based on lessons learnt in previous U%R releases Bmodelling, lab
tests, field dataC or on anal3sis andKor modelling for the ne1 features. The source of an3
recommendation is also included for each parameter to enable trac9ing of these settings.
Motorola &onfidential )roprietar3 4;
The main reasons for using a separate spreadsheet for the parameter settings 1ere to facilitate the
maintenance and update of such settings b3 the different groups involved B%*, /evelopment, .%T,
&%.%C, to provide a vehicle for merging recommendations from different groups and to enable
automation for producing an MM0 file Bas in U%R4C.
The Reference )arameters %preadsheet can be found at httpLKKcompass.mot.comKgoK4<$$33<!.
Motorola &onfidential )roprietar3 4+
+ ,uaity o$ Ser;ice
+)% Introduction
This chapter of the optimization guide is dedicated to providing an overvie1 of the algorithms that
establish, modif3 and maintain a UMT% 'earer %ervice 1ith a specific 6ualit3 of %ervice B6o%C. The
&ore Net1or9 ma3 reJuest the UTRAN to establish, modif3 or release one or several RA's 1ith a
RA' A%%.GNM*NT R*6U*%T message. This .u interface message contains up to 4= 6o% defining
information elements, including the traffic class and the maAimum bit rate Bsee 3G)) T%!3.4> D
T%!$.=43C, reJuired b3 the UTRAN to build the ne1 RA' configuration. Using these &N"generated
RA' parameters combined 1ith the 9no1ledge of U* capabilities and s3stem load, the RN& attempts
to establish and maintain a UTRAN Radio bearer to most efficientl3 meet the &N"reJuested RA' 6o%
profile.
This chapter consists of separate sections describing the follo1ing algorithmsL
RA'"to"R' mapping, this algorithm is responsible for determining the initial R0&, MA&
and )5( characteristics the radio bearer used b3 the UTRAN to attempt to meet an 6ualit3
of %ervice demands indicated 1ithin the initial &N service reJuest.
AMR Rate &ontrol, this is a connection"oriented load management algorithm that is
responsible for detecting the need for AMR mode adaptation and for performing the
reJuired procedures to change the current AMR mode to the ne1l3 selected AMR mode in
the codecs at the U* or the transcoder.
RA' /o1nsizing, to maintain and improve the admission success rate this algorithm
do1nsizes the initial maAimum bit rate of interactive and bac9ground radio bearers at
admission according to the current cell load.
/3namic &hannel &onfiguration &ontrol, this is a connection"oriented algorithm 1hich is
can reconfigure the maAimum bit rate of bearers carr3ing best effort B'*C services
Binteractive and bac9groundC. .t eAploits the burstiness of '* services b3 d3namicall3
reconfigure the channel band1idth to accommodate changes in the service transmission data
rate and lin9 Jualit3. A main feature of the /&&& algorithm is to provide continuit3 of
coverage for high"rate services b3 reconfiguring do1n a bearer 1hen the reJuired transmit
po1er becomes too high. ,ther benefits include an efficient utilization of the do1nlin9
channel code and po1er resources, 1hich in turn enhances s3stem capacit3.
.nter"RAT service"based handover, used to move U*s in the &ellG/&5 state from UMT%
to G%M based on service handover information element set b3 the &ore Net1or9 in their
RA' assignment reJuest or relocation reJuest messages.
3 RA01to1R0 mapping
The RA'"to"R' mapping algorithm is a collection of RN& based functions that translate the &ore
Net1or9 RA' reJuests to actual UTRAN Radio 'earers. The algorithm uses theL
&ore Net1or9 .u RANA) RA' Assignment message target 6o% parameters B approAimatel3 4=
in totalC
Table 3 "4 belo1 provides a list of these parameters and their related traffic class
t3pes.
Eno1ledge of the U*, Node ' and RN& capabilities
As inputs to define its primar3 output 1hich isL
The initial set of UTRAN R' defining )/&), R0&, MA& and )5( attributes
B/&5K5%/)AKslot formatKetcC.
%hould the RA'"to"R' mapping algorithm determine that it cannot define a suitable set of R'
parameters Be.g. due to U* limitationsC to support the reJuested RA' reJuest, it 1ill reOect the &N RA'
reJuest unless .u 6o% Negotiation is an option.
The &ore Net1or9 has access to 4! maOor RA' attributes as listed belo1 b3 1hich to characterize the
nature of a particular service reJuest.
Tra$$ic cass #on;ersatio
na cass
Streaming
cass
Interacti;e
cass
0ac<ground
cass
MaAimum bit rate 8 8 8 8
/eliver3 order 8 8 8 8
MaAimum %/U size 8 8 8 8
%/U format information 8 8
%/U error ratio B'*RC 8 8 8 8
Residual bit error ratio B'0*RC 8 8 8 8
/eliver3 of erroneous %/Us 8 8 8 8
Transfer dela3 8 8
Guaranteed bit rate 8 8
Traffic handling priorit3 8
AllocationKRetention priorit3 8 8 8 8
RA' As3mmetr3 .ndicator 8 8 8
Table 3"4LUMT% Radio Access 'earer %ervice Attributes per bearer traffic class
4. Rather than derive from first principals the complete set of Radio 'earer attributes B)5(, MA&,
R0& and )/&)C for each RA' reJuest, the RA'"to"R' algorithm uses an RN&"located database
to store default values for a large subset of the attributes that define a UTRAN R'.
!. -or Radio 'earer attributes Be.g. T-&%C not stored in the RN& RA'"to"R' database, functions
eAist to d3namicall3 determine optimum values at the RA' reJuestKmodification phase.
3. %ome of the default Radio 'earer attributes pre"configured 1ithin the RN& RA'"to"R' database
Motorola &onfidential )roprietar3 !4
can be modified at the RA' reJuestKmodification phase b3 additional functions 1ithin the RA'"to"
R' algorithm to compensate for potential U*KRN& limitations Be.g. R0& 1indo1 sizesC.
Most of the RN& RA'"to"R' algorithm pre"configured R' attribute values can be
reconfigured b3 the 0MT commands. The maOorit3 of these attribute values are organised
into globall3 shared Bacross all RN& cellsC ?RA'.ndeAed@ sets. A single ?RA'indeAed@ set
of parameters includes the basic R0&KMA& and )5( attributes reJuired to construct a
single s3mmetrical Radio bearer B5%/)A or non"5%/)AC designed to meet certain
RANA) 6o% target parameters Btraffic classKmaAimum bit rateC. ! ?RA'indeAed@ set of
parameters can be combined to generate an as3mmetrical Radio 'earer. The main
?RA'.ndeAed@ 0MT &ommands for defining per RA'.ndeA Radio 'earer attributes are
described in section 3.44.
=. The &N does not eAplicitl3 indicate to the RN& if a RA' reJuest is served b3 5%/)A or not. .t is
up to the RN& to decide if a RA' reJuest should be assigned a /&5 or 5%/)A radio bearer.
A single ?RA'.ndeA@ referenced set of parameters 1ill therefore include default parameters
for both the 5%/)A and /&5 version of a Radio 'earer.
$. The RN& can store up to a maAimum of 4: different Rab.ndeAed sets of fundamental radio bearer
t3pe defining data.
-or the U%R3.A release, there are currentl3 35 non"zero bit rate RA'indeAed sets of R'
parameters illustrated in -igure 3 "4.
<. &ertain RN& RA'"to"R' algorithm pre"configured R' attributes cannot be modified b3 the 0MT.
These attributes are in effect hard"coded,
The Minimum U0 %preading factor and %5, per leg po1er offsets are eAamples of a hard"
coded RN& RA'"to"R' algorithm related parameters.
Motorola &onfidential )roprietar3 !!
-igure 3"4 U%R3.A RA'"to"R' Mapping Algorithm
3)% Seection o$ RA0Inde>ed Set o$ R0 &arameters
4. ,nl3 = characteristics of the RANA) RA' reJuest Bc.f. -igure 3 "4C are actuall3 reJuired to
identif3 the most appropriate Bif it eAistsC pre"configured ?RA'.ndeAed@ set of radio bearer
B5%/)A or /&5C attributes to appl3 on either direction of a radio bearerL
Traffic &lass
&N %1itching T3pe
%ource /escriptor
MaA. 'it Rate Bin a specific lin9 directionC
!. A perfect match of the = RANA) service reJuest characteristics listed above is a=ays reJuired
for a &% service reJuest to be accepted Bas opposed to be reOectedC.
&% domain originated RA' reJuests can onl3 be supported b3 /&5 Radio 'earers.
Use of the 5%/)A bearer is reserved as an option for N,N"&,N:*R%AT.,NA0 )%
RA' reJuests onl3.
3. A perfect match of the = RANA) service reJuest characteristics listed above is not al1a3s
reJuired for a )% service reJuest to be accepted Bas opposed to be reOectedC.
N,N"&,N:*R%AT.,NA0 )% RA' reJuests services 1ith N,N")R*"&,N-.GUR*/
?MaA"bit rate@ reJuests can be mapped to the N*AR*%T pre"configured maA bit"rate pipe.
This is true for 5%/)A and non"5%/)A capable U*s.
5%/)A MaAimum Rate ReJuests Q ! MbitKs are rounded"do1n to ! MbitKs.
This is onl3 true for non"standard rates '*0,7 the maAimum available.
The N*AR*%T polic3 means that there 1ill be cases 1here N,N"%TAN/AR/ )%
bearer reJuests can be either R,UN/*/"U) or R,UN/*/"/,7N.
.f the ?MaA"'it rate@ reJuested is lo1er than the lo1est non"zero pre"defined
R' bit rate then rounding up is applied, e.g. a ! 9bitKs )%"%treaming"
Un9no1n service 1ould be mapped to the 3! 9bitKs R'.
&,N:*R%AT.,NA0 )% RA' reJuests services 1ith N,N")R*"&,N-.GUR*/ ?MaA"
bit rate@ reJuests can be R,UN/*/ U) to the N*AR*%T pre"configured maA bit"rate
pipe.
=. The R0&KMA&K)5( parameters defined for the 4!.! AMR bearer set, includes Transport
-ormats to give access to the standard lo1er rates of AMR R4.!, >.+$, >.=, <.>, $.+, $.4$,
=.>$S.
To access these lo1er rates of AMR, the ?%/U -ormat .nformation )arameter@ AN/
?MaAimum 'it Rate@ should be set appropriatel3.
Note this techniJue of appl3ing the ?%/U -ormat .nformation )arameter@ is also applied to
?rate controllable streaming@ traffic. -or eAample the &%"$>.<"%treaming bearer available
gives access Bvia the T-s definedC to rates !;.; and 4=.=.
Motorola &onfidential )roprietar3 !=
3)+ Seection o$ !SD&A? D#! or /A#! Radio 0earer
The follo1ing criteria are applied to decide if a RA' reJuest is mapped to 5%/)A on the /0L
The best cell in the Active %et has 5%/)A capabilit3P
The U* has 5%/)A capabilit3P
The RA' is a )% service
The RA' is a non"&onversational )% service.
.f the RA' is a %treaming service, the algorithm s1itch is on and the maAimum bit rate eJual or
above the maAimum bit rate threshold for %treaming to be mapped to 5%/)A.
.f the RA' is an .nteractive or 'ac9ground service, the maAimum bit rate is eJual or above the
maAimum bit rate threshold for '* to be mapped to 5%/)A.
To support this ne1 selection procedure the follo1ing configurable options have been added to the
0MTL
%1itch to enable )%"%treaming on 5%/)A
)%"%treaming to 5%/)A ?MaAimum 'it Rate@ Threshold
0ess than this rate and the RA' is mapped to /&5
)%"'est *ffort to 5%/)A ?MaAimum 'it Rate@ Threshold
0ess than this rate and the RA' reJuest is mapped to /&5
U0 and /0 RA' reJuests made for )% best effort bearers 1ill not be allocated a /&5 bearer, if the
reJuested maAimum rates are belo1 the MM0"configured 'est *ffort %ervice specific /&5"to"
-A&5KRA&5 transition point, e.g.L
ADD #E--/R# Ul)sTraff/ecThs T 3!, /l)sTraff/ecThs T 3!
3)3 &D#& -ayer &arameters
The RN& enables a single set of > )/&) parameters to be configured and stored, that are reused b3 all
/&5 and 5%/)A bearers to define their service )/&) la3er characteristics. Table 3 "! belo1
summarises these > %*T -R& parameters along 1ith the automated additional ?support for loss"less
%NR%@ option that the RN& can d3namicall3 configure if it detects the appropriate U* capabilit3.
Motorola &onfidential )roprietar3 !$
&D#& Option #on$igurabiity Description
R$c+4:5De$&araS
=itc"
0MT %et -R&
B%ubOect to U* &apabilit3C
The maAimum number of compressed non"T&)
headers that ma3 be sent 1ithout sending a full
header. The 1ord UcompressedU means some
unnecessar3 header information is not transmitted
1ith the pac9et data so as to save net1or9
resource.
'a>!eader
The maAimum control header size in b3tes that
ma3 be compressed.
TcpSpace
The maAimum &onnection ./ B&./C used for
T&) connections.
NonTcpSpace
The maAimum &onnection ./ B&./C used for
non"T&) connections.
/'a>&eriod
0MT %et -R&
The maAimum number of compressed non"T&)
headers that ma3 be sent 1ithout sending a full
header. The 1ord UcompressedU means some
unnecessar3 header information is not transmitted
1ith the pac9et data so as to save net1or9
resource.
/'a>Time
The maAimum duration for sending compressed
headers after the last full header is sent.
E>pectOrdering
The )/&) header compression algorithm shall
reorder )/&) %/Us or not.
-oss1ess SRNS
Support
%ubOect to U* &apabilit3
BN, %*T -R& optionC
"
Table 3"!L )/&) 0a3er )arameters
3)2 R-# -ayer &arameters
The R0& la3er as defined in the 3G)) specification T%!$.3!!, offers the follo1ing services to the
higher la3ersL
0a3er ! connection establishmentKrelease
Transparent data transfer, i.e., no protocol overhead is appended to the information unit received
from the higher la3er
Unac9no1ledged data transfer transmits higher la3er )/Us 1ithout guaranteeing deliver3 to peer
entit3.
Ac9no1ledged data transfer mode has these characteristicsL
o *rror"free deliver3L *nsured b3 means of retransmissionP receiving entit3 delivers onl3
error"free %/Us to higher la3er
Motorola &onfidential )roprietar3 !<
o UniJue deliver3L R0& sub"la3er delivers each %/U onl3 once to receiving upper la3er using
duplication detection
o .n"seJuence deliver3L R0& subla3er provides support for in"order deliver3 of %/Us. R0&
subla3er delivers %/Us to receiving higher la3er entit3 in same order as transmitting higher
la3er entit3 submits to R0& subla3er.
o ,ut"of"seJuence deliver3L As an alternative to in"seJuence deliver3, the receiving R0&
entit3 delivers %/Us to higher la3er in a different order than the3 1ere submitted to the
R0& subla3er at the transmitting side.
-or a ?RA'.ndeAed@ set of RN& stored Radio 'earer attributes up to ! sub"sets of R0& parameters
governing the R0& mode t3pe and specific characteristics can be configured using the 0MT ?t3prabrlc@
command for either of both of the /&5 and 5%"/%&5 mode of the. To differentiate the /&5 and 5%"
/%&5 subsets of R0& parameters defined b3 the same RA'indeAed t3prabrlc command there is R'
t3pe sub"option, ?t3prabrlc TR&5T()*TTR&5G5%/%&5 or TR&5G/&5@.
7hen the 5%"/%&5 RA' is a do1nlin9 service and R0& is configured to AM mode, a /&5
associated to the 5%"/%&5 MA&"d flo1 in uplin9 needs to be configured for transferring R0& uplin9
control information. .f the R0& mode is UM, there is no need to configure the associated /&5, but a
/&5 should be configured in uplin9 for transferring %R' or other traffic.
7hen the default R0& 1indo1 size parameters cannot be supported due to U* capabilit3 limitations,
the RN& 1ill attempt to decrease the 1indo1 size until a suitable 1indo1 size is found.
3)4 D#! 'A# -ayer
The RA'"to"R' mapping algorithm provides the follo1ing functions to support the mapping of /T&5
logical channels to /&5 transport channelsL
MultipleAing and de"multipleAing of upper la3er )/Us intoKfrom transport bloc9 sets delivered
toKfrom the ph3sical la3er on dedicated transport channels.
o The RN& supports the follo1ing RA' multipleAing options, !&%V%R', !)%V%R',
!&%V4)%V%R' and 4&%V!)%V%R'.
&reation of appropriate Transport -ormat %et and Transport -ormat for each Transport &hannel
depending on instantaneous source rate.
o The total number of T-&s that could in theor3 be generated from the multipleAing ! of
more RA's can Juic9l3 become so large so as toL
Ma9e signalling of the T-&% to the U* inefficient B1astes both .ub and Uu
resourcesC.
*Aceed either the U* Bthese var3 bet1een manufacturerKclass and are signalled to
Motorola &onfidential )roprietar3 !>
the RN& via the RR& &onnection %etup &omplete messageC or RN& maAimum
T-&%KT-& capabilit3 limit B!$< T-&s for the U%R3 RN&C.
o The U%R3 RN& /&5 MA& includes ! algorithms to help reduce the size of T-&% defined
for multipleAed dela3 insensitive )%"/omain 'est *ffort /&5 servicesL
?T- Trimming@ Algorithm B%ection 3.$.4C
?.ncomplete T-&% &onfiguration@ Algorithm B%ection 3.$.!C
o 7hen selecting the T-&s, RN& shall consider the follo1ing criteriaL
Guarantee that signalling and &% RT service can ma9e use of the most reasonable
bit rate. T- trimming is restricted to dela3 insensitive )% domain best effort services,
in future versions the T- Trimming Algorithm ma3 be eAtended to PS RT services
(first streaming then conversational).
Guarantee that non"'* )% service can ma9e use of the most reasonable bit rate
7hen t1o '* service are multipleAed, ma9e sure that the RN& shall transmit more
data from the higher priorit3 logical channels than that from lo1er priorit3 logical
channels , and at the same time the RN& shall allo1 some data from the lo1est
priorit3 logical channels.
The t1o '* services ma3 not be able to transmit data 1ith the highest bit rate
simultaneousl3.
-or interactive signalling RA', 1hich is used in .M% service, RN& shall set the
highest priorit3 among the interactive RA' for it.
There is no option of logical channel multipleAing Ban alternative to T- trimmingC.
)riorit3 handling bet1een data flo1s of one U*
o The Taurus :4.$ MA& multipleAing algorithm schedules transport channel resources based
on traffic priorities of different U*s and data flo1s , and the RANA) RA' )arameter
UTraffic 5andling )riorit3U is used to map the priorities, i.e. it decides 1hich )/Us from
high la3er BR0&C 1ill be transmitted on the selected &&Tr&5 and 1hen and 1hat T-& 1ill
be used ta9ing the RA' )arameter UTraffic 5andling )riorit3U into consideration. 7ith the
UTraffic 5andling )riorit3U parameter being considered, differentiation bet1een interactive
radio bearers is possible 1hen allocating radio resources 1ithin a single U* or among
different U*s so that subscribers can be provided 1ith differentiated 6o% treatment. The
parameter UTraffic 5andling )riorit3U together 1ith the traffic class can be mapped to the
follo1ing prioritiesL
o -rame handling priorit3, .* of N'A) or RN%A) message, shall be used 1hen prioritising
bet1een different frames in the do1nlin9 on the radio interface in congestion situations .
o MA& logical channel priorit3 B%ection 3.$.=C shall be used 1hen scheduling the data
transfer for a single U* 1ith multiple logical channels.
Motorola &onfidential )roprietar3 !;
o -A&5 MA&"c &ommon &hannel )riorit3 .ndicator B&m&5").C B%ection 3.$.=C shall be
used b3 the -A&5 scheduling function, 1hich schedules the data to be transmitted on
-A&5 considering logical channel priorities of different U*s.
o %cheduling )riorit3 .ndicator, .* of N'A) or RN%A) message, indicates the relative
priorit3 of the -A&5, /%&5, U%&5 or 5%"/%&5 data frame. Used b3 the /RN& or
Node ' 1hen scheduling -A&5, /%&5, U%&5 or 5%"/%&5 traffic.
3)4)% D#! 'A# @T/ TrimmingA Agorit"m
U* capabilit3 1ill be reported in the RR& &onnection %etup &omplete message, in 1hich the T-KT-&
number limitation is specified, if the T- number of a specified '* or non"'* service eAceeds the
limitation described in U* capabilit3, some T-s must be trimmed and the follo1ing T-s must be 9eptL
4. T- of the maA bit rate
!. T- of the zero bit rate
3. T- of the minimum non"zero bit rate
Note %. The above rules are suitable for both AM"R0& and UM"R0&, the onl3 difference is that for
UM the ?minimum non"zero bit rate@ T- could be further trimmed in case the T- number is still eAceed
the limitation.
Note +. The RN& shall support all the T- combinations for non"'* service, therefore there is no
trimming for the non"'* service and T- trimming is used onl3 for '* service.
.f there are n T-s in total to be trimmed for t1o combined '* services, the rules used to figure out these
T-s areL
4. Assume there are
x
T-s for service A and
y
T-s for service ',
y x >
and
y x m
P
!. .f
n m >
, trim n T-s for service A directl3 and the process ends, other1ise go to step 3.
3. &ompare the priorities of the t1o servicesL
o if both services have eJual priorities, the RN& shall trim ]
! K C B m n m +
T-s for service
A and ]
C ! K C B B m n m n +
T-s for service '
o else if service A has a higher priorit3 than service ', the same rule as above applies
o else the RN& shall trim 1
! K C B m n m +
T-s for service A and 1
C ! K C B B m n m n +
T-s for service '
,nce the trimmed T- number of the transport channel has been calculated, the RN& shall trim the T-s
Motorola &onfidential )roprietar3 !+
for a single transport channel as follo1sL
Assume T- number of the current service is TotalGT-GNum, and
m
T-s should be trimmed
)ositionGT-. T !P
%tepsize T BTotalGT-GNum N3C K BBTotalGT-GNum"mC"3C 1P
1hileB)ositionGT-. W TotalGT-GNum "4C
R
T-. T )ositionGT-.
Mar9 the T- corresponding to T-. as ?reserved@
)ositionGT-. T )ositionGT-. V %tepsize
S
After getting the trimmed T-s, RN& 1ill use the ?incomplete T-&% configuration algorithm@ to get the
number of the valid T-&s, if the T-& number still eAceeds the limitation described in U* capabilit3, the
T-&s need to be further trimmed, in this algorithm, instead of trimming the T-&s directl3 Bas the
incomplete T-&% configuration algorithmC, the RN& 1ill trim T-s to achieve this goal.
7hen trimming the T-s again, instead of using the alread3 trimmed T-s, RN& 1ill use the original T-s
and increase b3 4 the number of T-s that need to be trimmed, e.g. m T-s have been trimmed at the first
time and the verification sho1s that T-s need to be further trimmed, then there are mV4 T-s should be
trimmed the second time, RN& 1ill use the T- trimming algorithm iterativel3 until U*2s capabilit3 is
met.
3)4)+ D#! 'A# @Incompete T/#S #on$igurationA Agorit"m
7hen the summed bit rate of ! multipleAed '* services eAceeds the follo1ing RN& configurable
thresholds,
%*T -R& /0'*&,M'T-&N,N&M)&-GT5% Bdo1nlin9 specificC
%*T -R& U0'*&,M'T-&N,N&M)&-GT5% Buplin9 specificC
the RN& MA& ?.ncomplete T-&% &onfiguration Algorithm@ is invo9ed 1hich uses the T-& creation
criteria described belo1 to reduce the T-&% set size.
-or a U* 1hich has t1o Tr&5s, the T-% of one Tr&5 contains the follo1ing T-sL
RT-trch44, T-trch4!, M,T-trch4NS
1here T-trch44 is the T- 1ith the zero T' size, T-trch4! is the non"zero T- 1hich corresponds to the
lo1est bit rate, T-trch4N is the non"zero T- 1hich corresponds to the highest bit rate. %imilarl3 the
T-% of another Tr&5 contains the follo1ing T-sL
RT-trch!4, T-trch!!, M, T-trch!MS
1here T-trch!4, T-trch!!, M T-trch!M have the similar definition of T-trch44, T-trch4!, M,
T-trch4N.
.f the R0& mode is AM, the MA8 combined bit rate of the t1o '* service is L
Rate&ombMaA T maAR Rate4N V Rate!!, Rate!MV Rate4!S
NoteL -or UM mode, as mentioned above, the zero rate T- ma3 be used.
Assumes transport channel A is using the T- ?T-trch4A@ and transport channel ' is using the T-
?T-trch!3@, for all the possible T-&s, the follo1ing formula should be used to filter out the valid T-&sL
x RateCombMa y Rate x Rate + ! 4
1ith
N x 4
and
M y 4
.
3)4)3 D#! 'A# A'R T/#S #onstruction
7hen setting up an AMR call, the &N 1ill send to the UTRAN RN& via the RANA) RA' reJuest
protocol, a list of AMR rates 1hich it can or 1ould li9e to support. The size of this list of rates can
range from 4 to ; eAcluding the %./ and rates. %ee section > for further information.
3)4)2 D#! 'A# 'utipe>ing 7T/# Seection8 Agorit"m
The algorithm used to handle MA& logical channel priorit3 is described as follo1sL
4. R0& la3er use the primitive MA&"/ATA to transfer traffic data to MA& la3er, in 1hich the
parameter ', B'uffer ,ccupanc3C is included
!. 'ased on the trimmed T-&%, the set of valid T-&s shall be established. All T-&s in the set of
valid T-&s shallL
belong to the T-&%.
not reJuire R0& to produce padding )/Us .
not carr3 more bits than can be transmitted in a TT.. Be.g. 1hen compressed mode b3
higher la3er scheduling is used and the presence of compressed frames reduces the number
of bits that can be transmitted in a TT. using the Minimum %- configuredC.
3. According to the follo1ing rules, MA& selects the current T-& 1ithin the valid T-&s set
No other T-& shall allo1 the transmission of more highest priorit3 data than the chosen
T-&
No other T-& shall allo1 the transmission of more data from the neAt lo1er priorit3 logical
channels. Appl3 this criterion recursivel3 for the remaining priorit3 levels.
No other T-& shall have a lo1er bit rate than the chosen T-&.
The Round Robin method 1ill be used if t1o Tr&5s have the same priorit3.
3)4)4 #ommon #"anne 'A# 'utipe>ing Agorit"m
The algorithm used to handle &m&5"). is described as follo1sL
&T&5K'&&5K&&&5K/&&5K/T&5 are logical channels that could be carried on -A&5. MA&"c
&ommon &hannel )riorit3 .ndicator is used b3 the RN& to prioritize different traffic transmitted on
/&&5K/T&5 carried b3 -A&5. %ince the RN& prioritizes the logical channels 1ith the follo1ing
descending orderL
&T&5 Q '&&5Q &&&5 Q /&&5 Q /T&5,
the overall priorities on -A&5 should beL
&T&5 Q '&&5 Q &&&5 Q %R' B/&&5C Q &% &onversational X
&% %treaming X )% &onversational X )% %treaming X
.nteractive T5)4 X .nteractive T5)! X .nteractive T5)3 X 'ac9ground.
The basic rules used to transfer data on -A&5K%&&)&5 areL
4. -A&5 can have multiple MA&"c common channel priorit3 indicators assignedP
!. /ifferent -A&5s on each %&&)&5 cannot have the same MA&"c common channel priorit3
indicatorP
3. *ach %&&)&5 can have a maAimum of 4< MA&"c common channel priorit3 indicators.
7hen scheduling the pac9ets 1ithin a -A&5 channel,
=. RN& shall serve all pac9ets of the highest priorit3 and onl3 then consider pac9ets of lo1er
priorit3.
$. RN& shall appl3 B=C recursivel3 for the remaining priorities.
Note that for the lo1er priorit3 bearer, its priorit3 should be increased b3 4 if it has not been served for
$ TT.sP after it is served, its priorit3 should be reverted bac9 to its original priorit3.
7hen scheduling the pac9ets 1ithin a %&&)&5 channel, the RN& shall use the follo1ing rules to select
the T-&
<. No other T-& shall allo1 the transmission of more highest priorit3 data than the chosen T-&.
>. No other T-& shall allo1 the transmission of more data from the neAt lo1er priorit3 data.
Appl3 this criterion recursivel3 for the remaining priorit3 levels.
;. No other T-& shall have a lo1er bit rate than the chosen T-&.
Note that the )&5 channel has higher priorit3 than the -A&5 channel 1ithin a %&&)&5 channel.
3)6 !SD&A 'A# -ayer
Unli9e the /&5 MA& the 5%/)A MA& functions are split across the MA&"hs and MA&"d, reflecting
the relocation of the maOorit3 of MA& sub"functions to the Node '.
The MA&"d considers a 5%"/%&5 flo1 as a transport channel of dedicated channels. Therefore each
RA' mapped to 5%/)A has its o1n uniJue 5%"/%&5 MA&"d flo1, 1hich in principle could be
mapped together 1ith other MA&"d flo1s to one or more MA&"hs priorit3 Jueues.
-or U%R3, the Node ' is limited to supporting one MA&"hs Jueue per MA&"d flo1
-or RN& soft1are loads 4.$...., 4.$...4., D 4.$...!., the 5%/)A R0& MA&"d
)/U size is hard"coded. -or RN& soft1are loads 4.$...3. and be3ond, there 1ill be the
option to configure the 5%/)A R0& MA&"d )/U size via a ne1 0MT ?A//KM,/KRM:
T()RA'MA&5%@ command.
At the Node ', the MA&"5% supports the follo1ing 9e3 functionsL
'A# &DU $o= contro
The 3G)) Release $ standards provide for a mechanism to flo1 control 5%"/%&5 User plane -rame
)rotocol B-)C transport over the .ub and .ur on a per MA&"hs priorit3 Jueue basis.
,nl3 the .ub is considered here BRN& to Node 'C since 5%"/%&5 frame transport over .ur is
not supported in U%R3.
The mechanism is defined in !$.=3$. .t can be instigated b3 the RN& via a capacit3 reJuest, 1hich is
responded to 1ith a capacit3 allocation b3 the Node ', or the Node ' can autonomousl3 send an
allocation message to the RN&. -or more information, see !$.=3$.
The Node ' 1ill provide an initial capacit3 allocation for the transfer of 5%"/%&5 -) frames in an
N'A) RA/., 0.NE %*TU) R*%),N%* or RA/., 0.NE R*&,N-.GURAT.,N R*A/(
message. The allocation 1ill provide the 5%"/%&5 .nitial 7indo1 %ize 1hich defines the number of
MA&"d )/Us that the RN& can send B5%"/%&5 .nitial 1indo1 %ize T !$$C before receiving
additional credits via the user plane capacit3 allocation mechanism as detailed belo1.
.n U%R3 the Node ' supports the autonomous capacit3 allocation mechanism but does not support the
capacit3 reJuest procedure. -urthermore, the Node ' 1ill, in normal circumstances, provide unlimited
credit to the RN& for -) frame transfer, unless the Node ' detects an internal buffer issue 1hich
reJuires some action
Sc"eduing and &riority "anding
The main functions of the MA&"hs scheduler includeL
/eciding 1hich 5%/)A serviced U*"specific priorit3 Jueue accesses the 5%"/%&5 during
each !ms sub"frame Band in so doing also deciding on re"transmission or 4st transmission
of a MA&"hs )/UC
%etting the transmission seJuence number BT%NC for ne1 MA&"hs )/Us
This function must ta9e particular care to ensure that services that have specific bit rate needs Bi.e.
streaming )% services 1hich are associated 1ith a Guaranteed 'it Rate BG'RC parameterC meet their
reJuired rate.
!AR, #ontro
The central purpose of emplo3ing 5AR6 Bh3brid AR6C in addition to AR6 provided b3 the R0& la3er
is to provide a lo1 error rate Bi.e. zero errors not guaranteedC mechanism for transmission of bloc9s of
data to a U* 1ith a lo1er overall Yaverage"energ3"reJuired2 to transport a bloc9 of data than 1ould be
attained 1ithout the use of 5AR6. .t achieves this via combining in the U* multiple BX4C received
information bloc9s containing information for one MA&"hs )/U.
T/R#
The Node ' determines the transmission po1ers of the 5%"%&&5 and 5%")/%&5 along 1ith the
sizeKformat BT-R&C for the transmission of a 5%")/%&5 channel )/U.
The performance of the 5%/)A MA&"d and MA&"hs is dictated from parameters defined at different
net1or9 elements, including the &N, RN& and Node '.
4. At the Node ', a number of MA&"5% performance defining parameters are available that can
potentiall3 be reconfigured. 5o1ever, reconfiguration of these parameters to improve 5%/)A
performance should onl3 be considered if re"tuning or reconfiguration of all other 5%/)A
performance affecting parameters Be.g. R0& settingsC has alread3 been attempted.
!. -rom the original &N generated RANA) RA' ReJuest .nformation *lements the follo1ing
parameters are passed directl3 through the RN& unmodified to configure the Node"' MA&"hs.
These parameters includeL
Allocation Retention )riorit3 .nformation *lements Bsee 3G)) T%!$.=43CL
o &riority -e;e
The priorit3 level and the pre"emption indicators ma3 be used to determine 1hether the reJuest has to be
performed unconditionall3 and immediatel3
o &re1emption #apabiity
This .* indicates the pre"emption capabilit3 of the reJuest on other RA's
o &re1emption Vunerabiity
This .* indicates the vulnerabilit3 of the RA' to preemption of other RA's.
o Note: The ARP !"e"ing Allo#e$% element is ignore$ in this version.
3. -rom the RN& the follo1ing parameters are generated to configure the Node ' MA&"hs. These
parameters are obtained from parameters configured either directl3 b3 the operator andKor from
specific post"processing RA' ReJuest .nformation *lements. These parameters includeL
)arameters configured at the RN& via 0MT commands includeL
o T% timers $or t"e UE and t"e Node 0 BM,/ T()RA' MA&5%T4C
Node ' ma3 use this value to stop the re"transmission of the corresponding MA&"hs )/U. Node ' ma3
use this parameter to stop re"transmission of the corresponding MA&"hs )/U BAC. 7hen a MA&"hs
)/U BAC received the Ac9, after the time period T4, another MA&"hs )/U B'C transmitted before this
MA&"hs )/U BAC does not receive corresponding Ac9, then the re"transmission of MA&"hs )/U B'C is
stopped.
This timer should be set high given the design of the Node ' scheduler, 1hich incorporates a proprietar3
T3 timer.
o 'A#1"s 3indo= Size BM,/ T()RA' MA&5%7.N%.F*C
This configures the Node ' D U* MA&"5% 1indo1. .n the Node ', onl3 MA&"5% )/Us 1ithin this
1indo1 can be re"transmitted. At the U*, onl3 MA&"5% )/Us 1ithin this 1indo1 can be re"ordered.
o Discard Timer BM,/ T()RA' MA&5/.%&AR/T.M*,)T DD /.%&AR/T.M*C
The timer is used to define the time that a MA&"d )/U is allo1ed to 1ait in a priorit3 Jueue for
transmission before it is discarded.
o 'A#1"s Re1ordering 0u$$er Size 7deri;ation un<no=n8
This is onl3 reJuired for UM mode services.
/etails of derivation not confirmed. The remaining part of the buffer after deduction if of R0& buffer
from the Total R0& buffer ma3 be used for MA&"5% re"ordering buffer.
o 'A#1"s Reset Indicator 7trueB$ase C "ard1coded8
This is hard"coded to TRU*
.n the current version, the default configuration is to reset MA&"hs, 1hich means that the MA&"5% is
reset even 1hen a handover occurs bet1een ! cells belonging to the same Node '.
o 'A#1"s Guaranteed 0it Rate 7e>act deri;ation un<no=n8
This parameter is onl3 relevant to the streaming traffic class of service.
RN& eJuation deriving from the original RA' reJuest ?Guaranteed 'it Rate@ a value of the MA&"5%
Guaranteed 'it Rate that accounts for theL
overhead bits in each MA&"d )/U Be.g. header bitsC
average number of padding bits per MA&"d )/U
average rate of R0& retransmissions
Accounting for these factors 1ill result in a MA&"5% G'R value given to the node ' that 1ill be
higher than the service throughput.
o Sc"eduing &riority Indictor B%ection 3.<.4C
This parameter indicates to the MA&"5% the scheduling priorit3 of 5%"/%&5 data frame for
transmission across the air interface. .t is configured using a combination if the RA' traffic class and
RANA) RA' reJuest ?Traffic 5andling )riorit3@ information element.
3)6)% !SD&A 'A# -ayer Sc"eduing &riority Indicator
These parameters determine the priorities that the MA&"hs 5%"/%&5 scheduler 1ill give to different
)% domain services, b3 setting the %cheduling )riorit3 .ndicator B%).C values transmitted over the .ub.
There are three broad classes of servicesL %treaming, .nteractive and 'ac9ground. The .nteractive class
is subdivided into 4$ subclasses according to Traffic 5andling )riorit3 BT5)C, 4"4$, 1here 4 is the
highest priorit3 and 4$ is the lo1est. The scheduling priorit3 parameters are PSSTRSCHEPRIO Bfor
%treaming trafficC, PSINTTHP1SCHEPRIO"PSINTTHP15SCHEPRIO Bfor .nteractive traffic 1ith
T5)s 4"4$C and PSBKGSCHEPRIO Bfor 'ac9ground trafficC. The %). ma3 ta9e one of 4< values, "
4$, 1here is the lo1est priorit3 and 4$ is the highest BN'L the opposite to T5)C. All other things Be.g.
&6.C being eJual, high priorit3 traffic is scheduled before, or at a higher rate than, lo1er priorit3 traffic.
The Motorola MA&"hs 5%"/%&5 scheduler does not use the %). of %treaming traffic B%treaming
priorit3 is determined b3 the Guaranteed 'it Rate BG'RCC, but it does for .nteractive and 'ac9ground
traffic. All other things being eJual, traffic 1ith an %). of 4$ 1ill be allocated four times the rate of
traffic 1ith an %). of . /ata rates for intermediate %).s are scaled proportionatel3 Be.g. %). ; 1ill get
t1ice the rate of %). , but onl3 half that of %). 4$C.
The Motorola MA&"hs 5%"/%&5 scheduler does not use the %). of %treaming traffic B%treaming
priorit3 is determined b3 the Guaranteed 'it Rate BG'RCC so the value allocated to PSSTRSCHEPRIO
is inconseJuential although a high value, e.g. 4$, 1ould serve as a reminder that %treaming traffic is
treated 1ith the highest priorit3.
'ac9ground traffic is the lo1est priorit3 so should be given a lo1 value, e.g. .
.nteractive traffic has intermediate priorit3, less urgent than %treaming, but more so than 'ac9ground. .t
is tempting to allocate the .nteractive %).s on a linear scale follo1ing the 0MT defaultsL T5) 4 Bthe
most urgentC has %). 4=, T5) ! has %). 43 M T5) 4$ has %). . 5o1ever, the 1a3 in 1hich T5)s are
allocated should be ta9en into account before doing this, especiall3 if this is done so as to be bac91ards
compatible 1ith G)R% /ela3 &lasses. /ela3 &lasses are the G)R% eJuivalent of T5), but there are
onl3 four of them, 4"3 being used for var3ing priorities of .nteractive traffic and = being the used for
lo1 priorit3 'ac9ground traffic. .f onl3 three T5)s are used, corresponding to the first three G)R%
/ela3 &lasses, the T5)"%). mapping scheme gives poor granularit3 as %).s 4=, 43 and 4! 1ill be
treated nearl3 eJuall3. Under such circumstances a better scheme 1ould be to allocate T5) 4 an %). of
4$, T5) ! an %). of 4 and T5) 3 an %). of $, 1ith 'ac9ground traffic having an %). of . This 1ill
give a more meaningful hierarch3 of priorities.
3)5 D#! &!. -ayer
3)5)% D- Sot /ormat Seection
-or a given radio bearer configuration the RN& d3namicall3 derives the slot format Bsee Table 3 "3C
that meets the follo1ing ! conditionsL
aC Most efficientl3 accommodates the maAimum number of radio bearer bits after multipleAing,
coding and rate matching as accounted for using the eJuation described further on.
bC 'elongs to the sub"set of slots 1ith the follo1ing characteristics matching those defined b3 the
RN&K0MTL
a. Ntfci N dependent on selection of '0.N/ RAT* /*T*&T.,N
%*T &,RRMA0G,%7.T&5L &5%7.T&5T/,7N0.NEG'0.N/G/*T*&T.,NG%7.T&5"P
b. Npilot N dependent on number of preferred pilot bits
i. %*T -R&L /0/)&5%-!$<).0,T'.T T /!K=K;
ii. %*T -R&L /0/)&5%-4!;).0,T'.T T /=K;
,f the complete range of non"compressed mode slot formats listed in table belo1, onl3 slot formats !
and 3 are unavailable for the U%R3.A RN&.
%lot
-ormat
Zi
&hanne
l 'it
Rate
B9bitKsC
&hannel
%3mbol
Rate
B9spsC
%-
'itsK
%lot
/)/&5
'itsK%lot
/)&&5
'itsK%lot
No. of
/)/&5
'its per
4ms Radio
-rame
N/at
a4
N/at
a!
NT)&
NT-
&.
N)il
ot
4$ >.$ $4! 4 = ! = <
4 4$ >.$ $4! 4 ! ! ! = 3
! 3 4$ !$< ! ! 4= ! ! !=
3 3 4$ !$< ! ! 4! ! ! ! !4
= 3 4$ !$< ! ! 4! ! = !4
$ 3 4$ !$< ! ! 4 ! ! = 4;
< 3 4$ !$< ! ! ; ! ; 4$
> 3 4$ !$< ! ! < ! ! ; 4!
; < 3 4!; = < !; ! = $4
+ < 3 4!; = < !< ! ! = =;
4 < 3 4!; = < != ! ; =$
44 < 3 4!; = < !! ! ! ; =!
4! 4! < <= ; 4! =; = ;[ ; +
43 != 4! 3! 4< !; 44! = ;[ ; !4
4= =; != 4< 3! $< !3! ; ;[ 4< =3!
4$ +< =; ; <= 4! =;; ; ;[ 4< +4!
4< 4+! +< = 4!; !=; 4 ; ;[ 4< 4;>!
Table 3"3L 0ist of /0 %lot -ormat &oded 'it &apacities
*Juation 3.> "4 BeAtendable to multiple Tr&5C is applied b3 the RN& to calculate the maAimum
number of radio bearer bits, N
rate&match&ma'
Bafter multipleAing, coding D rate matchingC that need to be
accommodated b3 the selected slot formatL
N
rate_match_ma,
Total No. of Radio 'earer bits after multipleAing, coding D rate"matching
Num_TrCH
Number of dedicated /0 Transport &hannels Bincluding %R'C
N
m,n
Number of 'its in Tr&5 ?n@ for Transport -ormat ?m@ before rate"matching.
%ince the RN& onl3 supports fiAed transport channel multipleAing Bat la3er 4C onl3 the 1orst case
transport format combination ?m
1orst
@ needs to be considered.
RMA
n
Rate Matching Attribute for ?n
th
@ Tr&5.
This is the onl3 parameter available that could possibl3 be deliberatel3 used to var3 the eAtent of rate
matchingKpuncturing that a particular Tr&5 eAperiences.
-or the U%R3.A RN& the U0 D /0 RMA for the same bearer are separatel3 defined using the follo1ing
MM0 commandsL
M,/ T()RA'%*M.%TAT.&T-L U0RAT*MAT&5.NGATTRT44, /0RAT*MAT&5.NGATTRT4<P
PL
Uplin9 or do1nlin9 puncturing limit.
-or U%R3.A RN& the /0 D U0 )uncture 0imits are configurable via MM0 using the follo1ing
commandL
%*T -R&L U0/)/&5)0T!$, /0/)&5)0T!$P
P(
RMA
RMA N
N
n
TrC) N"m
n
n n m
match rate

S minR
G
4
,
maA G G
*Juation 3.>"4L MaA. No. of bits after muAing, coding D rate matching
3)5)+ D- &o=er O$$set De$inition
The 3 /0 /)&&5 field po1er offsets B)o4, )o! D po3C can be modified using the follo1ing 0MT %*T
-R& commandsL
/0 T-&. )o1er ,ffset B)o4C T SET /R#D T/#I&O
/0 T)& )o1er ,ffset B)o!C T SET /R#D T&#&O
/0 ).0,T )o1er ,ffset B)o3C T SET /R#D &I-OT&O
These RN& defined po1er offsets are global and therefore appl3 to all /&5 RA's supported b3 an
RN& regardess of the specific RA' t3pe or rate.
The T)& offset, ),!, is automaticall3 increased b3 hard"coded Bnon"MM0"configurableC offsets Bsee
Table 3 "=C depending on the number of active %5, legs Bradio lin9sC. 7hen the second R0 is added,
),! value is added b3 3d'P 1hen the third R0 is added, ),! value is added b3 4.>$d' again. .n
addition, there is a maA limit of ),! \ <d'.
T&# &o=er O$$set
7d08
Number o$ Radio -in<s
% R- + R- 3 R-
,ffset Added Relative
to /efault :alue
MM0
&onfigurable
/efault :alue
4 R0 default
V 3 d'
4 R0 default
V =.>$ d'
&urrent /efault :alues 3 < <
Table 3"=L /0 T)& )o1er ,ffsets in %5,
3)5)3 U- Sot /ormat Seection
The U0 /)&&5 format is defined indirectl3 b3 the MM0 ?%*T -R&L T-&.'.TT!, -'.'.TT!P@
commands. *ssentiall3 there is a 4"to"4 mapping bet1een the possible settings of these /)&&5 field
parameters and the actual U0 /)&&5 slot format. Thus b3 appropriate configuration of these
parameters it should be possible to select an3 of the standard non"compressed mode specific slot
formats Bsee Table 3 "$C, given the follo1ing conditionsL
/epending on the setting of the U0 /)&&5 T-&. 'its controlled b3 the %*T -R&
Ul/pcchTfci'it command.
/epending on if closed loop transmit diversit3 is selected, i.e. the ?%*T -R& -'.bit@ is al1a3s
?@, the U0 /)&&5 formats actuall3 supported is ver3 restricted.
%ince the ?%*T -R& parameter@ applies to A00 RA'% supported b3 a RN& in all cells, then A00
RA's regardless of the service t3pe and rate the3 support, 1ill share the same U0 /)&&5 format.
Sot
/ormat
Ei
#"anne
0it Rate
7<bitBs8
#"anne
Symbo
Rate
7<sps8
S/ 0itsB
/rame
0itsB
Sot
Npi
ot
NT&
#
NT/
#I
N/
0I
Transmitted
sots per
radio $rame
4$ 4$ !$< 4$ 4 < ! ! 4$
A 4$ 4$ !$< 4$ 4 $ ! 3 4"4=
' 4$ 4$ !$< 4$ 4 = ! = ;"+
4 4$ 4$ !$< 4$ 4 ; ! ;"4$
! 4$ 4$ !$< 4$ 4 $ ! ! 4 4$
!A 4$ 4$ !$< 4$ 4 = ! 3 4 4"4=
!' 4$ 4$ !$< 4$ 4 3 ! = 4 ;"+
3 4$ 4$ !$< 4$ 4 > ! 4 ;"4$
= 4$ 4$ !$< 4$ 4 < ! ! ;"4$
$ 4$ 4$ !$< 4$ 4 $ 4 ! ! 4$
$A 4$ 4$ !$< 4$ 4 = 4 3 ! 4"4=
$' 4$ 4$ !$< 4$ 4 3 4 = ! ;"+
Table 3"$L U0 /)&&5 %lot -ormats BA D ' options are for compressed modeC
Note that for the U0, there are multi"code options available.
3)5)2 U- D&D#! Spreading /actor
.n general the actual U0 %- and )0 are determined b3 U* itself using 9no1ledge of the slot format bit
capacities, ho1ever the U%R3.A RN& can and does specif3 to the U* the follo1ing ! limiting
parameters for the maAimum rate T-&L
Minimum U0 %-
o This is calculated automaticall3 1ithin the RN&.
The U* choice of U0 %- is generall3 obvious Bone can re"appl3 *Juation 3.> "4C, ho1ever there
are certain circumstances Be.g. AMRC 1here it is not obvious. Note that the spreading factor of the
U0 /)/&5 that 1ould be chosen b3 a U* being served b3 the Motorola RN& 1ith a 4!.! AMR
and %R' call is 4!;.
o MaAimum 0evel of U0 )uncturing
o This parameter is MM0 configurable via the ?SET /R#D U-D&D#!&-F+4G@
commandL
Sot /ormat Ei #"anne 0it
Rate 7<bitBs8
#"anne Symbo
Rate 7<sps8
S/ 0itsB
/rame
0itsB
Sot
Ndata
4$ 4$ !$< 4$ 4 4
4 3 3 4!; 3 ! !
! < < <= < = =
Motorola &onfidential )roprietar3 =
3 4! 4! 3! 4! ; ;
= != != 4< != 4< 4<
$ =; =; ; =; 3! 3!
< +< +< = +< <= <=
Table 3"<L U0 /)/&5 %preading -actor ,ptions
3)5)4 U- &o=er Ratio
The gain factors *
c
and *
d
of the uplin9 /)&&5 and /)/&5BsC ma3 var3 for each T-&. 3G))
describes t1o methods of controlling the gain factors of the /)&&5 and /)/&5 codes for different
T-&s in normal Bnon"compressedC framesL
*
c
and *
$
are signalled for the T-&, or
*
c
and *
$
is computed for the T-&, based on the signalled settings for a reference T-&.
3G)) allo1s combinations of these t1o above methods to be used to associate *
c
and *
$
values to all
T-&s in the T-&%. These t1o methods are described in subsections $.4.!.$.! and $.4.!.$.3 respectivel3
of T%!$.!4=. %everal reference T-&s ma3 be signalled from higher la3ers. The RN& effectivel3 applies
a h3brid of these techniJues, 1hich reJuires the RN& to compute and signal all T-& offsets as and
1hen reJuired. The RN& computes Brather than loo9s"up or rel3 on a U* computationC a ne1 po1er
offset for each reJuired T-& d3namicall3 using on a single set of RN& configurable reference values for
*
c
and *
$
BA// T()RA''A%.&C stored for each of the pre"defined RA's. This computed T-&
specific offset is then signalled to the U*.
The eJuation used b3 the RN& to compute ne1 po1er offsets specific to a T-& is given belo1L

]
c,ref
" A// T()RA''A%.& value bet1een R4,...,4$S
]
d,ref
" A// T()RA''A%.& value bet1een R4,...,4$S
0
ref
and 0
O
N Al1a3s ?4@ 1hen no multi"code is used
E
ref
" No. of coded bits per 4 ms before rate matching multiplied b3 the RMA for that
particular bearers2 highest bit"rate Transport -ormat. &omputed b3 the RN&.
o .n the case of R' combination, the Radio 'earer %pecific reference to be used in eJuation
Motorola &onfidential )roprietar3 =4
1
1
]
1

ref
+
ref
+
ref c
ref $
+ c
+ $
(
(
,
,
$-
,
,
,
,
log !
*Juation 3.>"!L &alculation of U0 /)&&5 )o1er ,ffsets Terms

above, are those belonging to the radio bearer 1hose maAimum rate T- has the highest bit
rate of the radio bearers being combined. -or eAample, for the combination of 3.=9bps %R'
V 3;=9bps 'ac9ground V 4!.!9bps AMR, the reference po1er offset values applied to the
eJuation are those belonging to the maAimum rate T- B4!A33<C of 3;=9bps 'ac9ground
radio bearer.
E
O "
No. of coded bits per 4 ms before rate matching multiplied b3 the RMA for that particular
bearers2 Transport -ormat of interest.
.n the case of R' combination, the Radio 'earer %pecific reference values to be used in eJuation are
those belonging to the radio bearer 1hose maAimum rate T- has the highest bit rate of the radio bearers
being combined. -or eAample, for the combination of 3.= 9bitKs %R' V 3;= 9bitKs 'ac9ground V
4!.!9bitKs AMR, the reference po1er offset values applied to eJuation are those belonging to the
maAimum rate T- B4!, 33<C of 3;=9bitKs 'ac9ground radio bearer, B]
c'ref
and ]
$'ref
is 3L4$ D E
ref
T
!!+==C.
3)* !SD&A &!. -ayer
The 5%/)A )5( la3er attributes that can be configured b3 the RN& Brather than the Node 'C includeL
/0 5%")/%&5 %crambling &ode
/0 5%"%&&5 &hannelisation &ode
U0 5%"/)&&5 %crambling &ode
Number of 5%"/%&5 codes per cell
Number of 5%"%&&5 &ode
&ombined /0 5%/)A )o1er Reservation
/0 5%"%&&5 po1er offsets
U0 5%"/)&&5 &haracteristics
o A&E ),7*R ,--%*T
o &6. ),7*R ,--%*T
o NA&E ),7*R ,--%*T
o A&E"NA&E R*)*T.T.,N -A&T,R
o &6. R*)*T.T.,N -A&T,R
o &6. -eedbac9 &3cle 9
Note that compared to the /&5, the maOorit3 of 5%/)A )5( la3er attributes are either pre"determined
b3 either standards Bthe U0 5%"/)&&5 spreading factor and codingC or configured b3 the Node '
Bchooses the optimum coding"modulation"schemeC.
Motorola &onfidential )roprietar3 =!
-or further detail on these 5%/)A specific parameters, see section 4;.
3)9 Iu ,oS Negotiation
-or previous releases of the RN&, the RN& 1ould generall3 be forced to issue a RA' ReOect response
to the &N RA' reJuest 1here the pre"configured Radio bearer attributes 1ould eAceed particular U*
capabilities. The onl3 pre"configured default Radio bearer attributes 1hich the RN& could d3namicall3
attempt to modif3Kreduce in order to meet U* limitations 1ere the T-&% size, the R0& AM 1indo1 size
and AMR set size. -or the U%R3. release of the RN& RA'"to"R' algorithm, the ne1 .u 6o%
Negotiation feature no1 provides the RN& 1ith an alternative to reOecting RA' reJuest given
insufficient U* &apabilities. This feature can be optionall3 turned on or off via the s1itch
.UG6,%GR*N*GG%7.T&5 in the %*T &,RRMA0G,%7.T&5 command.
The .u 6o% Negotiation feature enables the &N to specif3 1ith the original RA' reJuest parameters
additional ?Alternative RA' )arameter :alues@ for the MaAimum 'it Rate. The RN& RA'"to"R'
mapping algorithm can then select 1hich of the set of the original MaAimum 'it Rate and acceptable
Alternative MaAimum 'it Rates Breferred to as the MA8.MUM ,)T.,NA0 %*R:.&* RAT* %*T "
M,%R%C to support based on its anal3sis of the U* capabilities. Note that the M,%R% is independentl3
defined on the U0 and /0.
The RA'"to"R' algorithm can eAploit the .u 6,% Negotiation feature for )% /omain 'ac9ground,
.nteractive and %treaming, &onversational traffic class services served b3 /)&5 Bnot 5%"/%&5C radio
bearers, provided the &N has indicated Alternative MaAimum 'it Rates in its RA' reJuest Bthis is an
optional &N featureC. The d3namic R' parameter negotiationKconfiguration process based on U*
capabilities is onl3 applicable to )% domain service, as &% domain service data transfer is transparent.
-or the &% domain service, U* capabilit3 verification is applicable.
The .u 6o% Negotiation algorithm is designed to al1a3s attempt to provide the highest MaAimum Rate
first. .nitiall3 the algorithm assumes that the highest MaAimum Rate RA' is to be supported and then
performs U* capabilit3 chec9s to ensure that the U* capabilities are sufficient. .f the RN& determines
that the U* fails to meet the minimum bearer reJuirements Bafter R0& 1indo1 scaling if appropriateC
then it 1ill attempt to repeat the mapping process including U* capabilit3 chec9s for the N*8T
0,7*%T alternative RA' rate 1ithin the MA8.MUM ,)T.,NA0 %*R:.&* RAT* %*T BM,%R%C.
%ee 3.4.! for information in U* capabilit3 chec9s.
-or )%"domain '* /&5 service reJuests, if there is no maAimum rate available that meets U*2s
capabilit3 in the M,%R%, the RN& 1ill N,T reOect the RA' reJuest. .nstead the RN& 1ill indicate
across the .u to the &N that a it can accept the minimum M,%R% rate but in practice it 1ill actuall3
assign a lo1er rate radio bearer Bbelo1 the M,%R% setC across the UTRAN .ubKUu interfaces.
-or )%"/omain RT /&5 service reJuests, if a rate 1ithin the M,%R% cannot be found then the RA'
reJuest 1ill be reOected.
The RN& 6o% Negotiation feature completel3 ignores G'R so as to simplif3 the algorithm. .t is
recognised this could lead to issues if M'R W G'R.
Motorola &onfidential )roprietar3 =3
3)9)% Iu ,oS Negotiation o$ &S D&#! 0E Ser;ices
The follo1ing t1o figures illustrate the .u 6o% negotiation algorithm used for )% '* services
Bdifferences for RT streaming services are indicated in the Note !C over mapped to /&5.

.
'est *ffort %ervice on /)&5
U* &apabilit3 chec9s of AM"R0&
entities, /&5s number, R0& 'uffer
%ize and R0& 1indo1 size.
BR0& 7indo1 scaling is attempted if
necessar3C
Are all U*
&hec9s passed^
/&5 MA& T-&%
&reation )rocess Attempted
Binc. .ncomplete T-&%
configuration algorithmC
T-&% &reation
%uccessful^
Rate T4<
9bitKs^
Bhard"codedC
%et Rate
to 4< 9bitKs
3 % +
-A.0UR* .
.
%tart 1ith the
highest
MaAimum 'it
Rate from the
M,%R% set
N
N
N
-igure 3"! )art 4 of .u 6o% Negotiation
Motorola &onfidential )roprietar3 ==

3 ! 4
/ecision of the
Negotiations based
on &ode mode
*stimate MaA T' length, MaA T'
size, Turbo coding bloc9 size, &&
bloc9 size, %-, uplin9 and
do1nlin9 ph3sical channel
capabilities
Meet the U*2s
coding
&apabilities^

Get the eApected MaA 'it Rate and the
upper limit of d3namic channel
reconfiguration after negotiation.
Rate TT
;9bps^
%elect the neAt
lo1er rate
%uccess
N
N
(
(
.f there is no
maAimum rate
available that
meets U*2s
capabilit3 in the
M,%R%, the
RN& 1ill N,T
reOect the RA'
reJuest. .nstead
the RN& 1ill
indicate across the
.u to the &N that a
it can accept the
minimum
M,%R% rate but
in practice it 1ill
actuall3 assign a
lo1er rate radio
bearer Bbelo1 the
M,%R% setC
across the
UTRAN .ubKUu
interfaces.

-igure 3"3 )art ! of .u 6o% Negotiation
Note %
Unless the failure of ?incomplete T-& configuration@ call function, the rate choice 1ill start from the
inferior rate in the M,%R% to the current rate until the minimum rate is selected. .f a failure of
?incomplete T-& configuration@ call function occurs, then the trial rate 1ill be directl3 set as 4<9bitKs.
.f the failure of ?incomplete T-& configuration@ call function still eAists, then the rate negotiation
algorithm ends up 1ith failure.
Note +) Streaming ser;ice modi$ication o$ t"e agorit"m
The process of adaptive U* capabilities negotiation for real"time services in )% domain Bcarried b3
/)&5C is used to get the eApected MaA 'it Rate b3 negotiation process. The process of negotiation is
li9e that used for )% '* services eAcept for the follo1ing differenceL
Motorola &onfidential )roprietar3 =$
%elect the neAt lo1er 'it Rate from M,%R% until the minimum bit rate in this set. .f there is no
Alternative MaA 'it Rate that can meet U* capabilities, then the reJuest of services is reOected.
3)9)+ Iu ,oS Negotiation impacts on Ser;ice Estabis"ment H 'odi$ication
*stablishing /&5 '* and RT services in the )% domain
Scenario %D Ony signaing e>ists
7hen establishing a ne1 '* services in )% domain, if this ne1 '* services need to be established on
/&5, then the supportable MaA 'it Rate is to be negotiated based on U* capabilities and the algorithm
described in 3.+.
Scenario +D Ot"er ser;ices aready e>ist
4. .f a ne# services nee$ to be establishe$ on /C)L
.f necessar3 .u 6o% Negotiation of this ne1l3 reJuested service is performed before re"
negotiation of eAisting /)&5 '* bearers is attempted.
.f .u 6o% Negotiation of this ne1l3 reJuested service is insufficient or not possible thenL
o .f there are eAisting '* services, then the MaA 'it Rate of eAisting '* services is
negotiated do1n Bgracefull3 do1n to the neAt M,%R% rateC.
o .f a ne1 '* service can be admitted, then this services reJuest is accepted or else it is
reOected.
Esta!"sh"n# ser$"ces "n the CS %&ma"n
Scenario %D Ony signaing e>ists
7hen establishing a ne1 service in &% domain, it needs to be chec9ed one b3 one for the default
configuration parameters of services in &% domain related to U* capabilities and chec9. .f these
parameters don2t meet the U* capabilities, the service reJuested is reOected.
Scenario +D Ot"er ser;ices aready e>ist
At first it is chec9ed one b3 one for the default configuration parameters of services in &% domain
related to U* capabilities and chec9. .f it can meet U* capabilities, the service reJuested is accepted. .f
these parameters cannot meet U* capabilities, it needs to be chec9ed 1hether there are eAisting )%
services establishing on /&5.
.f there are eAisting )% services establishing on /&5, the eAisting services are to be negotiated
and their MaA 'it Rate are reduced. Then a ne1 &% service is chec9ed 1hether to meet U*
capabilities.
o .f a ne1 &% service can meet U* capabilities, this ne1 &% service is accepted
Motorola &onfidential )roprietar3 =<
o .f the eAisting )% services have the minimum MaA 'it Rate b3 negotiation and a ne1
&% service don2t meet U* capabilities, a ne1 reJuest is reOected.
.f there is no eAisting )% service established on /&5, a ne1 reJuest is reOected.
3)9)3 Iu ,oS Negotiation impact on &S and #S Ser;ice Reease
Scenario %D Remaining ser;ices are #S ser;ices ony
No action.
Scenario +D Remaining ser;ices are &S ser;ices carried on !SD&A
No action.
Scenario 3D Remaining ser;ices are &S ser;ices carried on D#! gi;en &S Ser;ice Reease
.f there are remaining '* services carried on /&5, it is necessar3 for the remained '* services
to update the upper limit of bit rate for d3namic channel reconfiguration based on U*
capabilities information.
.f there are remaining )% RT services, it is necessar3 for the remained )% RT services to
reconfigure its bit rate Bhigher than or eJual to Guaranteed bit rate and lo1er than or eJual to
eApected MaA bit rateC.
Scenario 2D Remained ser;ices are &S ser;ices carried on D#! gi;en #S Ser;ice Reease
.f there are remaining )% RT services, it is necessar3 for the eAisting )% RT services to
reconfigure its bit rate Bhigher than or eJual to Guaranteed bit rate and lo1er than or eJual to
eApected MaA bit rateC. .f these are '* service, it is necessar3 for the eAisting '* services to
update the upper limit of bit rate for d3namic channel reconfiguration.
3)%: Dependencies
3)%:)%Dependency on #ore Net=or< capabiities
The abilit3 of the RA'"to"R' to successfull3 find a UTRAN R' to serve a &N RA' service reJuest
1ill in part depend on core net1or9 controlled factors all relating to ho1 sensibleKintelligentKtolerant and
fleAible the &N is 1hen creating and processing RA' ReJuests and ResponsesL
Motorola &onfidential )roprietar3 =>
/oes the &N have an3 concept of U* &apabilities or &lasses Be.g. in the 50RC that it uses 1hen
creating a suitable RA' reJuest^
/oes the &N 9no1 UTRAN limitations, e.g. that it should not attempt to assign more than ! )%
RA' reJuests^
Are all the RANA) RA' reJuest information elements strictl3 applied and monitored b3 &N^
*AampleL /oes the &N care about the RA' reJuest %/U *rror Ratio, or is it happ3 to accept
1hatever the RN& applies, 1hich could be over"riding values it suggests^
/oes the &N appl3 .u 6o% Negotiation, and if it does ho1 generous is the &N it providing a
?range@ of alternative maAimum bit rates^
After an initial RA' Response failure message, 1ill the &N reattempt the RA' ReJuest but 1ith
reduced 6o% reJuirements^
3)%:)+Dependency on UE capabiities
The abilit3 of the RA'"to"R' to successfull3 find a UTRAN R' to serve a &N RA' service reJuest
1ill in part depend on the U* &apabilities. At various stages during the construction of a Radio bearer
attribute set, the RA'"to"R' algorithm performs chec9s to ensure that certain U* and RN& capabilities
are not being eAceeded. 7hen these ?chec9s@ reveal that certain U* or RN& capabilities ma3 be being
eAceeded then the RN& can in the follo1ing order attempt to eitherL
4. Modif3 the RA' reJuest Radio 'earer default Attributes to fall 1ithin U* &apabilities 1ithout
Oeopardising the desired RA' reJuest 6o% targets Be.g. b3 shortening the R0& 1indo1 sizeC.
!. Negotiate alternative RA' 6o% reJuirements 1ith the &N Bsee section .u 6o% NegotiationC.
3. Modif3 an eAisting RA' Bmulti"RA' scenarioC to effectivel3 free U* resources for the ne1l3
reJuested RA' 1ithout Oeopardising the desired RA' reJuest 6o% targets. Bsee section .u 6o%
NegotiationC.
=. ReOect the RA' ReJuest
The follo1ing three tables are a version of the ?)ossible U* radio access capabilit3 parameter settings@
table to be found in 3G)) T%!$.3<. These tables list in ro1s the U* capabilit3 and per individual
capabilit3 the range of actions Bhighlighted aboveC that the RN& can perform.
UE radio access capabiity
parameter
#"ec<ed
by RN#I
.ESBNO
I$ t"ere is a
RN# !ard
-imit? Range
or
Assumption?
="at is itI
3i RN# attempt to
modi$y t"e de$aut Radio
bearer attribute to meet t"e
UE capabiityI
.ESBNO
Motorola &onfidential )roprietar3 =;
)/&)
&apabilities
%upport for R-& !$> (*% (*%
%upport for loss"less %RN%
relocation
(*% (*%
MaAimum header
compression conteAt space
(*% (*%
%upport for R-& 3+$ nKa
%upport for R-& 3+$
conteAt relocation
nKa
MaAimum number of R,5&
conteAt sessions
nKa
%upport for Reverse
/ecompression
nKa
R0& and
MA&"hs
&apabilities
Total R0& AM and MA&"hs
buffer size
(*% (*%
R0& buffer size is negotiated
bet1een RN& and U*, and
the RAKTA 1indo1 size can
be d3namicall3 configured.
MaAimum number of AM
entities
(*% N,
MaAimum R0& AM 1indo1
size
(*% (*%
U* Tr&5
/0
MA&K)5(
&apabilities
MaA. sum of No. bits of all
Tr'l9s being received at an
arbitrar3 time instant
(*% (*%
7hen necessar3 halve TT. of
!$<E bearer to meet
constraints of U*
MaA. sum of number of bits
of all convolutionall3 coded
transport bloc9s being
received at an arbitrar3 time
instant
(*% N,
MaAimum sum of number of
bits of all turbo coded
transport bloc9s being
received at an arbitrar3 time
instant
(*% N,
MaAimum number of
simultaneous transport
channels
(*% < N,
MaAimum number of
simultaneous &&TR&5
N, N,
MaAimum total number of
transport bloc9s receive
1ithin TT.s that end at 1ithin
the same 4 ms interval
(*% N,
MaAimum number of T-& (*% !$< (*%
There is a fiA modifies the
maA. number of AMR Rates
from = BU*s T-&% Q 3!C to !
BU*s T-&% \ 3!C.
MaAimum number of T- (*% (*%
%upport for turbo decoding (*% N,
Table 3">L U* &apabilit3 &hec9s " )/&), R0& D MA&
Motorola &onfidential )roprietar3 =+
parameter
#"ec<ed
by RN#I
.ESBNO
I$ t"ere is a
RN# !ard
-imit?
Range or
Assumption?
="at is itI
3i RN# attempt to
modi$y t"e de$aut
Radio bearer
attribute to meet t"e
UE capabiityI
.ESBNO
U* Tr&5 U0
MA&K)5(
&apabilities
MaA. sum of No. bits of all
Tr'l9s being received at an
(*% N,
MaA. sum of number of bits of
all convolutionall3 coded
transport bloc9s being received
at an arbitrar3 time instant
(*% N,
MaAimum sum of number of bits
of all turbo coded transport
bloc9s being received at an
(*% N,
MaAimum number of
simultaneous transport channels
(*% < N,
MaAimum total number of
transport bloc9s receive 1ithin
TT.s that end at same time
(*% N,
MaAimum number of T-& (*% !$< (*%
MaAimum number of T- (*% (*%
%upport for turbo decoding (*% N,
-// )h3sical
&hannel
parameters in
the do1nlin9
MaAimum number of
/)&5K)/%&5 codes to be
simultaneousl3 received
(es No
MaAimum number of ph3sical
channel bits received in an3
4 ms interval B/)&5, )/%&5,
%"&&)&5C
(es No
%upport for %- $4! (es No
%upport of 5%")/%&5 (*% N,
MaAimum number of /)/&5
bits transmitted per 4ms
(*% N,
%imultaneous reception of
%&&)&5 and /)&5
N, N,
%imultaneous reception of
%&&)&5, /)&5 and 5%"
)/%&5
No No
%upport of dedicated pilots for
channel estimation
No No
%upport of dedicated pilots for
channel estimation of 5%"/%&5
(*% (*%
Table 3";L U* &apabilit3 &hec9s " R0& D )5(
Motorola &onfidential )roprietar3 $
parameter
#"ec<ed
by RN#I
.ESBNO
I$ t"ere is a
RN# !ard
-imit?
Range or
Assumption?
="at is itI
3i RN# attempt
to modi$y t"e
de$aut Radio
bearer attribute to
meet t"e UE
capabiityI
.ESBNO
-// )h3sical
channel
parameters in
uplin9
MaAimum number of /)/&5 bits
transmitted per 4 ms
(es (es
%upport of )&)&5 tbc
R- -//
&apabilities
U* po1er class (*% (*%
RN& can configure
the MA8 uplin9
transmission po1er
according U*
po1er class.
TAKRA freJuenc3 separation N, N,
Multi"mode K
Multi"RAT
related
&apabilities
%upport of G%M (*% N,
%upport of multi"carrier tbc
%upport of UTRAN to G*RAN
Net1or9 Assisted &ell &hange
tbc
%ecurit3
&apabilities
&iphering algorithm capabilit3"
U*A
(*% RN& support both
of the ciphering
algorithm
&iphering algorithm capabilit3"
U*A4
(*% "
.ntegrit3 protection algorithm
capabilit3" U.A4
(*% RN& support
integrit3 protection
algorithm
U* positioning
related
&apabilities
%tandalone location methodBsC
supported
N, N,
,T/,A U* based method supported N, N,
Net1or9 Assisted G)% support (*% (*%
G)% reference time capable (*% (*%
%upport for .)/0 (*% (*%
%upport for RA"TA time difference
t3pe !
(*% (*%
%upport for U* )ositioning
measurement validit3 in &*00G)&5
and URAG)&5 RR& states
N, N,
U*
Measurements
&apabilities
Need $or do=nin< compressed mode
-// measurements (*% N,
T// measurements N, N,
G%M measurements (*% N,
Multi"carrier measurement N, N,
Need $or upin< compressed mode
-// measurements (*% N,
T// measurements N, N,
G%M measurements (*% N,
Multi"carrier measurement N, N,
General
&apabilities
Access stratum release indicator N, N,
-reJuenc3 band N, N,
Motorola &onfidential )roprietar3 $4
R- capabilit3 -// eAtension N, N,
Measurement capabilit3 eAtension N, N,
Inter1RAT UE radio access capabiity
G%M (*% N,
cdma! N, N,
/0 capabilit3 1ith simultaneous 5%"
/%&5 configuration
(*% (*%
Table 3"+L U* &apabilit3 &hec9s " Miscellaneous
3)%% Database parameters
Operator Action Description
E>ampe
&arameters
T()RA''A%.& A//K0%TK
A&TKRM:
/efines = maOor Radio 'earer
attributes N
T3pical &onfiguration %1itch
Used to A&T.:AT* a RA' after
its been created
Traffic &lassKMaA.
'it RateK%ource
/escriptorK&N
%1itching.
T()RA'R0& A//KM,/K
RM:
/efines all maOor R0& parameters
from R0& mode to 'uffer sizes
R0&M,/*
MA8/AT
AMR0&/.%&AR/
M,/*
T()RA'%*M.%TAT.&T- A//KM,/K
RM:
/efines ph3sical 0a3er attributes
such as &odingKTT.K&R&
TT.
T()RA'/(NAM.&T- A//KM,/K
RM:
/efines on a per Transport -ormat
basis the size and number of R0&
bloc9s
R0&%.F*
-R& %*T Modif3 the -R& algorithm
parameters including %R' t3pical
parameter indeAes, frame
processing priorit3 parameters,
)/&) la3er header compression
algorithm parameters, U0K/0
/)&5 po1er control parameters,
logic channel priorit3 parameters,
frame protocol time 1indo1
parameters, time slot format
parameters of ph3sical channels, )
&).&5 default *cKNo, etc.
Tpc)o
Tfci)o
Tfci'it
T()RA',0)& %*T Modif3 target '0*R '0*R6ualit3
Table 3"4L RA'"to"R' Mapping Algorithm 0MT &ommands
The follo1ing commands can be used to optimize the MA& multipleAing algorithmL
Motorola &onfidential )roprietar3 $!
%*T -RM5AN/)R.,
%*T 0,&5)R.,
%*T 5%/%&5%&5*)R.,
%*T -A&5%&5*)R.,
The detailed information on these commands can be found in the ?Reference parameters spreadsheet@.
3)%+ Jey per$ormance indicators
Algorithm )erformance E). is an indicator of ho1 1ell is the algorithm performing. To improve the
performance, algorithm might be modified to reach the Jualit3 level.
To measure the performance of RA' Mapping algorithm, the follo1ing E).s could be collected to
measure the reOection rate of RA' reJuest rate. ,ther than invalid reJuest, the maOor source of the
reOection is from the U* compatibilit3. A high RA' setup failure rate ma3 suggest there2re large U*
populations 1ith limited capabilit3 on the mar9et, therefore this algorithm needs to be modified to
accommodate more of such U*s until the32re retired from the mar9et.
J&I Description
&%GRA'GsetupG-A.0GUN%U)G&*00
Number of &% RA's unsuccessfull3 setup b3 RA' assignment
ReJuest in each cell caused b3 non supported UTRAN
capabilities. *Juals to
&%GRA'GsetupG-A.0GUN%U)G&*00 K
&%GRA'GR*6GsetupG&,N: V &%GRA'GR*6GsetupG%TR
)%GRA'GsetupG-A.0GUN%U)G&*00
Number of )% RA's unsuccessfull3 setup b3 RA' assignment
ReJuest in each cell caused b3 non supported UTRAN
capabilities. *Juals to
)%GRA'GsetupG-A.0GUN%U)G&*00 K
B)%GRA'GR*6GsetupG&,N: V )%GRA'GR*6GsetupG%TR V
)%GRA'GR*6GsetupG.NT*R V )%GRA'GR*6GsetupG'EG
Table 3"44L RA'"to"R' Mapping Algorithm E). Tests
Measurable improvements in these E).s should be observed bet1een 1hen the .u 6o% Negotiation
feature is disabled and 1hen it is enabled.
3)%3 Optimization guideines
3)%3)%&arameters and recommendation
%ee ?Reference parameters spreadsheet@.
Motorola &onfidential )roprietar3 $3
3)%3)+E>pected J&I ;aues
This section gives the eApected s3stem performance for the recommended parameters.
J&I E>pected J&I Vaues
&%GRA'GsetupG-A.0GUN%U)G&*00
.4_
:er3 dependent on RA' reJuest and U*K&N
&apabilities. Above value assume .u 6o%
Negotiation &apabilit3, hence 1h3 it is
significantl3 less than eJuivalent U%R! target
B4_C.
)%GRA'GsetupG-A.0GUN%U)G&*00
.4_
:er3 dependent on RA' reJuest and U*K&N
&apabilities. Above value assume .u 6o%
Negotiation &apabilit3, hence 1h3 it is
significantl3 less than eJuivalent U%R! target
B4_C.
Table 3"4!L RA'"to"R' Mapping E). *Apected :alues
3)%3)3Sensiti;ity anaysis
-or further investigation.
Motorola &onfidential )roprietar3 $=
2 RA0 do=nsizing
)reviousl3, 1hen admitting '* services Bincluding interactive and bac9groundC, the initial allocated
bearer rate in the algorithm design does not ta9e into account the load situation, so calls ma3 get
reOected 1hen the initial bearer rate is relativel3 high and the load is heav3. This ma3 cause '* services
never to be admitted and this 1ill have an impact on admission success rate.
RA' do1nsizing provides the abilit3 to control the initial maAimum bit rate of interactive and
bac9ground at admission, i.e. do1nsize the bit rate as a function of the current cell load for )%
.nteractiveK'ac9ground radio bearers on a per cell basis and separatel3 for U0 and /0, so that '*
services can be admitted at a lo1er initial rate according to the current loading situation thus result in an
improvement to admission success rate.
2)% O;er;ie=
RA' do1nsizing algorithm is onl3 applicable to )% domain '* services, this implies that, for
multiple RA' combinations that incorporate both '* services and non"'* services, the
algorithm 1ill onl3 impact on '* service part.
.t 1ill onl3 be activated 1hen the '* services are being admitted as initial RA' assignment. .f
the admission reJuest after RA' do1nsizing is reOected again, it is possible to use Jueuing, pre"
emption, or direct retr3 to ensure admission.
.t 1ill be applied to /&&& under condition of both /&5 to /&5 Braising rateC and -A&5 to
/&5 %1itching, and 1ill also be applied to %RN% relocation under scenarios 1ith U* involved
that need to set up a RA' in Target RN& during relocation. The do1nsizing process to be
applied is the same as case of initial RA' assignment. %pecificall3, there is a 0MT command
4
to s1itch onKoff the URA' do1nsizingU feature in initial RA' assignment as 1ell as in %RN%
relocation. 'ut URA' do1nsizingU feature is al1a3s on for application in /&&& and can not be
deactivated 1ith the 0MT command.
.t 1ill not be applied under occasions of 5ard 5and over.
.n addition, it should be noted that the RA' do1nsizing is onl3 applied to a RA' that 1ill be
mapped to /&5, in other 1ords, the RA' to be do1nsized 1ill be mapped to /&5.
2)+ Agorit"m Description
2)+)% Singe RA0 case
The RA' do1nsizing algorithm is described as separatel3 for /&&& s1itch ?,N@ and ?,--@.
4
%*T &,RRMA0G,%7.T&5
Motorola &onfidential )roprietar3 $$
D### @ONAD
Step %L Use the minimum of RYbac9ground allocated initial bearer rate2, YeApected maAimum bit rate2S
as the initial admission rate for '* service.
The Ybac9ground allocated initial bearer rate2 refers to ,DM RN& oriented configurable parameter
representing '* traffic .nitial bit rate configured for /0 and U0 independentl3, and the value range of
R;, 4<, 3!, <=, 4!;, 4==, !$<, 3;=, !=; 9bitKsS has been defined in the 0MT v4.$ for the selection of
this configurable parameter Bb3 using a 0MT command
!
C. Note that the Ybac9ground allocated initial
bearer rate2 should not be set at a value higher than an3 of the rates selected for the /&&& rate
threshold, full coverage rate threshold or %5, bearer rate threshold, i.e. \ min R/&&& rate threshold,
full coverage rate threshold, %5, bearer rate thresholdS. .t should be noted that the !=;9bitKs rate in
the rate set above 1ill never be effective, due to the maAimum rate of /&&& Rate Threshold and the
-ull coverage rate is 3;= 9bitKs.
The Ke>pected ma>imum bit rateL is the RA0 inde> bearer rate of a selected RA' for the target
service that has been configured 1ith a 0MT command
3
. )articularl3, if .u 6o% negotiation function is
available and in effect, the decision on selecting the YeApected maAimum bit rate2 should has considered
the U* capabilit3 for supporting such a rate.
Step +L &hec9 the suitabilit3 of the initial admission bearer rate Bor current rateC based on the current
load in a cell.
The chec9 ta9es into account onl3 current load metric information Bcell radio load, code resources, Node
' available resource indication informationC in the target cell. This information 1ill be provided b3
&A&. The chec9ing process is as follo1sL &A& 1ill regularl3 provide the cell radio load information,
the code information and the Node ' available resource information. )articularl3, the cell radio load
information in the implementation is simpl3 the supportable number of bearer instances 1ith a reference
bearer rate, such as ! /&5 bearers 1ith each 4== 9bitKs. Upon that, RA' do1nsizing 1ill chec9 if the
bearer rate of current RA' reJuest can be accepted.
-or eAample, if the cell radio load information provided b3 &A& is that ! /&5 bearers 1ith each 4==
9bitKs can be admitted B1hich can be regarded as a 9ind of thresholdC, and the reJuested RA' rate is
4!; 9bitKs, RA' do1nsizing algorithm 1ill accept the reJuest, because 4!; 9bitKs W ![4== 9bitKs.
Step 3D .f the initial admission bearer rate is o9, go to step $ directl3, other1ise, go to step =.
Step 2D /o1nsizing BreducingC the initial admission bearer rate one step Bfind the neAt lo1er bearer
rateC. .f the reduced initial admission bearer rate is the minimum value and cannot be do1nsized an3
more, go to step $, other1ise, go to step !.
As mentioned in %tep 4, in v4.$ the value range of the '* traffic .nitial bit rate is R;, 4<, 3!, <=, 4!;,
4==, !$<, 3;=, !=; 9bitKsS. The do1nsizing process is to go through this rate set do1n1ard from
current bearer rate until the minimum bit rate in the rate set. -or eAample, if the rate before do1nsizing
is <=9bitKs, the ne1 bearer rate to be eAamined 1ill be 3!9bitKs. ,bviousl3, in v4.$ the minimum rate
that do1nsizing can reach is ;9bitKs.
!
%*T -R& N Ul'eTraff.nit'itrate K /l'eTraff.nit'itrate
3
A// T()RA''A%.&
Motorola &onfidential )roprietar3 $<
Step 4D .f the initial admission bearer rate is o9 or the minimum value has been reached, RN& sends the
reJuest to &A&.
Step 6D .f &A& reOects the reJuest and the intelligent admission algorithm is enabled, Jueuing and pre"
emption 1ill be tried. .f intelligent admission algorithm failed to admit the service reJuest or not
available, but direct retr3 algorithm is enabled, direct retr3 algorithm 1ill be used, other1ise, if direct
retr3 algorithm is unavailable or fail to direct the call, the RA' reJuest 1ill be reOected.
D### @O//AD
The steps for /&&& ?,--@ is the same as those for /&&& ?,N@ eAcept in step 4, the initial allocated
bearer rate 1ill be the YeApected maAimum bit rate2, 1hich has the same meaning as mentioned before.
.n rate do1nsizing process, the same rate set as Y/&&& is on2 case 1ill be gone through from the initial
allocated bearer rate decided in step 4 to the minimum '* bearer rate, based on current load metric
information Bcell radio load, code resources, Node ' available resource indication informationC in the
target cell.
2)+)+ 'uti RA0 case
The process is the same as in the single RA' case. -or the case of multi"RA's in a single RA' reJuest
message being both '* services, the RA' do1nsizing principles areL
4. The do1nsizing of the bearer rate 1ill be applied to one RA' each time.
!. *ach time onl3 one RA' is selected to be do1nsized according to the priorit3 and the bearer rate of
RA's. NoteL )riorit3 is based on T5) of .nteractive services, and .nteractive service has higher priorit3
than 'ac9ground service.
3. -or chec9ing of the cell load during the RA' do1nsizing process, the RA' do1nsizing algorithm
1ill ta9e into account all the RA's in the multi RA' reJuest, chec9ing if after admitting the multi"RA'
reJuest the cell load 1ill be be3ond the cell load limit. -or eAample, if the cell radio load information
provided b3 &A& is that ! /&5 bearers 1ith each 4==9bitKs can be admitted B1hich can be regarded as
a 9ind of thresholdC, and a multi"RA' reJuest 1ith t1o RA's is submitted and the bearer rates are
3;=9bitKs and 4!;9bitKs respectivel3, RA' do1nsizing algorithm 1ill do1nsize the bearer rate because
B3;=9bitKsV4!;9bitKsCQ![4==9bitKs, impl3ing the cell load increase after admission of the reJuested
RA' 1ill be be3ond the cell load limit.
-or ho1 to select a RA' to do1nsizeL
.f the priorities of RA's are totall3 different, the RA' 1ith the lo1est priorit3 1ill be
do1nsized until the minimum '* bearer rate is reached, if still not ,E, select the RA' 1ith
higher priorit3 to tr3.
.f the priorities of the RA's are totall3 the same, then select the RA' 1ith current highest bear
rate to perform do1nsize and chec9.
.f the bearer rate and the priorit3 of the RA's desired to be do1nsized are all the same,
Motorola &onfidential )roprietar3 $>
arbitraril3 choose a RA' to do do1nsize and chec9, if the load criterion is still not met, then
alternatel3 select a RA' from the RA's 1ith the same priorit3 and bearer rate to do1nsize.
E>ampe. A single RA' reJuest message includes t1o RA's. The initial bearer rate is 3;= 9bitKs for the
first RA' and !$< 9bitKs for the second RA' and both RA's have the same priorit3. Then the
do1nsizing procedure is Bassume the allo1ed cell load increase is 3[4==9bitKs /&5 bearers, 1hich is
from &A&CL
if the load increase b3 admitting the t1o bearers B3;=9bitKs V !$<9bitKsC Q allo1ed cell load increase
decreasing t"e rate o$ t"e %st RA0 to +46<bitBs
if the load increase b3 admitting the t1o bearers B!$<9bitKsV!$<9bitKsC Q allo1ed cell load increase
arbitrariy seecting t"e +nd RA0? and decreasing t"e rate o$ to %22<bitBs
if the load increase b3 admitting the t1o bearersB!$<9bitKsV4==9bitKsC W allo1ed cell load increase
OJ? t"e $ina seected rate $or $oo=ing admission c"ec<ing is +46<bitBs $or t"e %
st
RA0 and
%22<bitBs $or t"e +
nd
RA0
endif
endif
endif
A fe1 more clarifications or highlights are given belo1.
The initial bearer rate before RA' do1nsizing attempt, i.e. aforementioned Ybac9ground
allocated initial bearer rate2, can be configured b3 bac9ground ,DM command separatel3 for
uplin9 and do1nlin9.
RA' do1nsizing is used independentl3 for uplin9 and do1nlin9.
The function of RA' do1nsizing can be enabled and disabled b3 bac9ground ,DM
configuration. *nabling or disabling this function applies to both U0K/0 through one s1itch.
The .&A& algorithm Be.g. pre"emption and JueuingC can be configured b3 bac9ground ,DM
command independent of the function of RA' do1nsizing
The direct retr3 algorithm can be configured b3 bac9ground ,DM command independent of the
function of RA' do1nsizing.
2)3 Dependencies
There are some dependencies bet1een RA' do1nsizing and /&&&, .u 6o% negotiation and &A&
algorithms.
Motorola &onfidential )roprietar3 $;
The dependenc3 bet1een RA' do1nsizing and /&&& is about determination of initial bearer rate at
RA' setup Bthe up"limit for the RA' do1nsizingC, an ,DM configurable RN& oriented rate shall be
considered if /&&& algorithm is on.
%imilarl3, .u 6o% negotiation, if available, is activated before the RA' do1nsizing and used to
determine the eApected maAimum bit rate the RA' can support. This eApected maAimum bit rate shall
not be higher than the RANA) reJuested maAimum bit rate and shall be selected ta9ing into account the
U* capabilit3. The RA' do1nsizing algorithm 1ill determine the initial bearer rate subOect to limitation
of the eApected maAimum bit rate. There is no RA' do1nsizing related parameters can be used for
optimization here since .u 6o% negotiation algorithm is responsible for this.
The relationship 1ith &A& is about the cell load calculation in &A&. &A& provides RA' do1nsizing
current cell load situation, in a simple form that ho1 man3 /&5 bearers 1ith 1hat 9ind of data rate can
be admitted so that RA' do1nsizing can decide if current data rate under chec9ing is acceptable. Also
there is no RA' do1nsizing related parameters can be used for optimization since &A& Oust provides
the result to RA' do1nsizing.
2)2 Reated -'T commands
2)2)% SET #ORR'A-GOS3IT#!
./ Name /escription
&h%1itch
&hannel class
algorithm s1itch
The s1itch ?RA'G/,7N%.F.NGG%7.T&5@ under
?&hannel class algorithm s1itch@
:alue rangeL ,N, ,--
)h3sical unitL None
This is the s1itch used to activate or de"activate the RA' do1nsizing.
2)2)+ SET /R#
These are the configurable initial bearer rates 1hich 1ill be considered 1hen selecting the initial
admission rate for '* services before RA' do1nsizing attempt if /&&& is on Bfor U0 and /0C. The
parameters are RN& oriented.
&arameter Name
'!BeTra((In"tB"trate U0 '* traffic .nitial bit rate
)!BeTra((In"tB"trate /0 '* traffic .nitial bit rate
Motorola &onfidential )roprietar3 $+
2)4 Jey per$ormance indicators
J&I Description
&all'loc9Rate.nteractive &all bloc9ing rate for .nteractive service due to ne1 call
&all'loc9Rate'ac9
ground
&all bloc9ing rate for 'ac9ground service due to ne1 call
2)6 Optimization guideines
This section provides some guidelines for the testKdeplo3ment engineer to optimize the operation of this
algorithm and also recommendations for parameter settings.
2)6)% &arameters and recommendation
2)6)+ E>pected J&I ;aues
None.
2)6)3 Sensiti;ity anaysis
The s3stem performance is not tight related to the setting of an3 single parameter of this algorithm,
actuall3 it is the overall priorit3 setting of all the parameters that 1ill impact the performance of this
algorithm. &urrentl3 there is no simulationKlabKfield result available to optimize the parameters of this
algorithm.
Motorola &onfidential )roprietar3 <
4 Dynamic #"anne #on$iguration #ontro
The d3namic channel configuration control B/&&&C algorithm is a connection oriented algorithm 1hich
is in charge of rate reallocation for users having best effort B'*C services Binteractive and bac9groundC.
.t deals 1ith the burstiness of '* services b3 d3namicall3 reconfiguring the channel band1idth to
accommodate changes in the service transmission data rate. The benefit of the /&&& algorithm is that
do1nlin9 channel code and po1er resource utilisation is improved, 1hich in turn enhances s3stem
capacit3.
The decision to modif3 the connection band1idth is based on traffic volume and optionall3 lin9 Jualit3L
Traffic volume measurements BT:MC performed both on U0 and /0. .f the R0& buffer occupanc3
becomes smaller than a configured threshold, the /&&& algorithm 1ill reduce the band1idth for
that user. .f the R0& buffer pa3load is higher than a configured threshold, the /&&& 1ill increase
the band1idth for that user Bthere are certain restrictions to this rate increase that 1ill be eAplained
laterC.
0in9 Jualit3 chec9ing is based on t1o triggers, code po1er reports and %5, 4A reports. The
reaction to each can be enabled or disabled. .f /0 lin9 Jualit3 degrades, as indicated b3 a code
po1er event *a measurement, the channel band1idth is reduced. .n order to increase the probabilit3
of successful handover channel band1idth is reduced in response to a %5, event 4A measurement
for a user if their rate is above a configurable rate.
The U* state transition algorithm controls RR& state transitionsL &*00G/&5 W"Q &*00G-A&5,
&*00G-A&5 W"Q &*00G)&5 and &*00G)&5 W"Q URAG)&5, in order to save resources and reduce
signalling and control overhead. .n U%R3, this algorithm is applied to all pac9et s1itched B)%C traffic
classesL &onversational, %treaming, .nteractive and 'ac9ground. The term /&&& is often associated
1ith /&5 rate control as 1ell as RR& state transitioning. 5o1ever, throughout the optimisation guide
the /&&& 1ill be used to refer to /&5 rate control onl3.
A number of changes have been made to the /&&& algorithm for U%R3, the changes are described
throughout this section but the 9e3 aspects are captured here for reader2s convenienceL
4. MultipleAing at the ph3sical la3er for )% '* RA's.
!. RR& state transitions are no1 also performed for )% non"'* users.
3. RA' do1nsizing is introduced. This impacts initial rate selection, rate selection on moving from
&*00G-A&5 to &*00G/&5 and /&5 rate increase attempts. The impacts are referenced, but
also refer to the specific RA' do1nsizing section.
=. The /&&&G%7.T&5 no1 controls enables or disables all /&5 rate modification including the
0&& Bbasic overload detectionC
$. 0in9 Jualit3 chec9ing before rate increase has been discussed, but is currentl3 not present in the
code.
<. Traffic volume for a &*00G/&5 to &*00G-A&5 transition is no1 based on a threshold,
Motorola &onfidential )roprietar3 <4
rather than zero traffic volume.
>. 5andling of the 5%"/%&5 channel
4)% D### agorit"m contro s=itc"es
These s1itches are enabled or disabled through the SET #ORR'A-GOS3IT#!
D###MS3IT#!
The D###MS3IT#! allo1s the /&&& algorithm to be enabled or disabled. The /&&& algorithm
controls the rate assigned to '* users 1hilst in &*00G/&5 RR& state based on T:M reports. Unless
the D###MS3IT#! is enabled the RATEMADNM0.MT#&MS3IT#!?
0EMRATEMDO3NM0/M!OMS3IT#! and 0&& 0ERATERED BRA A// &*000/RL
/00/R%*&,N/A&T.,NT'*RAT*R*/C triggers are disabled.
RATEMADNM0.MT#&MS3IT#!
The RATEMADNM0.MT#&MS3IT#! s1itch is used to indicate 1hether to adOust the /0 band1idth
according to the /0 transmitted code po1er. The D###MS3IT#! must be enabled.
0EMRATEMDO3NM0/M!OMS3IT#!
The 0EMRATEMDO3NM0/M!OMS3IT#! s1itch is used to indicate 1hether to reduce the /0
band1idth to the BeB"tRateTh% rate in response to %5, 4A event report arrivals. The
D###MS3IT#! must be enabled.
&SM0EMSTATEMTRANSMS3IT#!
The &SM0EMSTATEMTRANSMS3IT#! s1itch is used to enable or disable the U* state s1itching
function B&*00G/&5 W"Q &*00G-A&5 W"Q &*00G)&5 W"Q URAG)&5C for '* users. .f this
s1itch is disabled, RR& state transitioning is not possible even if the D###MS3IT#! is enabled.
&SMNONM0EMSTATEMTRANSMS3IT#!
The &SMNONM0EMSTATEMTRANSMS3IT#! s1itch is used to enable or disable the U* state
s1itching function B&*00G/&5 W"Q &*00G-A&5 W"Q &*00G)&5 W"Q URAG)&5C for )% non '*
users. .f this s1itch is disabled, RR& state transitioning is not possible even if the D###MS3IT#! is
enabled.
Motorola &onfidential )roprietar3 <!
4)+ Detaied Description
7hen a ne1 )% '* call is established, the call admission control B&A&C algorithm 1ill assign it a
dedicated B/&5K/&5C or common channel B5%"/%&5KRA&5K-A&5C depending on the service bit
rate. The U0K/0 )% '* service 1ill be set up in &*00G/&5 1hen either the reJuested rate BU0 or
/0C is higher than or e0"al to the corresponding U0 K /0 ,DM configurable threshold
B'!PsTra(()ecThs and )!PsTra(()ecThsC, unless 5%"/%&5 assignment is possible Brefer to RA' to
R' mapping sectionC. ,ther1ise, the call 1ill be set up in &*00G-A&5 Bnote that in this case, the onl3
1a3 to transition to &*00G/&5 1ould be through the addition of a ne1 RA' that reJuires /&5 K
/&5. .f this is the case then onl3 T:M =b reporting 1ill be configured as the move to &*00G/&5
1ill not be possible. 5o1ever, if at a later time an additional &% or )% RA' is established, the eAisting
RA' 1ill be moved to a lo1 rate /&5.
.n addition, if the eApected maAimum bit rate is smaller than the rate control threshold Bconfigured
through %*T /&&&L )! * '!)cccRateTh%C, the /&&& 1ill not modif3 the /&5 rate according to
T:M reports regardless of the setting of the /&&&G%7.T&5. The eApected maAimum bit rate is the
maAimum rate determined through 6o% negotiation if enabledP other1ise it 1ill be the maAimum rate in
the RA' reJuest. As a result, it is possible that the /&&& 1ill be applied in one direction onl3 Be.g. in
the U0 direction, but not the /0C.
4)+)% Initia Rate Seection
The maAimum rate a user2s Tr&5 1ill be configured to is the eApected maAimum bit rate. The initial
rate selection for a '* service depends on various settings selected via the ,DML
.f the /&&& s1itch B%*T &,RRMA0G,%7.T&5L &5%7.T&5 T D###MS3IT#!C is ,N and
RA' do1nsizing B%*T &,RRMA0G,%7.T&5L &5%7.T&5 T RA0MDO3NSI(INGMS3IT#!C
is ,--L
.nitial rate T minimum R?.N.T.A0 RAT*@, ?eApected maAimum bit rate@S
The .N.T.A0 rate is )! * '!BEtra((In"tB"tRateP selected through the %*T -R& ,DM command.
.f the /&&& s1itch B%*T &,RRMA0G,%7.T&5L &5%7.T&5 T D###MS3IT#!C is ,-- and
RA' do1nsizing B%*T &,RRMA0G,%7.T&5L &5%7.T&5 T RA0MDO3NSI(INGMS3IT#!C
is ,--L
.nitial rate T ?eApected maAimum bit rate@
.f RA' do1nsizing B%*T &,RRMA0G,%7.T&5L &5%7.T&5 T
RA0MDO3NSI(INGMS3IT#!C is ,N, first a rate 1ill be selected as above. 5o1ever, if it is
deemed that this rate can not satisf3 the current cell loading, the initial rate 1ill be do1nsized to an
appropriate rate. The minimum rate considered is fiAed at ; 9bitKs. -or more detail refer to section =.
Motorola &onfidential )roprietar3 <3
4)+)+ 'easurements
The /&&& and U* state s1itching algorithms rel3 on a number of different measurements made at the
RN&, Node"' and U*. .n summar3, once a call is established the /&&& algorithm monitors the U0 U*
generated and the /0 RN& generated T:M reports, together 1ith the /0 Node"' generated transmitted
code po1er measurement reports and U* generated %5, 4A event reports to ma9e decisions on
increasing or decreasing the configured bit rate Bassuming all the relevant s1itches are enabledC.
U- monitoring
.f the D###MS3IT#! is enabled the RR& measurement control procedure 1ill be triggered each time
a ne1 Tr&5 is established carr3ing a '* service. The procedure is used configure U* event triggered
=a and =b T:M reports through sending of a RR& M*A%UR*M*NT &,NTR,0 message, the main
parameters of 1hich are B,DM configurable are indicated in italic, bold fontCL
)eriodical Reporting K *vent Trigger Reporting Mode B*vent TriggeredC,
Measurement Report Transfer Mode BE$entMRTrM&%eC,
Measurement T3pe BTraffic :olume MeasurementC,
Measurement Juantit3 BR0& buffer pa3loadC,
T:M event identit3 B=a D =bC,
Reporting Threshold Bcalculated from E$ent+ATh% D E$ent+BTh%C,
Time to trigger BT"met&Tr"##er+A D T"met&Tr"##er+BC,
)ending time after trigger BPen%"n#T"me+A D Pen%"n#T"me+BC,
,nce configured, the U* 1ill send a =a T:M report 1henever the Tr&5 traffic volume Bmeasured
through R0& buffer occupanc3C eAceeds an absolute threshold and a =b T:M report 1henever the
Tr&5 traffic volume becomes smaller than a predefined absolute threshold. The message parameters are
configured for each RA'. Therefore, if the parameters are different for the ne1 RA' indeA after a rate
change, these are signalled to the U* through the sending of a ne1 RR& M*A%UR*M*NT
&,NTR,0 message.
The /&&& does not perform an3 U0 lin9 Jualit3 chec9ing. This is because the U* itself reduces its
o1n rate if it has insufficient po1er to support the current rate. The U*2s MA& is in charge of
performing this control, as specified in T% !$.3!4, b3 placing each T-& in the U0 T-&% into one of
three states Bsupported state, eAcess"po1er state and bloc9ed stateC. A T-& in bloc9ed state 1ill not be
used b3 the U*. 7hen it is in eAcess"po1er state, the T-& ma3 be removed from the valid set to
maintain the 6o% reJuirements. The estimated transmitted po1er reJuirements for the T-& Bas per T%
!$.433C are considered in order to determine the state.
D- monitoring
.f the D###MS3IT#! is enabled the RN& 1ill perform T:Ms for the /0 in the same 1a3 the3 are
performed b3 the U* for the U0 Bnote that /0 T:Ms are not specified in 3G))C. The RN& uses the
Motorola &onfidential )roprietar3 <=
same ,DM configurable thresholds and parameters that are used for the U0. The result is that the RN&
generates the same 9ind of T:M events for the /0 as the U* does for the U0, i.e. =a T:M report 1hen
the /0 Tr&5 Traffic :olume eAceeds an absolute threshold and an event =b T:M report 1henever the
/0 Tr&5 Traffic :olume becomes smaller than a pre"defined absolute threshold.
.f the 0EMRATEMDO3NM0/M!OMS3IT#! and D###MS3IT#! s1itch is enabled the /&&&
1ill trigger a rate decrease to the BeB"tRateTh% rate on reception of a U* generated %5, 4A event
measurement, if the current rate is greater than the BeB"tRateTh% rate. Users 1ith a configured rate
above the BeB"tRateTh% 1ill be in hard handover. %5, measurement reporting and configuring is
covered in the handover control section of this guide, see section =.
.f the RATEMADNM0.MT#&MS3IT#! and D###MS3IT#! s1itch is enabled the /&&&
algorithm 1ill monitor the /0 lin9 Jualit3 for U*s in &*00G/&5 state b3 means of Node"' generated
N'A) Transmitted &ode )o1er measurements. -or each U* 1ith '* services the RN& sets up one
N'A) measurement for Transmitted &ode )o1er B*vent *C for the best R0
=
to determine 1hether the
lin9 Jualit3 has degraded to an unacceptable level Bsee -igure $ "=C. .f this is determined to be the case
Breport *, event A receivedC the U*2s /0 /&5 rate is reduced to the ?/0 full coverage rate@, if the
current rate is higher than this rate. The main parameters in the N'A) /*/.&AT*/
M*A%UR*M*NT .N.T.AT.,N R*6U*%T message areL
&5,.&* /edicated Measurement ,bOect T3peL R0 /edicated Measurement T3pe BTransmitted &ode
)o1erC,
Measurement -ilter &oefficient BTCPMR,"!terC&e(C,
Report &haracteristics B*vent *C,
Measurement Threshold 4 Busing the relative threshold E$entEaTh% and the formulas belo1C,
Measurement Threshold ! Busing the relative threshold E$entETh% and the formulas belo1C
Measurement 53steresis Time B)!H-stT"me,&rEC and
Report )eriodicit3 BTenMsec,&rEC
Threshol$ 1 Max/lTxPo#er 2 E$entE.Th% (S3T /CCC in $-s) 4 P56 (P"!&tP& in S3T 7RC)
Max/lTxPo#er 1 PCPCICHP&/er (A// PCP.C)) 4 MaxCo$ePo#er5ffset (RLMa.)!P/r in S3T
C3((R(P8R)
As part of a /&5 rate change BR' reconfigurationC the minimum and maAimum po1er per code
settings ma3 be changed depending on the values configured for the ne1 RA' indeA, in 1hich case the
measurement trigger thresholds 1ill also be updated and communicated to the Node ' Bi.e. ne1
=
.t is the 4d event that defines 1hich cell is used for code po1er measurements Bit is the best cell,
i.e. the cell 1ith largest value of *cKNo or R%&) reported b3 the U*C. .f the best cell changes
Bindicated b3 reception of a %5, 4/ event reportC the old measurement is terminated and a ne1
one is started on ne1 best cell.
Motorola &onfidential )roprietar3 <$
measurement messages are sent to the Node ' after a reconfigurationC.
-igure $"= Reporting scheme for event * to determine /0 channel conditions for /&&&
4)+)3 'uti1RA0 support
.n U%R3 multipleAing of )% '* R's occurs at the )h3sical la3er rather than at the MA& as 1as the
case in previousl3 releases. T:M measurements are configured for each R' independentl3. .nitiall3
there 1as a proposal to restrict R' reconfiguration based on activit3 across both R'sP ho1ever, this
1as deemed too compleA. Therefore, R' reconfiguration can be triggered off either R'. 5o1ever, after
R' reconfiguration has been triggered a timer 1ill start Bduration configured through %*T /&&&L
Rec&n("#)e!a-T"meC. 7hilst the timer is running T:M reports 1ill be discarded. The motivation is that
there is concern that the reconfiguration of one channel could have an impact on the other, e.g. offered
load and therefore observed traffic volume, and therefore to avoid such influences reconfigurations are
prevented. The minimum value for the timer is zero and therefore this mechanism can be disabled. .t
should be noted that during reconfigurations T:M reports 1ill be Jueued and therefore a second
reconfiguration could be triggered directl3 after the first.
.n the multi"RA' case the *vent * thresholds 1ill be the same and 1ould be modified in eAactl3 the
same 1a3 as 1ould be the case if there 1ere Oust one )% bearer.
RA' combinations supported in U%R3L
4 &%
4 )%
&%
)%
Motorola &onfidential )roprietar3 <<
&% V 4 )%
4 &% V ! )%
4)+)2 Agorit"m $o=
A;aiabe rates
The default is that there are t1o rates available to the /&&& 1hen considering traffic volumeL the
eApected maAimum bit rate and the rate control thresholdL )! * '!)cccRateTh%. 5o1ever, there is also
the possibilit3 to select a three levels mechanism, controlled b3 a s1itch B%*T /&&&L RateA%0Le$e!C.
.n that case, the maAimum rate remains the same, the rate control rate is the minimum rate and the
middle rate is the available rate closest to half the maA rate. The follo1ing description assumes the !"
level adOustment has been selected.
D#! rate c"ange triggers
The follo1ing is a generic eAplanation for the /&&& algorithm processP see -igure $ "$ and -igure $
"< for a summar3 of the /0 and U0 components of the algorithm B1here it is assumed all the algorithm
s1itches are enabledC. Note that 1ith respect to responding to T:M reports the algorithm is applied to
both U0 and /0 in an identical and independent 1a3, so unless other1ise stated the description applies
to both directionsL
D- ony. 7hen a T:M event =b report is received for a particular user Bimpl3ing that the traffic
volume becomes smaller than a threshold for a defined period of timeC the /0 T:M =b monitor
timer is started Bif it hasn2t been alread3C for that user. The length of 1hich is specified b3 the
Y+M&n"T"me2 using the %*T /&&& command. 7hile the timer is running the number of =b
reports is recorded Bincluding the report that triggered the timer to startC. Then 1hen the timer
eApires if the number of recorded /0 =b reports is greater than the monitor time divided b3 the sum
of the =b time to trigger and =b pending time R+M&n"T"me K BT"met&Tr"##er+ V
Pen%"n#T"me+1S a rate reduction to the /0 rate control threshold B)!)cccRateTh%C is triggered.
U- ony. 7hen a T:M event =b report is received for a particular user, a rate reduction to the U0
rate control threshold is triggered if the current rate is greater than this threshold.
Note that if the U* is in compressed mode, there 1ill be no reconfigurations due to T:Ms.
7hen a T:M event =a is received for a particular user Bimpl3ing that the traffic volume eAceeds a
threshold for a defined period of timeC, the rate 1ill be increased to the maAimum rate. 5o1ever,
this rate increase is prevented if the U* is in compressed mode or the event * penalt3 timer
BTc2Pena!t-T"meC has not eApired or Bapplicable to the /0 onl3C the %5, penalt3 timer has not
eApired or Bapplicable to the /0 onl3C if the user is in %5, state. %5, state implies that the user
has more than one legs in their active set and 1hilst in this state the highest /0 rate that the3 can be
configured to is the minimum of the BeB"tRateTh% and the /0 eApected maAimum bit rate.
Note discussions are under1a3 to introduce a lin9 Jualit3 chec9 before rate increase mechanismP
ho1ever, no such mechanism currentl3 eAists in the product.
Motorola &onfidential )roprietar3 <>
.f RA' do1nsizing is enabled, then it is applied to rate increases. That is the RA' do1nsizing function
1ill determine 1hat ne1 rate should be attempted.
.f three rates are selected and RA' do1nsizing is disabled and T:M =a event triggeredL
.f current rate W maAimum bit rate BeApected maAimum bit rateC
Attempt an increase to the maAimum bit rate
.f attempt fails
Attempt an increase to the middle rate Bthere is onl3 one middle rate as defined
aboveC
/or D- onyD
,n reception of a transmitted code po1er *vent * report A B*aC measurement Bindicating that the
lin9 Jualit3 has degradedCL the channel band1idth is reduced to the full coverage rateP and the *a
penalt3 timer is started Bthe timer length is set using the parameterL Tc2Pena!t-T"me in the %*T
/&&& commandC. 7hilst the timer is running the /&&& is prevented from ma9ing rate increases.
This is intended to avoid possible ?ping"pong@ bet1een rates as a result of successive traffic and
code po1er measurement reports. Note that code po1er measurements are onl3 processed b3 the
/&&& if the RATEMADNM0.MD-MT#&MS3IT#! is enabled.
,n reception of a %5, 4A event report Bindicating that the user has entered a %5, regionCL the /0
channel band1idth is reduced to the 'e'itRateThd rateP leg addition 1ill be attempted at this point
andP the %5, 4A penalt3 timer is started Bthe timer length is set using the parameterL
Tc2Pena!t-T"me in the %*T /&&& commandC. The rate reduction is intended to ensure lin9
stabilit3 1hilst in the handover region, as it had been found that the rate reduction through an *a
report 1as not triggered earl3 enough to prevent lin9 failure in such circumstances. 7hilst the timer
is running the /&&& is prevented from ma9ing rate increases. Note that %5, 4A events are onl3
processed b3 the /&&& if the 0EMRATEMDO3NM0/M!OMS3IT#! is enabled.
The *a and %5, 4A penalt3 timers run independentl3 and therefore can both be running
simultaneousl3.
Interaction =it" -##
.f ?basic congestion@ is detected, the 0&& algorithm signals this to the /&&& algorithm and rate
increases are prevented Bsee 0&& section for more information of ho1 congestion is handledC.
The 0&& 0ERATERED BRA A// &*000/RL /00/R%*&,N/A&T.,NT'*RAT*R*/C method
is disabled unless the D###MS3IT#! is enabled.
&re;ention o$ repeated recon$iguration attempts
The /&&& is prevented from ma9ing repeated rate increase attempts if the reconfigurations 9eep failing
due to lo1er la3er errors. .t appears the cause of the reconfiguration failures is the .ub band1idth
limitation. %pecificall3 the mechanism is such that if a certain number B,a"!T"meThC of rate increase
reconfigurations fail 1ithin a defined period BM&n"T"meLenC a penalt3 time is started. 7hilst the
penalt3 timer is running rate increase attempts b3 the /&&& are prevented. The time duration is set b3
Motorola &onfidential )roprietar3 <;
the parameter )ccc'2Pena!t-Len. The three relevant parameters are set using the %*T /&&&
command.

=aL .- Brate control W full covC
and T&) penalt3 timer running

*aL .- Brate control Q full covC

ReJuested
BmaAimumC rate
/0 rate control
threshold
/0 full coverage
rate
*a =a
=a
=b over
monitor
time
=b over monitor
timeL .- Brate
control W full covC
BeB"tRateTh%
=a
%5, 4A
%5, 4AL
.- B'e'itRateThd
W full covC
*aL .- Bfull cov W
BeB"tRateTh%C

=b over monitor timeL
.- Brate control W rate controlC
%5, 4AL
.- B'e'itRateThd W full covC
-igure $"$ /0 /&&& algorithm rate transition diagram
Note t"at t"is data rate transition diagram does not incude t"e restrictions appied to rate increases) In
t"e $igure it is assumed t"at t"e D- $u co;erage rate is smaer t"an t"e D- reOuested rate) T"e bo>es
=it" a das"ed arro= to t"e transition pat" indicate t"e trigger conditions $or t"at transition) T"e ;aue
seected $or t"e D- initia rate 7SET /R#D D-0ETRA//INIT0ITRATE8 =i dictate at ="ic" rate t"is
diagram =i be entered)
Motorola &onfidential )roprietar3 <+

ReJuested
BmaAimumC rate
U0 rate control
threshold
=a =b
-igure $"< U0 /&&& algorithm rate transition diagram
Note t"at in t"e $igure abo;e it is assumed t"at t"e U- $u co;erage rate is smaer t"an t"e U- reOuested
rate) T"e ;aue seected $or t"e U- initia rate 7SET /R#D U-0ETRA//INIT0ITRATE8 =i dictate at
="ic" rate t"is diagram =i be entered)
4)+)4 Iub #ongestion #ontro
The .ub congestion mechanism reduces the band1idth allocated to a subset of '* users in order to
increase the available .ub band1idth for ne1 admissions 1hen .ub congestion is detected. This
mechanism can be enabled or disabled through the IuC&n#Ctr!S/"tch parameter in the A//
N,/*'&,NG&TR0 0MT command and is described in more detail belo1.
At the RN& there is a transport la3er module that monitors the amount of .ub band1idth reserved
Brather than 1hat is actuall3 utilisedC. 7hen the .ub band1idth eAceeds a predefined threshold
BC&n#estCth%, set through the &,NG*%T&T5/ 0MT commandC, this module signals to the /&&&
that congestion has been detected on the .ub. The module also signals 1hen congestion has passed, but
based on a separate threshold BC&n#estRth%, set through the &,NG*%T&T5/ 0MT commandC. The
signals indicate the congestion status on either the U0 or /0 or in both directions. ,n receiving the .ub
congestion indication signal the /&&& 1ill reduce the U0 and /0 rate of the N best effort users 1ith
the highest combined U0 and /0 rate, i.e. ta9ing the sum of the U0 V /0 configured rate, to the U0 and
/0 rate control threshold, 1here N is the number configured b3 the parameter ?IuC#stCtr!Num@. .f
there is congestion in one direction onl3 the /&&& 1ill reduce the rate of the N highest rate users in
that direction onl3. .n addition, on receiving the congestion signal the .ub congestion control timer
BIuC&n#Ctrr!T"merLenC and the congestion control restore timer BIuC&n#Ctr!Rest&reT"meC is
started Bthe latter of the t1o, onl3 if the D###MS3IT#! is not enabledC.
.f the .ub congestion control timer eApires, but .ub congestion has not passed Bi.e. the .ub congestion
passed signal has not been receivedC, the .ub congestion control timer 1ill be restarted and the N '*
users 1ith the neAt highest configured rates 1ill have their rates reduced to the rate control threshold.
Again 1hether both U0 and /0 rate are reduced depends on in 1hich direction congestion is being
eAperienced.
Motorola &onfidential )roprietar3 >
.f the /&&& algorithm is not activated, once the ?.ub congestion control restore timer@ eApires the
/&&& 1ill restore the rate of the best effort users penalised during .ub congestion, unless the .ub
congestion status is not cleared, or if the .ub congestion 1ill occur again after restoring this '* rate
Bpredicted b3 a transport la3er moduleC, in 1hich case the ?.ub congestion control restore timer@ 1ill be
restarted. 5o1ever, if the /&&& algorithm is activated, rate increases after the ?.ub congestion control
timer@ 1ill be triggered in the usual manner through =a T:M report arrivals.
4)3 RR# state s=itc"ing agorit"m
This subsection describes the algorithm used b3 RN& to perform RR& states s1itches. -or this
algorithm to be operative for )% '* services the &SM0EMSTATEMTRANSMS3IT#! must be enabled
and for )% non '* services the &SMNONM0EMSTATEMTRANSMS3IT#! must be enabled.
It "s n&t c!ear /hether &r n&t RRC state s/"tch"n# (&r PS n&n BE ser$"ces "s (unct"&na! "n the
"n"t"a! 3145 re!ease, a!th&u#h the s/"tch "s "m2!emente%4 It ha% een assume% that the same t"mers
/&u!% e use% (&r &th cases, e4#4 )t&,StateTransT"mer4
The relevant parameters are set using the %*T /&&& command.
.t should be noted that at least t1o -A&5 Tr&5s should be configuredL one for %R's and one for R's.
This is because the R0& bloc9 size is generall3 different for %R's and R's and therefore unless there
are t1o -A&5 configurations a R0& reset BreJuired to modif3 the R0& bloc9 sizeC 1ould be triggered
for either the %R' or R' on performing a RR& state change from &*00G/&5 to &*00G-A&5.
4)3)% #E--MD#! P #E--M/A#!
7hen a U* is in &*00G/&5 RR& state and the RN& receives an *vent =b T:M report, the RN&
starts a timer defined b3 )t&,StateTransT"mer. -or )% non '* services this is from the configured
rate, but for )% '* services the configured rate must be the minimum rate, i.e. the rate control threshold
unless the reJuested rate is lo1er than that. 'efore this timer eApires, if the number of continuous T:M
reports eAceeds a certain value, then the RN& triggers a U* RR& state change from &*00G/&5 to
&*00G-A&5 using a R' Reconfiguration procedure so long as the trigger condition is met in both the
U0 and /0 directions and the U* has no other active bearers Bnote there is no admission control in the
move from &*00G/&5 to &*00G-A&5C. The number of reports that need to be received is calculated
according to )t&,StateTransT"mer K BPen%"n#T"me+ V Tr"##erT"me+C of the current rate,
multiplied b3 StateTrans5er&Tra((Re%un%C&e( B1hich ta9es a value from to 4C. The reason to appl3
this coefficient is to account for the potential loss of T:M reports Bsince R0& AM is used, this is most
li9el3 due to dela3 rather than lost reportsC. The R0& parameters used in &*00G-A&5 are those that
are defined for the ; 9bitKs bearer, the values are made available to the U* via R' reconfiguration
message. Tr&5 parameters are made available to the U* via the '&5 s3stem information element. The
arrival of a T:M =a report resets the timer. Ne1 =a and =b measurement control messages are sent
1hen moving from &*00G/&5 to &*00G-A&5 and 1hen moving from &*00G-A&5 to
&*00G/&5.
Motorola &onfidential )roprietar3 >4
.f a s1itch from &*00G/&5 to &*00G-A&5 occurs and the U* is in %5,, then the U* is reJuested
to camp on the ?'est &ell@ in %RN& 1hen it moves to &*00G-A&5 Bi.e. if best cell is under /RN&,
the U* 1ill be reJuested to camp on the best cell that is under the %RN&C. The current understanding is
that this has been modified, such that the best cell is no1 selected regardless of 1hether the best cell in
under the /RN& or %RN&. 5o1ever, this is 3et to be confirmed b3 Motorola.
The transition from &*00G-A&5 to &*00G/&5 is triggered b3 the arrival of a =a T:M report.
'efore triggering the transition RA' do1nsizing 1ill be called Bif enabledC for the direction BU0 or /0C
that triggered the attempted transition to select the /&5 rateP in the opposite direction the rate control
threshold 1ill be selected for the /&5 rate. 7ithout RA' do1nsizing the rate control threshold 1ill be
attempted in both directions. .n either case then the &A& is consultedP if &A& refuses to admit the call
the user 1ill remain in &*00G-A&5. The R0& parameters that 1ill be used on the /&5 after
reconfiguration 1ill be the same as those specified for that /&5 rate 1ithin the RA'"R' mapping
algorithm.
The same mechanism is applied to users mapped to an 5%"/%&5P i.e. &*00G/&5 to &*00G-A&5
transitions and vice versa are triggered based on traffic volume. Refer to the RA' to R' mapping
section for the mechanism that decides 1hether the 5%"/%&5 or a /&5 1ill be assigned.
4)3)+ #E--M/A#! P #E--M&#!
The transition from &*00G-A&5 to &*00G)&5 is the same as the transition from &*00G/&5 to
&*00G-A&5 eAcept the ,t&PStateTransT"mer is used instead of the )t&,StateTransT"mer. The
transition is achieved through R' Reconfiguration Bthere is no need to 1ait for a &ell Update and use
the &ell Update &onfirm to do the transition as 1as the case in U%R4C.
The transition from &*00G)&5 to &*00G-A&5 can occur for a number of reason, e.g. U* needs to
send a &ell Update or has data to transmit, or in response to a paging.
4)3)3 #E--M&#! Q URAM&#!
7hen the U* is in &*00G)&5, if the number of cell reselections over a period of time
BCe!!ReSe!ectT"merC is greater than Ce!!ReSe!ectC&unter, the U* 1ill be s1itched to URAG)&5.
Note that the U* does not perform traffic volume measurements 1hile in &*00G)&5 or URAG)&5.
The U* is moved bac9 to &*00G-A&5 for a number of reasons including if traffic is received 1hile in
URAG)&5 state Bi.e. same reasons as &*00G)&5 caseC.
4)3)2 Reations"ip =it" @&S Inacti;ity TimerA agorit"m
The algorithm is the same as it 1as in :4.!L see command A// )%.NA&TT.M*R.
.n summar3 traffic volume is monitored at the )/&) la3er, 1hen no data has been observed in a time
period interval defined b3 the )% inactivit3 timer the )/&) la3er 1ould reJuest the RR& la3er to
release this Radio Access 'earer and hence the user 1ould enter idle state.
Motorola &onfidential )roprietar3 >!
4)2 Jey &er$ormance Indicators
J&I Name Description
'ser 6)CCC C&%e7
't"!"8at"&n ,act&r
-or a particular code rate that the /&&& selects to support a
service, the ?&ode Utilization -actor@ is an average measure of the
proportion of time B_ of the duration of the testKcallC that the /&&&
holdsKmaintains a particular code.
'ser 6)CCC C&%e7
L&a%"n# ,act&r
-or a particular code rate that the /&&& selects to support a
service, the ?&ode 0oading -actor@ is an average measure Bacross
the duration of the testKcallC of ho1 heavil3 loaded Befficientl3C a
particular code rate is. At an3 instant the loading of a given code rate
is defined as the ratio of the number of transport bloc9s for the
active transport format to the number of transport bloc9s for the
maAimum rate transport format BmaAimum for the particular code
rateC.
'ser 6)CCC C&%e7
Thr&u#h2ut 9transm"t
s"%e1
5ere ?throughput@ is defined as the average transmit data rate
Bincluding ?bad@ bloc9sC achieved across the duration of the testKcall.
This measure computes the average over time of the instantaneous
code B/&&& selectedC and transport format BMA& selectedC specific
transmitted data rate. 7hilst throughput can be defined at either the
receiver Bsometime referred to as goodputC or the transmitter, in this
conteAt the transmit side has been selected to give a fairer estimate
of generated interference levels regardless of '0*R.
Table $"43L /&&& Ee3 )erformance .ndicators
4)2)% E>pected J&I Vaue
J&I E>pected ;aue #omments
'ser 6)CCC C&%e7
't"!"sat"&n ,act&r
T'/
'ser 6)CCC C&%e7
L&a%"n# ,act&r
T'/
'ser 6)CCC C&%e7
Thr&u#h2ut
9transm"t s"%e1
T'/
Table $"4=L /&&& E). *Apected :alues
Motorola &onfidential )roprietar3 >3
6 Inter1RAT !ando;er 7Ser;ice1 and -oad10ased8
.nter"RAT service"based handover B.RAT"%'C and inter"RAT load"based handover B.RAT"0'C are ne1
features introduced in U%R3 to enable service sharing bet1een 3G and !G and more fleAibilit3 in the
3G cell load management respectivel3. The3 are eAtension of the inter"RAT coverage"based handover.
The operation of these t1o algorithms consists of the follo1ing four stepsL
4. Trigger condition
!. U*s and their G%M neighbor cells Jualification
3. .nter"RAT measurements and target cell selection
=. 5andover eAecution
Note that if .RAT"%' is a connection"oriented algorithm and is part of the 6o% management, .RAT"0'
is not . .nstead .RAT"0' is a cell"oriented algorithm used to manage the load on the air interface in a
particular cell. 5o1ever both algorithms are described here due to their similarities in their operation, if
not in their triggering. .RAT"0' is a component of the load reduction algorithm Bsee section !4.4.4.3.4C.
6)% Trigger condition
The .nter"RAT service based handover algorithm is used to move U*s in the &ell"/&5 state from
UMT% to G%M based on service handover information element set b3 &N in their RA' assignment
reJuest or relocation reJuest messages. .t operates on both &% and )% domain U*s 1ith a single RA'
Bon /&5C and commences its operation for a particular U* follo1ing RA' A%%.GNM*NT
&,M)0*T* or R*0,&AT.,N &,M)0*T* even 1hen there is no trigger due to coverage or load.
The .RAT"%'"&% Bcircuit"s1itchedC and .RAT"%'")% Bpac9et"s1itchedC features can be s1itched on or
off independentl3 through their respective cell"level database parameters.
The .nter"RAT load based handover algorithm is used to move U*s in the &ell"/&5 state from UMT%
to G%M based on cell load eAceeding an 0MT settable threshold. The .RAT"0' is not an independent
feature, it is used as one of the mechanisms in the 0/R component of 0oad &ongestion &ontrol
algorithm to relieve congestion in both do1nlin9 and uplin9 independentl3. The .RAT"0'"&% Bcircuit"
s1itchedC and .RAT"0'")% Bpac9et"s1itchedC can be independentl3 activated through an action Jueue
as part of the 0/R setting. The 0/R itself can be s1itched ?,N@ or ?,--@ through its respective cell"
level database parameter. .f 0/R is disabled for a cell, neither .RAT"0'"&% nor .RAT"0'")% 1ill be
called for that cell. 0/R provides a list of U*s that are Jualified to be considered in either of these t1o
algorithms based on 0/R calculation. The U*s lists are .RAT"0'"0%T"&% and .RAT"0'"0%T")%.
,nce a U* is selected, the .nter"RAT handover operation ta9es place as part of the .RAT"0' and does
not provide an3 feedbac9 to 0/R.
The .nter"RAT load based or service based handover is onl3 triggered 1hen the ?%ervice handover@ .*
Motorola &onfidential )roprietar3 >=
contained in the RANA) message ?RA' A%%.GNM*NT R*6U*%T@ or ?R*0,&AT.,N R*6U*%T@
is present and is set to ?5andover to G%M should be performed@. .f the ?%ervice handover@ .* is not
present in the messages, the RN& configurable ?service handover@ parameter Bconfigured in the RA'"
!G'earer mapping tableC 1ill be used is the same fashion instead.
6)+ UEs and t"eir GS' neig"bour ces Ouai$ication
The decision of 1hether the U*2s RA' can be supported in !G or not is based on the U*s and their
G%M neighbor cell Jualification using the relevant .*s in the U* &A)A'.0.T( .N-,RMAT.,N
message, the information elements contained in &lassmar9 3 BU* .nter"RAT capabilit3C, RA'"!G'earer
mapping table, and the G%M neighbor cells capabilities. The last t1o are 0MT configurable
parameters.
The details of U* .nter"RAT capabilit3 are described belo1L
G%M U*L The G%M capabilit3 is obtained through the ?U* &A)A'.0.T( .N-,RMAT.,N@
message using the follo1ing `3aL WU* Radio Access &apabilit3Q "Q WU* multi"modeKmulti"
RAT capabilit3Q "Q %upport of G%M .*.
G)R%K*/G* U*L The G)R%K*/G* capabilit3 is obtained through &lassmar9 3 .* BU* .nter"
RAT &apabilit3C, This is contained in ?U* &A)A'.0.T( .N-,RMAT.,N@ message or the
?RR& &,NN*&T.,N %*TU) &,M)0*T*@ message. The information associated 1ith
&lassmar9 3 is described in 3G)) !$.334 and 3G)) $.!. The follo1ing fields are considered
to determine the )ac9et capabilit3L G)R% or */G*L
o BaC 5%&%/ Multi %lot .*
o BbC W*&%/ %tructureQ /0KU0 Modulation capabilit3
The above .*s are Oointl3 considered to determine )ac9et &apabilit3L G)R% or */G* as
follo1sL
o .f both BaC and BbC are N,T presentL No )% capabilit3, i.e. G%M &apable.
o .f BaC is present and BbC is N,T presentL )%KG)R% capable
o .f both BaC and BbC are presentL )%K*/G* capable.
RA'"!G'earer mapping table is used to determine if the RA' can be supported in !G and 1hat
capabilit3 is reJuired from the G%M neighbor cells. The RA'"!G'earer mapping table is an RN&
oriented configurable parameter using the 0MT command ?A// T()RA''A%.&@. .t contains the
configurable parametersL %ervice T3pe, MaA rate B4"4<bitKsC, RN& specific %ervice handover,
!G &apabilit3 needed BG%MKG)R%K*/G*KnoneC.
?RN& specific %ervice handover@ is a RN& specific configurable parameter 1hich differs from that sent
b3 &N. This parameter is used in the same 1a3 as &N ?%ervice 5andover@ .*, it can be set to the
follo1ing valuesL 5andover to G%M shall not be performedP 5andover to G%M should not be performed
Motorola &onfidential )roprietar3 >$
and 5andover to G%M should be performed.
G%M neighbor cell capabilit3 is a cell oriented configurable parameter b3 using the 0MT command
?A// G%M&*00@, it can be set to */G*, G)R%, G%M or no capabilit3.
'ased on the above parameters, it is determined if a U* is Jualified to go to the neAt step B.nter"RAT
measurementsC as sho1n in the follo1ing table B6L 6ualified, N6L Not 6ualifiedC. The candidate G%M
neighbor cells are also identified. There is no filtering of the G%M neighbor cells identified at this stage.
Also, it should be noted there is distinction bet1een + and 4; M5z band 1hen it comes to setting
up G%M neighbor cells and as such no consideration is given here to the .nter"RAT band supported b3
the U* under consideration.
@RA01 +G0earer
'apping output
GS' neig"bour
ces #apabiity
EDGE G&RS GS'
RA0 Not
Supported
One or more EDGE 6 6 6 N6
G&RS N6 6 6 N6
GS' N6 N6 6 N6
None N6 N6 N6 N6
Table <"4$L U* 6ualification based on RA'"!G'earer and G%M neighbour cells capabilities
6)3 Inter1RAT measurements and target ce seection
-or a U* Jualified for handover, the inter"RAT measurement is invo9ed b3 sending a
?M*A%UR*M*NT &,NTR,0@ message containing .nter"RAT measurement information. U%R3
supports event 3A B.nter"RAT coverage based handoverC and event 3& B.nter"RAT load based and
service based handoverC t3pes specified in 3G)) !$.334. The events that trigger the reporting of an
.nter"RAT measurement are described in the follo1ing table.
*vent Name *vent /escription Associated )arameters
*vent 3c The estimated Jualit3 of other s3stem is
above a certain threshold
53steresis :alue
Time"to"trigger
-ilter coefficient
'%.& verification
Table <"4<L .nter"RAT *vent 3c
/uring inter"RAT periodic measurement reporting, the RN& receives Jualit3 estimates of all !G cells in
the monitored set 1ithin the M*A%UR*M*NT R*),RT message. The Jualit3 measure used is the !G
Motorola &onfidential )roprietar3 ><
cells carrier R%%. and, in addition, the U* also performs '%.& identification and '%.& reconfirmation.
Then, if the !G cells carrier R%%. is greater than certain threshold Bincluding h3steresisC and the time to
trigger eApires, inter"RAT hard handover is performed. The target !G cell should be the best"ran9ed
1hose '%.& has been identified and reconfirmed. 5o1ever, if there are no cells 1ith '%.& identified,
the cell 1ith the best R%%. value is chosen Bactuall3 there are different handover criteria for '%.&
verified and non"verified, see belo1C. Note that '%.& reconfirmation is not currentl3 used in the
handover metric.
&onfiguration of the !G cells carrier R%%. thresholds Bspecified for &% and )% independentl3C,
h3steresis value, time to trigger dela3 and '%.& verification are achieved through the attributes
InterRAT_RSSI_Th%_CS, InterRAT_RSSI_Th%_PS, H-stTh%_:c, T"meT&Tr"#_:c an%
BSIC3ERI,; respectivel3, 1ith the A// &*00.NT*RRAT5,N&,: command on a per cell basis.
A cell enters the candidate list for handover 1hen the R%%. Bplus cell individual offsetC is greater
than InterRAT_RSSI_Th%_CS 9&r InterRAT_RSSI_Th%_PS 1 V H-stTh%_:c*< at least during a
period of T"meT&Tr"#_:c 1ith BSIC3ERI,; Bfor G%M cells reported 1ith '%.& verified or non"
verifiedC.
5andover is eAecuted to the first G%M cell that fulfils the criteria above, and if there is more than
one cell in the candidate list, the one 1ith strongest R%%. is chosen.
A cell eAits the candidate list for handover 1hen the R%%. Bplus cell individual offsetC is less than
InterRAT_RSSI_Th%_CS 9&r InterRAT_RSSI_Th%_PS 1 N H-stTh%_:c*< an3 time. .t must re"
satisf3 the above conditions to re"enter the candidate list.
.f a handover to a G%M cell fails for 1hatever reason, the RN& 1ill not initiate a handover to that
G%M cell for that U* for a period of HO=Pena!t-=T"me.
Notes
.f there is a best cell change during %tep 3, for .nter"RAT service based handover, there 1ill be a
measurement control update 1hich includes update of event measurement parameters and update of
G%M neighbour cells. .f the best cell is in %RN&, algorithm parameter configuration and G%M
neighbour cell list in the database of that cell are used. .f the best cell is in /RN&, RN& oriented
parameter configuration is used for algorithm parameter, and neighbour cell list information returned b3
.ur interface is used as neighbour cell list.
.f there is a best cell change during %tep 3, for .nter"RAT load based handover, the .nter"RAT handover
for that U* is terminated, discard this U* from the Jualified list, and this is follo1ed b3 attempting to
select a ne1 U* from the Jualified list b3 going bac9 to step !. The .nter"RAT load based handover 1ill
attempt to handover all the U*s in Jualified list.
RN& shall support a trace timer 1hich is an 0MT configurable parameter InterRATMeasT"me to limit
the period of inter"RAT measurement. The trace timer is used per U* to specif3 the maAimum time
allo1ed bet1een measurement control messages sent to the U* and the successful handover identified.
.f this timer eApires during the above t1o events, the .nter"RAT load based and service based handover
1ill be terminated for that U*. The trace timer is restarted after successful best cell update and the timer
Motorola &onfidential )roprietar3 >>
length of the ne1 best cell is used to set the timer.
6)2 !ando;er E>ecution
*Aecution of inter"RAT handover mainl3 consists of .u interface relocation procedure, selection of air
interface handover signalling according to 1hether U* is in &% or )% domain and setting up timers in
case of handover failures.
-or .nter"RAT 0' &% domain and %' &% domain handover, .u interface starts ?R*0,&AT.,N
R*6U.R*/@ procedure. .f ?R*0,&AT.,N &,MMAN/@ is received, the relocation procedure is
successful and Uu procedure starts. Then the ?5AN/,:*R -R,M UTRAN &,MMAN/@ message
is sent to U*, and the RELOCI'RELCM)TMR timer is started. .f the timer is eApired or ?.u
R*0*A%* &,MMAN/@ message is received b3 RN&, the handover procedure is successful.
-or .nter"RAT 0' )% domain and %' )% domain handover, .u interface starts ?R*0,&AT.,N
R*6U.R*/@ procedure. .f ?R*0,&AT.,N &,MMAN/@ is received, the relocation procedure is
successful and Uu procedure starts. Then the ?&*00 &5ANG* ,R/*R -R,M UTRAN@ message is
sent to U*, and the RELOCI'RELCM)TMR timer is started. .f the timer is eApired or ?.u R*0*A%*
&,MMAN/@ message is received b3 RN&, the handover procedure is successful.
.f ?R*0,&AT.,N )R*)ARAT.,N -A.0UR*@ message from the &N or ?5AN/,:*R -R,M
UTRAN -A.0UR*@ or ?&*00 &5ANG* ,R/*R -R,M UTRAN -A.0UR*@ from U* is received
during the handover process, the inter"RAT handover 1ill be considered as failed. Upon an3 of the
above failures, the number of handover attempts is chec9ed and if it is larger than
Inter_RAT_HO_Attem2ts the inter"RAT handover of this U* 1ill be barred b3 RN&, and the
corresponding inter"RAT measurement 1ill be stoppedP if it is smaller than Inter_RAT_HO_Attem2ts,
the penalt3 timer HO_Pena!t-_t"me is set to bar further handover attempts to the failed cell from the
U* during this time period. This is follo1ed b3 attempting to handover to another cell selected b3 going
bac9 to step 3.
.t should be noted that if Ttrace timer eApires at an3 time during the handover eAecution process, the
.nter"RAT handover is terminated for that U* and that U* 1ill not be further considered for .nter"RAT
handover.
6)4 Dependencies
o /ependenc3 bet1een .nter"RAT 0', .nter"RAT %' and RA'"to"R' mapping algorithm
o There is no interaction 1ith RA'"to"R' mapping other than the additional configurable
parametersP %ervice 5, and !G capabilit3 needed, added as part of the RA'"to"R'
configurable parameters b3 using the 0MT command of ?A// T()RA''A%.&@, it is a
specific and implicit command, it means the 0MT s3stem don2t eApect these parameters can
be modified unreasonable.
Motorola &onfidential )roprietar3 >;
/ependenc3 bet1een .nter"RAT 0' handover algorithm and 0/RB0oad ReductionC algorithm
o .nter"RAT load based handover algorithm has the interaction 1ith 0/R algorithms.
'ecause .RAT"0'"&% and .RAT"0'")% algorithms are t1o actions of the five mechanisms
in 0/R algorithm used to relieve congestion in do1nlin9 and uplin9 configured
independentl3. These t1o algorithms are activated through 0/R action Jueue. 0/R
provides a list of U* that are Jualified to be considered in either of these t1o algorithms
based on 0/R calculation. The U*s lists are 0'"0%T"&% and 0'"0%T")%. ,nce a U* is
selected, the .nter"RAT handover operation ta9es place as part of the .RAT"0' and does not
provide an3 feedbac9 to 0/R.
6)6 Database parameters
The commands for configuration of the parameters involved the .nter"RAT load based and service based
5, algorithm are follo1ing. The related database parameters are documented in a separate spreadsheet,
the ?Reference )arameters %preadsheet@.
-'T #ommand Description
%*T .NT*RRAT5,N&,: %et RN& ,riented None"&overage based .nter"rat 5andover
Measurement Algorithm )arameters
A// &*00.NT*RRAT5,N&,: Add &ell ,riented None"&overage based .nter"rat 5andover
Measurement Algorithm )arameters
M,/ &*00.NT*RRAT5,N&,: Modif3 &ell ,riented None"&overage based .nter"rat
5andover Measurement Algorithm )arameters
RM: &*00.NT*RRAT5,N&,: Remove &ell ,riented None"&overage based .nter"rat
5andover Measurement Algorithm )arameters
A// &*005,&,MM Add &ell ,riented 5andover &ommon Algorithm )arameters
A// G%M&*00 Add G%M &ell
A// T()RA''A%.& Add basic parameters related RA' t3pes.
A// &*000/R Add &ell 0/R Algorithm )arameters
%*T %TAT*T.M*R %et &alling )rocess %tate )rotection Timers
Table <"4>L .nter"RAT /atabase )arameters
J&I Description
.nter"RAT 55, RR& %ignalling 0oad *stimation of signalling load BRR& messagesC reJuired to
support the inter"RAT hard handover algorithm, and so
the processing load associated and bac9haul
Motorola &onfidential )roprietar3 >+
reJuirements. This is measured in number of Meas Rpt V
)h3 &hann Reconfig messages per call BandKor per secC.
,ther possibilit3 is to eApress this in 9bitKs.
AMR 6ualit3 during .nter"RAT 55, M,% BMean ,pinion %coreC during inter"RAT hard
handover eAecution for AMR services
.nter"RAT 0oad 'ased 5, Rate Average number of incomingKoutgoing .nter"RAT 0oad
'ased 5andovers completed per unit time.
.nter"RAT load 'ased 5, failure Rate )ercentage of attempts failed 1hen the s3stem is
implementing the .nter"RAT 0oad 'ased handover.
.nter"RAT %ervice 'ased 5, Rate Average number of incomingKoutgoing .nter"RAT %ervice
'ased 5andovers completed per unit time.
.nter"RAT %ervice 'ased 5, failure Rate )ercentage of attempts failed 1hen the s3stem is
implementing the .nter"RAT %ervice 'ased handover.
.nter"RAT 55, dela3 Average time reJuired to complete an inter"RAT 55,
procedure, from the MR triggered is received until the
5, -R,M UTRAN &,MMAN/ message is sent to the
U*
:%..RAT5,.0oad.Att,ut)%UTRAN The counter, upon transmission of a RR&"message,
&*00 &5ANG* ,R/*R -R,M UTRAN, from source
RN& to the U*, indicate a attempted outgoing )ac9et
%1itched inter"RAT handover due to the .nter"RAT load
based 5, mechanism, on a per &*00 basis in -//
mode.
:%..RAT5,.0oad.AttReloc)rep,ut&% The counter, upon transmission of a RANA) message
R*0,&AT.,N R*6U.R*/ from the serving RN& to
the &N, indicate an attempted relocation preparation of
an outgoing inter"RAT handover due to the .nter"RAT
load based 5, mechanism, on a per cell basis in -//
mode.
:%..RAT5,.0oad.%uccReloc)rep,ut&% The counter, upon receipt of a RANA) message
R*0,&AT.,N &,MMAN/ sent from the &N to the
serving RN&, indicate a successful relocation preparation
of an inter"RAT handover due to the .nter"RAT load
based 5, mechanism on a per cell basis in -// mode.
:%..RAT5,.0oad.%ucc,ut)%UTRAN The counter, upon transmission of a RANA) message, .u
R*0*A%* &,MMAN/, from the )% &N to the source
RN&, indicate a successful outgoing )ac9et %1itched
inter"RAT handover due to the .nter"RAT load based 5,
mechanism, on a per &*00 basis in -// mode.
:%..RAT5,.0oad.%ucc,ut&% The counter, upon receipt of a RANA) message .u
R*0*A%* &,MMAN/ sent from the &N to the serving
RN&, indicate a successful inter"RAT handover due to
the .nter"RAT load based 5, mechanism, on a per cell
basis in -// mode.
:%..RAT5,.%ervice.Att,ut)%UTRAN The counter, upon transmission of a RR&"message,
&*00 &5ANG* ,R/*R -R,M UTRAN, from source
RN& to the U*, indicate a attempted outgoing )ac9et
%1itched inter"RAT handover due to the .nter"RAT
service based 5, mechanism, on a per &*00 basis in
-// mode.
:%..RAT5,.%ervice.AttReloc)rep,ut&% The counter, upon transmission of a RANA) message
R*0,&AT.,N R*6U.R*/ from the serving RN& to
the &N, indicate an attempted relocation preparation of
an outgoing inter"RAT handover due to the .nter"RAT
service based 5, mechanism, on a per cell basis in -//
mode.
Motorola &onfidential )roprietar3 ;
:%..RAT5,.%ervice.%uccReloc)rep,ut&% The counter, upon receipt of a RANA) message
R*0,&AT.,N &,MMAN/ sent from the &N to the
serving RN&, indicate a successful relocation preparation
of an inter"RAT handover due to the .nter"RAT service
based 5, mechanism on a per cell basis in -// mode.
:%..RAT5,.%ervice.%ucc,ut)%UTRAN The counter, upon transmission of a RANA) message, .u
R*0*A%* &,MMAN/, from the )% &N to the source
RN&, indicate a successful outgoing )ac9et %1itched
inter"RAT handover due to the .nter"RATservice based
5, mechanism, on a per &*00 basis in -// mode.
:%..RAT5,.%ervice.%ucc,ut&% The counter, upon receipt of a RANA) message .u
R*0*A%* &,MMAN/ sent from the &N to the serving
RN&, indicate a successful inter"RAT handover due to
the .nter"RAT service based 5, mechanism, on a per cell
basis in -// mode.
Table <"4;L .nter"RAT E).s
6)* Optimization guideines
6)*)% &arameters and recommendation
The parameters are documented in a separate spreadsheet, the ?Reference )arameters %preadsheet@.
<.;.4.4 E>pected J&I ;aues
.nter"RAT 55, RR& %ignalling 0oad T'/
AMR 6ualit3 during .nter"RAT 55, -ield test
.nter"RAT 0oad 'ased 5, Rate \3_
.nter"RAT 0oad 'ased 5, failure Rate \ =_
Bsee the related reJuirements from %3stem TR/
0evel 4 module C
.nter"RAT %ervice 'ased 5, Rate \3_
.nter"RAT %ervice 'ased 5, failure Rate \ =_
0evel 4 module C
.nter"RAT 55, dela3 &% /omainL \4<;;ms
)% /omainL \44>;ms
0evel 4 moduleC
Table <"4+L .nter"RAT *Apected E). :alues
According the reJuirement of ?%3stem TR/ 0evel 4@ module, the .nter"RAT 55, dela3 is defined as
follo1sL
Motorola &onfidential )roprietar3 ;4
%(%"=+$L The UMT% s3stem mean signalling dela3 associated 1ith an outgoing .nter"RAT 55,
B3G Q !GC shall be `4<;;a milliseconds. The dela3 is measured from transmission of RANA)
URelocation ReJuiredU message, b3 the %RN& Bto 3G M%&C, to the reception of '%%MA)
U5andover &ompleteU message b3 the !G M%&. N,T*L The message seJuence diagram is also
depicted in TR!$.+34 v$.4. B!!"<C " -ig.3<.
%(%"=+3L The UMT% s3stem mean signalling dela3 associated 1ith an outgoing .nter"RAT &ell
&hange B3G Q !.$GC shall be `44>;a milliseconds. The dela3 is measured from transmission of RR&
U&ell &hange ,rder -rom UTRANU message, b3 the %RN& Bto U*C, to the reception of RANA)
U.u Release &ommandU message b3 the %RN&.
%(%"=$4!L The UMT% %3stem &all /rop Rate for AMR 4!.!E voice calls using 3G to !G
handover shall be less than or eJual to =_.
:%..RAT5,.0oad.Att,ut)%UTRAN -ield Test
:%..RAT5,.0oad.AttReloc)rep,ut&% -ield Test
:%..RAT5,.0oad.%uccReloc)rep,ut&% -ield Test
:%..RAT5,.0oad.%ucc,ut)%UTRAN -ield Test
:%..RAT5,.0oad.%ucc,ut&% -ield Test
:%..RAT5,.%ervice.Att,ut)%UTRAN -ield Test
:%..RAT5,.%ervice.AttReloc)rep,ut&% -ield Test
:%..RAT5,.%ervice.%uccReloc)rep,ut&% -ield Test
:%..RAT5,.%ervice.%ucc,ut)%UTRAN -ield Test
:%..RAT5,.%ervice.%ucc,ut&% -ield Test
6)*)+ Sensiti;ity anaysis
This section gives some results Bfrom anal3sis or simulation or lab testing or the fieldC on the sensitivit3
of the s3stem performance 1ith respect to the parameters of the algorithm. ,bviousl3 the main E).s
listed in section above can be used as the main metrics.
Motorola &onfidential )roprietar3 ;!
5 A'R #ontro
5)% O;er;ie=
The U%R3 AMR& algorithm is unchanged from U%R!. The AMR speech codec consists of the multi"
rate speech codec 1ith eight source rates from =.>$ 9bitKs to 4!.! 9bitKs. The AMR Rate &ontrol is a
connection oriented load management algorithm that is responsible for detecting the need for AMR mode
adaptation and for performing the reJuired procedures to change the current AMR mode to the ne1l3
selected AMR mode in the codecs at the U* or the transcoder. At call establishment the AMR mode is
s3mmetric
$
, but once the call is established, the supported AMR mode adaptation can be as3mmetric,
1hich implies the possibilit3 of using different AMR modes in uplin9 and do1nlin9 during an active
speech call. The decision to change the current AMR mode for one of the codecs is made b3 the RN&
based on measurements received BU* Transmitted )o1er for the U0 and Transmitted &ode )o1er for
the /0C.
The change bet1een the AMR specified rates occurs in do1nlin9, 1hen the do1nlin9 po1er eAceeds an
acceptable level, 1hich implies a poor lin9 Jualit3. .n that case, reducing the AMR mode 1ill reduce the
po1er reJuired to meet the %.R target for that lin9, optimizing the radio resources. .n uplin9 the
corresponding change is made 1hen the reported U* transmitted po1er eAceeds the acceptable level.
The benefit of this is that the contribution of speech to the noise rise is minimized and moreover, the
uplin9 coverage area for speech can be eAtended.
This algorithm is also in charge of modif3ing the rate for the &% rate"controllable streaming traffic
B4=.=, !;.;, $>.< 9bitKsC in the same 1a3 as it is done for AMR traffic, so it 1ill not be treated
separatel3, the follo1ing eAplanations appl3 to the &% rate"controllable traffic too.
The AMR& algorithm can be enabled or disabled via ,DM 1ith the %*T &,RRMA0G,%7.T&5
command. The A'R#MS3IT#! in ChS/"tch is used to modif3 the state enabledKdisabled. The
follo1ing eAplanation assumes the algorithm is enabled B%*T &,RRMA0G,%7.T&5 L
&5%7.T&5TAMR&G%7.T&5"4PC.
5)%)% Description
The RA' parameters are defined during the RA' Assignment procedure initiated b3 the &N to establish
the RA' for AMR. The Radio Access 'earer BRA'C service 1ill be defined as a set of RA' sub"flo1s.
The %RN& identifies each RA' sub"flo1 combination it 1ill support 1ith a RA' sub"-lo1
&ombination .ndicator BR-&.C. The set of RA' sub"flo1s that 1ill be supported b3 the UTRAN for the
RA' in Juestion is called the RA' sub"-lo1 &ombination %et BR-&%C. The %RN& notifies the core
net1or9 of the R-&% and the associated set of R-&.s during the .u user plane initialisation process.
The R-&. definition is given in order of increasing %/U sizes, i.e. the first R-&. proposed in the list
corresponds to the maAimum bit rate allo1ed to be used 1hen starting the communication phase. 7hen
$
-or &% services, the RA' rate is al1a3s s3mmetric in U0 and /0 initiall3 Bi.e. at RA'
establishmentC.
Motorola &onfidential )roprietar3 ;3
in the communication phase, the frame transmission starts in do1nlin9 in the initial R-&., this initial
AMR rate can be selected 1ith the In"tAmrM&%e parameter Bnote that testing of the algorithm sho1s
that this parameter does not 1or9, i.e. the initial rate is al1a3s the maAimum rateC. This 1ill be valid
until the RN& sends an .u U) Rate &ontrol frame 1hen the AMR& algorithm decides the /0 AMR rate
must be changed. /uring the .u U) rate control process, R-&. is used to indicate the maAimum bit
rate allo1ed to be used.
The RN& is designed to offer at most a sub"set of = AMR rates unless U* T-&s limitation prevents
that. The AMR rate selection mechanism applied b3 the RN& to construct a sub"set of = rates consists
of pic9ing up the lo1est ?Guaranteed@ AMR rate as 1ell as the maAimum bit rate, the other t1o rates
are selected 1ith a simple algorithm to choose eJuall3 distant values Bor ?.nitial@ preferred AMR rate
that can be defined via MM0 if it is not G'R or maAimum bit rateC. .f = or less rates are reJuested b3
the &N then the RN& 1illKcan onl3 offer those reJuested rates. .n case the configured .nitAmrRate is
out of %/U -ormat .nfo, the Guaranteed 'it Rate 1ill be automaticall3 selected b3 the RN& as initial
rate.
,nce the AMR call is successfull3 established, the AMR& initiates the measurements needed for this
algorithmL
.n the uplin9, the AMR& uses t1o instances Bmeasurement identities $ and 4!C of U* internal
measurements BU* Transmitted )o1erC. *ach of these measurements are event"triggered Bevents <a
and <bC and the3 are configured b3 an RR& M*A%UR*M*NT &,NTR,0 message. The main
,DM configurable parameters in this message areL Measurement Report Transfer Mode
BUlReportModeC, -ilter &oeficient BUlMeas-ilter&oefC, Time"to"trigger BUlTrigTime<a4,
UlTrigTime<b4, UlTrigTime<b!, UlTrigTime<a!C, U* Transmitted )o1er TA po1er threshold
Bcalculated using the MaAUlTA)o1er and ,DM configurable relative thresholdsL UlThd<a4,
UlThd<b4, UlThd<b!, UlThd<a!C. After these events are configured in the U*, the U* sends a
measurement report <A 1henever the U* transmission po1er becomes larger than the predefined
threshold and a measurement report <' 1henever the U* transmission po1er becomes less than a
predefined threshold, as illustrated in -igure > ">.
.n the do1nlin9, the AMR& uses periodic reports from the Node ' for the Transmitted &ode )o1er
on the best ra$io lin9
:
for each voice call. These periodic reports are configured 1ith a N'A)
/*/.&AT*/ M*A%UR*M*NT .N.T.AT.,N R*6U*%T message. The main ,DM configurable
parameters in this message areL Measurement -ilter &oefficient B)!Meas,"!terC&e(C and Report
)eriodicit3 B)LMEASRPRTPERIO)C. The RN& compares the periodic report values 1ith
absolute thresholds, derived from a set of ,DM configurable thresholds and the maAimum
transmitted po1er B)!Th)E1, )!Th)E<, )!Th),1, )!Th),<, RLMa.)!P&/erC. 'ased on
those comparisons, the RN& decides on increasing the AMR mode or reducing it or stop the
adOustments. Note that the thresholds are defined in a similar 1a3 1ith the ones for N'A) event
triggered reporting Bsee -igure > ";C.
The AMR& algorithm is applied independentl3 to the U0 and /0, therefore the process in both
directions 1ill be eAplained separatel3.
<
The best Radio 0in9 is the R0 on the ?best cell@ in the active set. 'est cell is the cell 1ith largest
value of *cKNo or R%&) reported b3 the U*.
Motorola &onfidential )roprietar3 ;=
5)%)+ Upin< A'R #ontro
7hen an event is received from a particular user, the AMR& behaves as follo1sL
.f there is an event <a4 received Bimpl3ing that the U* transmitted po1er is larger than a
thresholdC, the AMR& reduces the U0 AMR mode one level for that particular user.
.f there is an event <b4 or <a! received, the AMR& 1ill stop adOusting the U0 AMR.
.f there is an event <b! received Bimpl3ing that the U* transmitted po1er is smaller than a
thresholdC, the AMR& increases the U0 AMR mode one level for that particular user.
The modification Bincrease or reductionC of the U0 AMR mode is done 1ith a RR& TRAN%),RT
-,RMAT &,M'.NAT.,N &,NTR,0 message. This message is used to change the sub"set of
allo1ed uplin9 transport format combinations 1ithin the transport format combination set. 7hen this
message is sent, the '!M&%eChan#eT"mer!en timer is started. .f no failure message is received 1hen
the timer eApires, it can be considered that the U0 AMR speech rate adOustment succeeded.
A second timer B'!AmrcT"merLenC is also started 1hen the TRAN%),RT -,RMAT &,M'.NAT.,N
&,NTR,0 message is delivered to decide if a second adOustment is needed. .n case there is no event
report b3 the time the timer eApires Bthat means the measured value is still at the same state as the value
measured before the last U0 AMR mode adOustmentC, the RN& 1ill consider that the AMR mode
adOustment had no effect, so a second adOustment is made.
-igure >">L AMR& operation in U0
Note that Taurus recommended value for UlTh<b4 is the same as of UlTh<a4 and UlTh<b! is the same
as of UlTh<a!, 1hich implies that there are onl3 t1o effective thresholds, one above 1hich the U0 AMR
mode 1ill be reduced and one belo1 1hich the U0 AMR mode 1ill be increased.
7hen U0 AMR Mode is changed, AMR& 1ill inform RN& MA&"d to modif3 the '0*R target value to
-lerMo$e; corresponding to the current maAimum rate mode allo1ed to be used. This ne1 '0*R
target value 1ill be used for the U0 ,0)&.
Motorola &onfidential )roprietar3 ;$
5)%)3 Do=nin< A'R #ontro
7hen a periodic Transmitted &ode )o1er report is received, the RN& performs a conversion to be able
to compare the received value BTransmitted &ode )o1er measured on pilot bits of /)&&5 fieldC 1ith
the absolute thresholds Bdefined as the average po1er of /0 /)/&5C. %o, the RN& calculates the
actual average po1er of /0 /)/&5 according to the report valueL
N&te: .n the above form"la' P/P/C)2avg' P/PCC)2<ilot' P56 are absol"te <o#er val"e. N/ata is
the n"mber of $ata bits that are available for the CCTrC) in a ra$io frame #ith a s<ecific T7C.
N/ata= an$ N/ata> are the exact n"mber of bits in the $o#nlin9 /PC) fiel$s #ith a s<ecific slot
format.
,nce the average /0 /)/&5 po1er is computed according to the formula above, it 1ill be compared
1ith the thresholds. The absolute thresholds *4,*!,-4,-! are computed as follo1sL
Threshol$3= 1 Max/lTxPo#er ? )LThE1
Threshol$3> 1 Max/lTxPo#er ? )LThE<
Threshol$7= 1 Max/lTxPo#er ? )LTh,1
Threshol$7>1 Max/lTxPo#er ? )LTh,<
Max/lTxPo#er 1 PCPCICHP&/er (A// PCP.C)) 4 MaxCo$ePo#er5ffset (RLMa.)!P/r in S3T
C3((R(P8R)
.f the measured value is higher than *4 threshold, the AMR& reduces the /0 AMR mode one level
for that particular user. The AMR& 1ill continue 1ith further adOustments, reducing the AMR mode
level step b3 step upon reception of the reports, until the measured value becomes smaller than *!,
i.e. it is considered that the AMR mode adOustment had effect.
.f the measured value is smaller than -4 threshold, the AMR& increases the /0 AMR mode one
level for that particular user. The AMR& 1ill continue 1ith the adOustments, increasing the AMR
mode level step b3 step, until the measured value becomes larger than -!.
The modification Bincrease or reductionC of the /0 AMR mode is done 1ith a .u U) Rate &ontrol frame
sent to &N. This frame contains all the configured T-&.s 1ith their state Ballo1edKbarredC in order to
achieve the desired increase or reduction on the AMR mode.
Motorola &onfidential )roprietar3 ;<
-igure >";L AMR& operation in /0
Note that Taurus recommended value for /lTh*4 is the same as of /lTh*! and /lTh-4 is the same as
of /lTh-!, 1hich implies that there are onl3 t1o effective thresholds, one above 1hich the /0 AMR
mode 1ill be reduced and one belo1 1hich the /0 AMR mode 1ill be increased.
5)+ Dependencies
No 9no1n dependencies or interactions 1ith other algorithms.
J&I Name Descriptions
/0 Average )o1er
B&apacit3C Gain of the
cell
The /0 Average )o1er B&apacit3 improvementC Gain of a cell is computed
as the ratio of the average po1er transmitted b3 the cell 1hen AMR rate
s1itching is disabled Ball U*2s at 4!.!E AMR rateC, and the average po1er
transmitted b3 the cell 1hen AMR rate s1itching is enabled BU*2s can
assume an3 of the = AMR ratesC.
U0 Average )o1er
B&overageC Gain of the
cell
The U0 Average )o1er B&overageC Gain of a cell is computed as the ratio of
the average po1er received at the cell 1hen AMR rate s1itching is disabled
Ball U*2s at 4!.!E AMR rateC , and the average po1er received at the cell
1hen AMR rate s1itching is enabled BU*2s can assume an3 of the = AMR
ratesC. This E). is related to the eAtension in U0 coverage that is one of the
advantages of the algorithm
/ropped &all Rate
B/&RC .mprovement
/ifference in /&R E). 1hen AMR& is off and on. This E). is meaningful
1hen it is measured under poor radio conditions, e.g. at the cell edge.
Average Number of U0 The average number of balanced AMR users E). is eApressed b3 the
Motorola &onfidential )roprietar3 ;>
AMR& 'alanced U*s follo1ing formulaL
7hereL
E" is significant number of 4"seconds observation intervals eJual at least
4!, and
number of balanced AMR U*s to the 1idth of the range bet1een U*
Transmitter )o1er Threshold for event <'4 and <A! ratio defined asL

4 <- Th
P
" is the U* transmitted po1er threshold for event <'4 eJual to
difference bet1een MaAUlTA)o1er and AMR& configuration parameter
value of U0Th<'4.

! <A Th
P
" is the U* transmitted po1er threshold for event <A! eJual to
difference bet1een MaAUlTA)o1er and AMR& configuration parameter
value of U0Th<A!.

@(
P
" is a set of U* transmitting AMR U0 traffic

"l
<
" is a value of the U*2s U0 transmitted po1er

" is norm operator

i
@3
" is a sum of AMR U*s in the cell, 1hich U0 transmitted po1er
level is in the range bet1een

4 <- Th
P
and

! < A Th
P
BAMR& doesn2t adOust
AMR rateC
The AMR& algorithm performs better 1hen E). values increases.
Average Number of /0
AMR& 'alanced U*s
The average number of balanced AMR users E). is eApressed b3 the
follo1ing formulaL

1
]
1
$-
N
,
N
,
9
9
/( /(
4 4
4
C B
7hereL
E" is significant number of 4"seconds observation intervals eJual at least
4!, and
Motorola &onfidential )roprietar3 ;;
number of balanced AMR users to the 1idth of the range bet1een /0
Transmitter &ode )o1er Threshold for event *! and -! ratio defined asL

1
]
1

$- $-m P $-m P
@3
N
Th7 Th3
P < P P +
+
9
/(
Th3 $l Th7 /(
4
a ` a `
! !
S L R
C B ! !

! Th3
P
is the /0 transmitted code po1er threshold for event *! eJual to
difference bet1een MaA/lTA)o1er Bsee ,pto GuideC and AMR&
configuration parameter value of /0Th*!.

! Th7
P
is the /0 transmitted code po1er threshold for event -! eJual to
difference bet1een MaA/0TA)o1er Bsee ,pto GuideC and AMR&
configuration parameter value of /0Th-!.

/(
P
" is a set of U*s transmitting /0 AMR traffic

$l
<
" is a value of the /0 transmitted code po1er

" is norm operator

+
@3
" is a sum of AMR users in the cell, 1hich /0 transmitted code
po1er level is in the range bet1een

! Th3
P
and

! Th7
P
BAMR& algorithm
doesn2t adOust AMR rateC
The AMR& algorithm performs better 1hen E). values increases.
5)2)% E>pected J&I ;aues
/0 Average )o1er B&apacit3C Gain of the cell Q .= d'
U0 Average )o1er B&apacit3C Gain of the cell Q .3 d'
Average Number of U0 AMR& 'alanced U*s T'/
Average Number of /0 AMR& 'alanced U*s T'/
/ropped &all Rate B/&RC .mprovement T'/
Motorola &onfidential )roprietar3 ;+
5)2)+ Sensiti;ity anaysis
>.=.!.4 D- A;erage &o=er 7#apacity8 Gain o$ ces under di$$erent oads
Motorola &onfidential )roprietar3 +
>.=.!.! U- A;erage &o=er 7#apacity8 Gain o$ ces under di$$erent oads
%imulations results sho1n thatL
As a result of AMR& algorithm there is a /0 Average )o1er Bcapacit3C Gain of
o .4 d' at 0o1 0oad
o .! d' at Medium 0oad
Motorola &onfidential )roprietar3 +4
o .$ d' at 5igh 0oad
As a result of AMR& algorithm there is a U0 Average )o1er B&overageC Gain of
o .4 d' at 0o1 0oad
o .! d' at Medium 0oad
o .= d' at 5igh 0oad
Above observations B/0 and U0C are similar for both !"AMR and ="AMR rate eAperiment.
According to these simulation results, operator 1ill achieve same capacit3 or coverage gain b3 offering
either option. 5o1ever users ma3 eAperience a noticeable decrease in voice Jualit3 in a !"AMR s3stem
1henever AMR rate s1itches as compared to ="AMR s3stem.
Motorola &onfidential )roprietar3 +!
* 'obiity 'anagement
*)% Introduction
This chapter of the optimization guide is dedicated to a number of algorithms that are used to address
the issues related to the users mobilit3 in the UTRAN. The chapter consists of the follo1ing sectionsL
&ell selection and reselection procedures, used b3 the U* in .dle mode and in &onnected
mode Bbut not in the cellG/&5 RR& stateCP
.ntra"freJuenc3 handover, used 1hen the U* is in the cellG/&5 stateP it includes soft
handover, hard handover and 5%/)A cell reselectionP
&ompressed Mode, used 1hen necessar3 to allo1 the U* to ma9e measurements on other
3G carriers andKor !G cellsP
.nter"freJuenc3 handover, used to handover calls from a 3G cell to another 3G cell but on a
different carrierP
.nter"RAT handover, used to handover calls from a 3G net1or9 to a !G net1or9P
%RN% relocation, used to change the serving RN& of a call to another RN&.
Note that the handover algorithms listed above and described in this chapter are all coverage"based in
the sense that the3 ma9e use of R- measurements, t3picall3 signal strength andKor signal Jualit3, to
decide 1hen calls should be handed over and to 1hich cell. The3 are used to ensure that an established
call can be maintained successfull3 despite the users mobilit3. This is in contrast 1ith other t3pes of
handover algorithms, be the3 blind or measurements"driven, but used for eAample to manage the load
bet1een different cells.
7hen tr3ing to optimize these handover algorithms, it is tempting to tr3 and set the parameters so that
the handover Bor radio lin9 additionKdeletion in the case of intra"freJuenc3 handoverC occurs as Juic9l3
as possible so that a U* is al1a3s connected to the ?best@ cells. 5o1ever such strateg3 1ould lead to
the highest level of signalling messages, mostl3 over the Uu and .ub interfaces but also, to a lesser
eAtent, over the .ur interface. Also, using the best cells ma3 not bring that much benefits compared to
using the cells 1hich are ?good enough@. Therefore the main issue in setting parameters is to achieve a
balance bet1een the R- performance and the signalling load.
Motorola &onfidential )roprietar3 +3
9 #e Seection and Reseection
9)% O;er;ie=
This section describes the cell selection and reselection processes for a U* in idle mode and RR&
connected mode in the RN&$. &ell reselection is supported for intra"freJuenc3, inter"freJuenc3 and
inter"RAT G%M cells.
7hen a U* is s1itched on, the U* selects a public land mobile net1or9 B)0MNC and loo9s for a
suitable cell to provide available services, tunes to its control channel and listens to broadcast messages.
This choosing is 9no1n as cam<ing on the cell and is performed b3 the ce seection procedure. Then,
the U* registers its presence, b3 means of a NA% registration procedure, in the registration area of the
chosen cell, if necessar3.
.f the U* finds a more suitable cell, it reselects onto that cell and camps on it. This procedure is 9no1n
as ce reseection procedure. .f the ne1 cell is in a different registration area, location registration is
performed. The follo1ing sections eAplain both procedures and the parameters involved.
9)%)% #e seection procedure
After selecting a )0MN, the U* attempts to find a suitable cell of that )0MN to camp on. ,nce a cell
has been selected, the U* tunes to its control channels for normal service in order to be able to receive
s3stem information from the )0MN, receive registration area information, and if registered, receive
paging and notification messages and be able to initiate call set"up for outgoing calls.
%uitable cells to camp on are those that provide normal service Bnot barred, not part of a forbidden 0AC
for the )0MN and fulfil the cell selection criterion % described later. -or this, the U* has to measure the
Jualit3 Bin terms of &).&5 R%&) and &).&5 *cKNoC of each potential cell. %election of a particular
cell from the list of candidates is left to U* implementation, and although in theor3 the best cell should
be selected, in practice the first suitable cell is often selected in order to provide service as soon as
possible. &ell reselection 1ill then ensure the best available cell is chosen.
The U* ma3 use one of the t1o search procedures for cell selection.
Initia #e Seection. This procedure reJuires no prior 9no1ledge of 1hich R- channels are UTRA
carriers. The U* scans all R- channels in the UTRA band to find a suitable cell for the selected
)0MN in 1hich s3stem information can be read. .f the selected )0MN is found, the search of the
rest of carriers ma3 be stopped and this cell ma3 be selected.
Stored In$ormation #e Seection. This procedure reJuires stored information of carrier
freJuencies and optionall3 also information on cell parameters, e.g. scrambling codes, from
previousl3 received measurement control information elements. After the U* has found one suitable
cell for the selected )0MN the U* ma3 camp on it. .f no suitable cell is found, the initial cell
selection procedure is started.
Motorola &onfidential )roprietar3 +=
+.4.4.4 #e seection criterion S
The cell selection criterion is based on t1o different measurement t3pesL
a Jualit3 related measurement 6
Jual
, in terms of &).&5 *cKNo Bd'C.
a received signal strength measurement 6
lev
, in terms of &).&5 R%&) Bd'mC.
The cell selection criterion % is fulfilled 1hen,
%
lev
Q AN/ %
Jual
Q
1here
%
Jual
T 6
Jual
N 6
JualGmin
%
lev
T6
lev
N 6
levGmin
" )
compensation
S
0"al
and S
lev
are the cell selection Jualit3 and R8 level values
!
0"al
and !
lev
denote the measured cell Jualit3 and R8 level, as defined above.
!
0"al&min
is the minimum reJuired Jualit3 level in the cell in d'.
!
lev&min
is the minimum reJuired received signal strength from the cell in d'm.
P
com<ensation
is defined as maABU*GT8)7RGMA8GRA&5 " )GMA8, C, to account for U*
po1er limitations. 7here U*GT8)7RGMA8GRA&5 is the maAimum T8 po1er level an
U* ma3 use 1hen accessing the cell on RA&5 and )GMA8 is the maAimum R- output
po1er of the mobile.
The minimum Jualit3 and R8 level thresholds for cell selection can be configured in the RN&$ on a
per cell basis through the database parameters >?ua!m"n and >r.!e$m"n respectivel3 b3 using the
MM. command A// &*00%*0R*%*0. This information is sent to the U* in %.' 3 Bnote that %.' = is
not supported in U%R3C.
9)%)+ UE measurements
7hen camped normall3, the U* shall read relevant s3stem information messages, monitor the )&5 of
the cell, perform the necessar3 measurements for cell reselection and eAecute the cell reselection
evaluation process as described in section +.4.3.
Measurements are ta9en on the serving cell and all intra"freJuenc3, inter"freJuenc3 -// and inter"RAT
G%M neighbouring cells broadcast on %.' 44 Bnote that %.' 4! is not supported in U%R3C.
R/ 'easurements on t"e ser;ing ce. The U* ta9es Jualit3 and R8 level measurements of the
serving cell and evaluate the cell selection criterion % periodicall3 at least once ever3 /R8 c3cle.
The number of samples ta9en and averaging is controlled b3 U* internal timers and counters Bsee
!$.433C.
Motorola &onfidential )roprietar3 +$
R/ 'easurements o$ intra1$reOuency ces. 6ualit3 and R8 level measurements are also ta9en
periodicall3 on intra"freJuenc3 cells based on internal U* timers in order to evaluate if a neighbour
has become better than the serving cell. 5o1ever, UTRAN can control the triggering of such
measurements through the optional parameter S
intrasearch
. .f this .* is not present in %.' 3, intra"
freJuenc3 measurements are ta9en periodicall3. .f this .* is present, measurements are onl3 ta9en
1hen the Jualit3 of the serving cell goes belo1 a given threshold BS
0"al
\ S
intrasearch
C. The RN&$
allo1s the configuration of both, the .* status and the threshold level 1ith the database parameters
S"ntrasearchIn% and S"ntrasearch respectivel3.
R/ 'easurements o$ inter1$reOuency /DD ces. The U* shall ta9e Jualit3 and R8 level
measurements periodicall3 on inter"freJuenc3 cells based on internal U* timers in order to evaluate
if a neighbour has become better than the serving cell. 5o1ever, UTRAN can control the triggering
of such measurements through the optional parameter S
intersearch
. .f this .* is not present in %.' 3,
inter"freJuenc3 measurements are ta9en periodicall3. .f this .* is present, measurements are onl3
ta9en 1hen the Jualit3 of the serving cell goes belo1 a given threshold BS
0"al
\ S
intersearch
C. The
RN&$ allo1s the configuration of both, the .* status and the threshold level 1ith the database
parameters S"ntersearchIn% and S"ntersearch respectivel3.
R/ 'easurements o$ inter1RAT GS' ces. The U* shall also measure periodicall3 the signal
level of each G%M neighbour cell, according to internal U* timers, and attempt to verif3 the '%.&.
Again, UTRAN controls the triggering of such measurements through the optional parameter
S
searchRAT
. .f this .* is not present in %.' 3, inter"RAT measurements are ta9en periodicall3. .f this .*
is present, measurements are onl3 ta9en 1hen the Jualit3 of the serving cell goes belo1 a given
threshold BS
0"al
\ S
searchRAT
C. The RN&$ allo1s the configuration of both, the .* status and the
threshold level 1ith the database parameters SsearchratIn% and Ssearchrat respectivel3.
The length of the /R8 c3cle is closel3 related to ho1 often the U* measures the neighbouring cells and
evaluates the reselection criteria, and so it has a direct impact on the minimum reselection time. This
feature can be configured in the RN&$ 1ith the parameter )R@C-c!eLen#thC&e( for idle mode and
)r.C-c!eLenC&e( for connected mode. 5o1ever, cell reselection performance is ver3 dependent on U*
implementation since onl3 maAimum time intervals are specified in 3G)).
9)%)3 #e reseection in Ide 'ode
.nitiall3, the U* considers all neighbouring cells to the serving cell as given in the s3stem information
messages as potential cells for reselection. 5o1ever, onl3 those that fulfil the cell reselection criterion %
presented in section +.4.3.4 belo1 are suitable. Then, the list of candidate cells is sorted according to the
ran9ing criterion given in section +.4.3.! and the best cell is selected.
*valuation of the % criterion and ran9ing is performed ever3 time R- measurements are ta9en on the
serving or neighbouring cells but actual cell reselection onl3 happens in the follo1ing occasionsL
.nformation on '&&5 used for cell reselection evaluation has been modified.
The serving cell does not fulfil the cell selection criterion %.
Motorola &onfidential )roprietar3 +<
An intra"freJuenc3, inter"freJuenc3 or inter"RAT G%M cell has become better ran9ed than
the serving cell during a period of T
reselection
seconds.
.n an3 case, cell reselection is onl3 possible 1hen a given cell has been the serving cell for longer than 4
second Bas specified in !$.3=C.
The cell reselection timer value T
reselection
is also a configurable parameter in the RN&$ 1ith the
parameter Trese!ect"&ns in the A// &*00%*0R*%*0 command. This information is sent to the U* on
%.' 3.
+.4.3.4 #e reseection criterion S
The cell reselection criterion for inter"freJuenc3 and intra"freJuenc3 -// cells is the same as the %
criterion described previousl3. -or inter"RAT G%M cells, the cell reselection criterion is based on G%M
carrier R%%. measurements and it is fulfilled 1henL
%rAlev Q Bfor G%M cellsC
1here
%rAlevT6rAlev N 6levGmin " )compensation
S
rxlev
is the cell selection R8 level value Bd'C.
!
rxlev
denotes the averaged received signal strength level BR%%.C of the G%M cell.
!
lev&min
and P
com<ensation
as previousl3 defined.
+.4.3.! Ran<ing criterion R
The cell ran9ing criterion used for inter"freJuenc3, intra"freJuenc3 and inter"RAT cell reselection
process B1hen 5&% is not usedC is defined b3L
Rs T 6meas,s V 6h3sts
Rn T 6meas,n N 6offsets,n
1here
R
s
is the cell reselection value for the serving cell Bcell on 1hich U* is campedC.
R
n
is the cell reselection value for each one of the neighbours indicated in the s3stem
information of the camped cell.
!
meas's
is the cell Jualit3 value from the camped cell.
!
meas'n
is the cell Jualit3 value for a given neighbour.
!offset
s'n
is the ,ffset bet1een the !
meas's
and !
meas'n
applied in the ran9ing.
!hyst
s
is the h3steresis value of the serving cell applied in the ran9ing.
Motorola &onfidential )roprietar3 +>
The best"ran9ed cell is that 1ith the highest R value. The U* performs a cell reselection 1hen a
neighbour cell becomes better ran9ed that the serving cell, i.e. RnARs, for the duration of the T
reselection
timer.
As Jualit3 measure !
meas
for the serving and neighbouring cells, the U* ma3 use the &).&5 *cKNo or
the &).&5 R%&). This is indicated in an information element in %.'3 called
Cell&selection&an$&reselection&0"ality&meas"re broadcast on %.'3 and can be set via the parameter
>ua!Meas in the command A// &*00%*0R*%*0.
The offset and h3steresis values !
offset
and !
hyst
are set in U%R! b3 the parameters >h-st<s B>h-st1sC
and >&((set<sn B>&((set1snC depending on 1hether *cKNo Bor R%&)C is used as a Jualit3 measure. The
h3steresis and offset values are broadcast on s3stem information bloc9 t3pe 3 and t3pe 44 respectivel3.
5o1ever, !hyst>s and !offset>sn are optional .*s that ta9e the default value of !hyst=s and
!offset=sn B1hich are mandator3 .*C 1hen not present. 7hen using &).&5 *cKNo as a Jualit3 measure
for -// cells, >h-st<s and >&((set<sn are the most relevant parameters. ,n the other hand, carrier
R%%. is the Jualit3 measure for G%M neighbours and so onl3 >h-st1s and >&((set1sn appl3.
+.4.3.3 /irst ran<ing o$ ces
-irstl3, the candidate cells are ran9ed according to the R criteria specified above, deriving !
meas's
and
!
meas'n
and calculating the R
s
and R
n
values using &).&5 R%&) for UTRAN -// cells and R%%. for
G%M cells. The best"ran9ed cell is the cell 1ith the highest R"value. The offset and h3steresis values
given b3 >&((set1sn and >h-st1s, are used here.
.f a G%M cell is ran9ed as the best cell during a time interval T
reselection
, the U* performs cell reselection
to that G%M cell. .f an inter"freJuenc3 or intra"freJuenc3 -// cell is ran9ed as the best cell and the
Jualit3 measure for cell reselection is set to &).&5 R%&), the U* performs cell reselection to that -//
cell.
+.4.3.= Second ran<ing o$ ces
.f an -// cell is ran9ed as the best cell and the Jualit3 measure for cell reselection is set to &).&5
*cKNo, the U* performs a second ran9ing of the -// candidate cells according to the R criteria
specified above, but using the measurement Juantit3 &).&5 *cKNo for deriving !
meas's
and !
meas'n
and
calculating the R
s
and R
s
values. The offset and h3steresis values given b3 >&((set<sn and >h-st<s, are
used no1. Note that the parameters are uniJue on a cell"to"neighbour cell relation basis.
.f a UTRAN -// cell is ran9ed as the best cell during a time interval T
reselection
, the U* performs cell
reselection to that -// cell.
9)%)2 #e reseection in RR# #onnected 'ode
The cell reselection process in RR& connected mode is the same as the process described for idle mode
in section +.4.3. The difference lies in the length of the /R8 c3cle, the performance reJuirements
BmaAimum cell reselection dela3C, the triggers and the RR& signalling associated Bsuch as &ell Update
Motorola &onfidential )roprietar3 +;
and URA Update proceduresC, 1hich depend on the RR& state &*00G-A&5, &*00G)&5 or
URAG)&5, and are given in 3G)) !$.334. Also, since %.' = and %.' 4! are not present in U%R3, cell
reselection parameters and neighbour lists cannot be set differentl3 for .dle and RR& connected mode.
9)+ Database parameters
The follo1ing commands are used to configure the parameters of the cell selection and reselection
procedures.
A//KM,/ &*00%*0R*%*0
%*T -R&
A//KM,/ .NTRA-R*6N&*00
A//KM,/ .NT*R-R*6N&*00
A//KM,/ G%MN&*00
A// &N/,MA.N
Most parameters related to cell reselection Bbroadcast on %.' 3C are configured 1ith the command A//
&*00%*0R*%*0 on a per cell basis. Neighbour relationships bet1een cells and the related parameters
are setup using the commands A//KM,/ .NTRA-R*6N&*00, A//KM,/ .NT*R-R*6N&*00
and A//KM,/ G%MN&*00, respectivel3 for intra"freJuenc3 neighbours, inter"freJuenc3 neighbours
and G%M neighbours.
J&I Description
Ide 'ode
#&I#! EcBNo Received energ3 per chip of the &).&5 divided b3 the po1er
densit3 in the freJuenc3 band at the U*. The *cKNo is identical to
R%&) KR%%.
#&I#! RS#& Received %ignal &ode )o1er, the received po1er on one code
measured on the primar3 &).&5
0#! 0-ER '&5 '0*R B'loc9 *rror RateC is the percentage of transport
bloc9s BMA& )/UsC received b3 the U* 0a3er4 over the '&5
&hannel 1hose &R& fails
RR# #onnection Setup
Success Ratio
Ratio bet1een the number of RR& &,NN*&T.,N %*TU)
&,M)0*T* messages received b3 the UTRAN and the number of
RR& &,NN*&T.,N R*6U*%T messages sent b3 the U* over
the measurement period. Applies to ./0* mode onl3.
'ean Time 0et=een
#e Reseections
Average length of time bet1een t1o successive cell reselections
performed b3 the U*
Ser;ice Outage )robabilit3 that the U* is not able to find a suitable cell to camp on
Motorola &onfidential )roprietar3 ++
for normal service. This is 1hen the received signal level or Jualit3
is too lo1 to successfull3 decode the %.'s on '&5.
Tota #e Reseection
Time
Average time to perform a cell reselection at the U*, from the time
a target cell becomes stronger than the serving cell to the point
1hen U* camps on the ne1 cell. &alculated as average and +$_"
tile value
RR# #onnected 'ode
0-ER )ercentage of transport bloc9s BMA& )/UsC received b3 the U*
0a3er4 B/0 '0*RC or UTRAN 04 BU0 '0*RC 1hose &R& fails.
These values are calculated over the transport channel that carries
the user data information on the communication channel
U-BD- 'A# SDU
Trans$er Deay Nitter
:ariation in the average dela3 in seconds reJuired to transfer MA&
%/Us bet1een the U* and UTRAN ends due to &ell Update or
URA Update procedures during cell reselection. T1o separate
values 1ill be considered for both uplin9 and do1nlin9 paths
#e Reseection Time in
#onn 'ode
Average time to perform a cell reselection at the U*, from the time
a target cell becomes stronger than the serving cell to the point
1hen U* receives the &ellKURA Update &onfirm message.
&alculated as average and +$_"tile value
.n .dle mode, the main indicator of good cell reselection performance is a lo1 probabilit3 of service
outage, i.e. 1hether the U* can find a cell to camp on and access service BalmostC at all times. -or this
to happen, the U* has to be able to receive the &).&5 1ith enough level and Jualit3 to successfull3
decode the %.'s as it moves along the coverage area. This is 1here the '&5 '0*R indicator has to be
ta9en into account.
.deall3, the U* should select the best cell available, 1hich is given b3 the cell 1ith the strongest &).&5
R%&) Bclosel3 related to path lossC or &).&5 *c.o Bthat also depends on the cell loadC. 5o1ever,
selection of the strongest cell is not critical and camping on a ?good@ cell is usuall3 enough as long as
the probabilit3 of RA&5 access is 9ept high.
-inall3, the time reJuired to perform cell reselection is a good indicator of procedure performance, that
greatl3 depends on U* performance, 1hich operators often loo9 at. -or the purpose of testing, the total
reselection time can be divided into BiC target detection time and BiiC reselection eAecution time.
,n the other hand, 1hen the U* is in connected mode and transferring data on RA&K-A&5 channels,
the 9e3 indicators to consider are those related to the bearer performanceL '0*R, dela3, and throughput.
The follo1ing values for database parameters are suggested from simulations and labKfield tests
performed at the time for the RN&$. Note that these results can be applied directl3 to U%R3 since the
cell reselection process is U* driven. The onl3 difference is that optional .*s %intrasearch, %intersearch
and %searchrat broadcast in %.' 3 are supported in U%R3 Bthe3 1ere not in the RN&$C.
The rationale behind these recommendations is presented belo1. The simulation scenario described in
&hapter 4 1as modified to include shado1ing and increase U* mobilit3 to 4 9mKh, in order to obtain
statisticall3 more reliable sample size of cell selection and reselection events.
The parameters >?ua!m"n and >r.!e$m"n have to be chosen so that the outage probabilit3 Bi.e.
probabilit3 that a U* is not able to find a suitable serving cellC is lo1. ,utage occurs 1hen either the
receive signal level is belo1 U* sensitivit3 or 1hen the Jualit3 is too lo1 to decode reliabl3 the %.'s on
'&5.
-rom lin9 level simulations 1e can find that the reJuired *c.o to decode the '&5 at 4_ '0*R is about
N4$ d'. %ince the po1er of )"&&)&5 is about = d' belo1 the po1er of the )"&).&5, the reJuired
*c.o on &).&5 is about N44 d'.
.n terms of minimum reJuired R%&), if 1e assume that the noise figure at the U* is + d', the thermal
noise floor is about N++ d'm. Then, the reJuired &).&5 R%&) is about N44= d'm.
-or the values suggested above, simulation results from U%% achieve almost zero outage for !_
net1or9 load. 5o1ever, outage increases significantl3 1ith s3stem load and so >?ua!m"n needs to be
decreased accordingl3. Note that due to limitations in the simulation model, outage occurs 1hen either
the received signal level or Jualit3 is too lo1 on &).&5 Bnot on '&5C. .n realit3, the po1er offset of the
)"&&)&5, together 1ith the minimum R%&) and *c.o thresholds, has an important effect on the
service outage.
The parameters >h-st<s and >&((set<sn represent a margin above the serving cells *c.o, 1hich
candidate cells must eAceed for reselection to occur. 5ence both can be studied together as a combined
offset for optimisation purposes.
The rate of cell reselection is strongl3 affected b3 the choice of timer BTrese!ect"&nsC and offset values.
The rate reduces b3 approAimatel3 ;_ bet1een the t1o eAtreme cases studied in the simulationsL BiC
sec timer and d' offset, and BiiC 4 sec timer and > d' offset. 5o1ever, there is little effect on the
maAimum path loss eAperienced. The absolute values obtained are ver3 dependent on the mobilit3 model
and cell la3out used in the simulations, but it is clear that longer reselection times and greater offsets
can be emplo3ed to minimise the signalling load 1hile shorter times and smaller offsets to minimise the
'&5 '0*R.
5ffset for serving cell ($-)
: + 2 5
R
e
s
e
l
e
c
t
i
o
n

t
i
m
e
r

(
s
)
: 33.4 b
!+.$
=>.; b
=$.4
<.3 b
$4.>
"
% 3$.< b
3.+
=+.< b
=$.4
<3. b
$!.3
"
3 =.; b
33.>
$<.3 b
$!.+
<+.> b
$<.4
"
4 =+.> b
=<.!
<=.$ b
$<.3
;4.3 b
<<.4
"
%
:
" " " 43>.> b
+>.4
Table +"!. Mean time BsC bet1een cell reselections as a function of reselection timer and serving cell
*c.o offset values BsourceL `%im!aC
The cell reselection timer BTrese!ect"&nsC introduces a triggering dela3 before the actual process of
s1itching from the source cell to the target cell is initiated at the U* Bthe target cell must remain better
ran9ed for the duration of Trese!ect"&nsC. 5ence, this increases the total reselection time as perceived b3
the user, and so has to be set according to the mobilit3 environment BU* speedC. A value of
Trese!ect"&ns T4 has been suggested for lab and field trial tests. The dra1bac9 of too lo1 reselection
dela3 is a ping"pong effect and triggering of ?false@ reselections due to short"time path loss variations.
The /R8 c3cle length directl3 defines the periodicit3 of measurements done b3 the U* and the
minimum possible time reJuired to perform reselection. .t shall be set to the minimum value of < i.e.
.<= sec for U*s in .dle mode. This commands the U* to perform measurements at least ever3 4.!; sec
and to evaluate that the target cell has become better ran9ed 1ithin $.4! seconds. %imilarl3, for
&*00G-A&5 connected mode )r.C-c!eLenC&e( shall be set to the minimum value of ; B.4< secC for
optimum performance.
.t is important to note that cell reselection performance depends greatl3 on U* implementation and its
capabilit3 to ma9e often and accurate neighbour measurements. %imulation models assume that the U*
is capable of measuring neighbour cells ever3 .$ sec. 5o1ever, there is onl3 one searcher available for
pilot measurements and so onl3 the energ3 from the strongest path can be recovered. This is particularl3
significant in TU channels since onl3 about 3_ of the total po1er can be recovered due to the
multipath dela3 profile.
,ptimisation carried out in the lab B`-ield4aC has managed to reduced the cell reselection time to <.!
seconds B1hich 1as its main goalC, b3 using ver3 aggressive database settingsL >h-st<s A >&((set<sn T
d', Trese!ect"&ns T 4 sec, )R@C-c!eLen#thC&e( T <. Results sho1 that the /R8 c3cle length
parameter has the greatest impact not onl3 on the target detection time but also on the reselection
eAecution time.

-igure +"+L Results from cell reselection performance test in the lab Bsource `-ield4aC
%:Intra1$reOuency !ando;er
%:)% O;er;ie=
%:)%)%Description
The figure sho1s the scenario 1here a mobile moves from one cell to another. .t can be seen that in
&/MA there is a blur zone 1here the mobile can be connected to both cells, reducing the impact of hard
s1itching of the transmission channel on the Jualit3 of service. This is 1hat is called so$t "ando;er.
The handover control function for soft handover is responsible of the follo1ing tas9s.
/etermine 1hether a soft handover is necessar3.
Receive intra"freJuenc3 measurement reports from U* Bintra"freJuenc3 measurement results and
information about intra"freJuenc3 events that triggered the measurement reportC, 1hich ma3 refer to
Node 's under the same or different RN&.
/ecide 1hether to add an3 of these reported cells to the active set or drop an3 of the cells from the
active set Badding or deleting the radio lin9sC
7hen radio lin9s are added, splittingKcombining or splittingKselection functions in the appropriate
net1or9 elements are also instructed to begin diversit3 processing 1ith the ne1 radio lin9.
Note since U%R4 a parameter has been provided to set the maAimum data rate at 1hich softKsofter
handover is eAecuted. -or U*s using non real"time RA's above '*'itRateThd, intra"freJuenc3 hard
handover is performed.
4.4.4.4 Intra1$reOuency Reporting E;ents
.ntra"freJuenc3 handover algorithms rel3 on setting up intra"freJuenc3 events 4A through 4/ to trigger
M*A%UR*M*NT R*),RT messages at the U*. U%R3 supports the configuration of all event 4A
measurement report parameters defined in 3G)) on a per cell basis, although onl3 events 4A through
4/ are used b3 the U%R3 intra"freJuenc3 handover algorithm Bc.f. U%R! 1here 4* and 4- events 1ere
used b3 the %5,GM*T5,/4 variantC.
This section describes the most relevant U%R3 soft handover parameters as per event t3pe B4A, 4', 4&,
/C, but before several concepts are introduced belo1.
)ysteresis dela3s the report until the ne1
cell is better than the active cell b3 a
minimum value assigned to the h3steresis
parameter. Triggering condition is t 5
4A
K!
around the nominal threshold.

H1c
H1c
Time2to2Trigger dela3s the report until the
ne1 cell has remained in the reporting range
for a given amount of time

The h3steresis value and time"to"trigger dela3, together 1ith the triggering criteria, define the conditions
at 1hich measurements reports for a given event are sent. The h3steresis and time"to"trigger parameters
are common to all the event t3pes. .n U%R3, this can be configured 1ith the A//
&*00.NTRA-R*65, command attributes H-st(&r1. and Tr"#T"me1. respectivel3. &onversel3, the
triggering criterion is different for each event t3pe and so are the parameters associated.
4.4.4.4.4 *vent 4&
*vent 4& occurs 1hen one of the non"active pilots surpasses an active set pilot, regardless of its
absolute strength Bbut note that for a cell to be added to the active set follo1ing a 4& event the reported
Jualit3 must eAceed an absolute threshold, SHO>ua!m"nC. The h3steresis and time to trigger
parameters described above control this cell addition mechanism. .n addition, the parameter
Re2!acement_Act"$at"&n_Thresh&!% Bhard"coded to 3 in U%R3C sets the minimum size of the active set
reJuired for this event to be triggered.
4.4.4.4.! *vents 4A and 4'
*vents 4A and 4' enable, respectivel3, the addition and deletion of cells to the active set according to a
relative d3namic criterion given b3 3G)) T% !$.334 Bbut note that for a cell to be added to the active
set follo1ing a 4A event the reported Jualit3 must eAceed an absolute threshold, SHO>ua!m"nC. The
criterion for cell addition is fulfilled 1hen the signal strength B*cNoC of a ne1 cell is good enough
compared to the best cell Bin general to all cells in the active setC, i.e. the candidate cell measurement is
1ithin a threshold belo1 the best cell measurement. .n particular, event 4A is triggered 1hen the U*
enters the reporting range defined b3 the follo1ing formula,
C, ! K B 4 C 4 B 4 4
4 4
4
a a -est
N
i
i Ne#
) R (ogM 8 M (og 8 (ogM
A
+
,
_
%imilarl3, event 4' is triggered 1hen the U* leaves the reporting range defined b3 the formula,
C, ! K B 4 C 4 B 4 4
4 4
4
b b -est
N
i
i 5l$
) R (ogM 8 M (og 8 (ogM
A
+ +
,
_
1here
M
Ne/
is the measurement result of the cell entering the reporting range.
M
5l$
is the measurement result of the cell leaving the reporting range.
M
"
is a measurement result of a cell in the active set.
N
A
is the number of cells in the current active set not forbidden to affect the reporting range.
B is the filtering 1eight sent to the U* from UTRAN.
R
=x
is the reporting range constant.
H
=x
is the h3steresis parameter.
The addition 1indo1 of cells in event 4A is configured 1ith the reporting range constant parameter
IntraRe!Th%,&r1A, together 1ith the h3steresis and time to trigger parameters. 5o1ever, the
occurrence of event 4A is conditional on a report deactivation threshold parameter called
Re2&rt_)eact"$at"&n_Thresh&!% Bhard"coded to ! in U%R3C.
%imilarl3, the drop 1indo1 of cells in event 4' is configured 1ith the reporting range constant
parameter IntraRe!Th%,&r1B in U%R3. -inall3, the filtering 1eight to appl3 during the processing of
both events is given b3 the parameter Be"#ht.
4.4.4.4.3 *vent 4/
*vent 4/ is used to 9eep trac9 of the best cell at all times. The triggering condition for this event is
completel3 defined b3 the h3steresis and time to trigger parameters.
4.4.4.! So$t !ando;er &rocessing
U%R! provided t1o different selectable soft handover algorithmsL %5,GM*T5,/4 and
%5,GM*T5,/!. .n U%R3 the first of these algorithms has been removed so that the U%R3 algorithm
is the U%R! %5,GM*T5,/! algorithm described belo1.
-igure 4 "4 sho1s the processing flo1 of event measurement reports b3 the soft handover algorithm
Bsee `5MGRRMGA/G4ca for a more detailed descriptionC. The algorithm ma9es use of intra"freJuenc3
reporting events 4A, 4', 4& and 4/ onl3. 5ence, a cell is added to the active set 1hen an event 4A is
received Bprovided the active set is not fullC, and a cell is deleted from the active set 1hen an event 4' is
received Bprovided the active set is not empt3C.
Note that onl3 a 4/ event can lead to a drop of the current best cell in the active set. -or eAample, the
processing of an event 4' cannot lead to the drop of the current best cell and that of an event 4& cannot
remove the best cell from the active set to ma9e room for a ne1 candidate cell.
-igure 4"4. .ntra"freJuenc3 soft handover algorithm processing flo1
.n addition, cells are also added to the active set on the reception of events 4& or 4/ triggered b3 a
monitored cell Bnot in the active setC. .n an3 case, before adding a cell to the active set, radio resources
have to be successfull3 reserved, i.e. radio admission control and ,:%- code allocation have to be
successful.
7hen the active set is full, the algorithm relies on event 4& to replace an active set cell 1ith a better
monitored cell and on event 4/ to 9eep trac9 of the best cell in the active set. 7hen the best cell
changes, a ne1 monitored list is built and a M*A%UR*M*NT &,NTR,0 message sent to the U* to
communicate the neighbour list and also update an3 parameters to the settings of the ne1 best cell.
4.4.4.!.4 Monitored 0ist /etermination
The best cell in the active set is used to determine the monitored list. The strateg3 is as follo1sL
.f there is onl3 one cell in the active set, use its neighbour list to build the monitored set list.
.f there is more than one cell in the active set use the neighbour list of the best cell to build the
monitored set list.
.f a 4/ event is received, indicating a ne1 best cell, use the neighbour list of the ne1 best cell to
build the monitored set list.
4.4.4.!.! %ofter 5andover
The decision on 1hether an added radio lin9 should be soft combined 1ith eAisting radio lin9s at the
Node ' or 1hether the ne1 added radio lin9 should be treated as a ne1 %5, leg, is usuall3 left to the
Node '. This is achieved b3 setting the /iversit3 &ontrol field in the N'A) R0 A//.T.,N R*6U*%T
message to ?ma3@. Then it is up to the Node ' to decide 1hether the current radio lin9 is combined 1ith
the alread3 eAisting radio lin9s. 5o1ever, the modification of this behaviour on a per RN& basis is
allo1ed b3 setting the parameter )"$Ctr!,"e!% differentl3.
4.4.4.!.3 /etected %et Management
The purpose of /etected %et Management is to utilize the detection capabilities of the U* and provide
information for the operator to manuall3 update the neighbour cell list of cells. This can be
accomplished b3 recording the number of times a given cell is detected and the identit3 of the cells that
1ere in the active set 1hen a given cell is detected.
.n U%R3, reporting of information of the cells in the monitored set can be enabled and disable through
the parameter )etectStatS/"tch in the A// &*00.NTRA-R*65, command.
4.4.4.!.= %imultaneous A% Update )rocedures
The 3G)) standards allo1 up to = active set update procedures to be ta9en simultaneousl3. 5o1ever,
the RR& in U%R3 is based on a finite"state machine so therefore onl3 supports a single ongoing RR&
procedure Be.g. Active %et Update, Radio 'earer Reconfiguration, etc ...C at a time. .f measurement
reports are received 1hilst a procedure is ongoing, then those measurement reports are Jueued and
processed after1ards. Up to siA 48 events ma3 be Jueued and t1o !8 events Bthese numbers are not
configurableC. The processing of !8 events has higher priorit3 than the processing of 48 events, so !8
events are al1a3s processed first follo1ed b3 48 events. *vents of the same t3pe are processed on a
first"in"first"out basis.
4.4.4.3 !S1DS#! #e #"ange &rocessing
5%"/%&5 cell change Bi.e. 5%"/%&5 handoverC is a ne1 feature in U%R3. The algorithm controls
1hen a U*2s 5%/)A scheduling cell is updated in order to ensure that the best cell is used. 5%"/%&5
cell change is controlled b3 the reception of 48 events and a timer, HS)PATIMERLEN, 1hose
purpose is to prevent 5%"/%&5 cell change occurring too freJuentl3. The timer is started follo1ing an
5%"/%&5 cell change. -urther 5%"/%&5 cell changes are prohibited 1hile the timer is running unless
the current 5%"/%&5 cell is being dropped from the active set altogether. The eAecution of an 5%"
/%&5 cell change is performed differentl3 depending on 1hether the ne1 5%"/%&5 cell is part of the
same Node ' as the old one or part of a different Node '.
4.4.4.3.4 *vent 4'
.f a 4' event indicates that the leg to 1hich the 5%"/%&5 is mapped should be dropped BN'L this ma3
happen because the 5%/)A timer has prevented the 5%"/%&5 moving to the current best cellC then the
5%"/%&5 1ill immediatel3 be moved onto the current best cell BsubOect to admission control, else the
neAt best and so onC irrespective of 1hether or not the 5%/)A timer has eApired.
4.4.4.3.! *vent 4&
.f a 4& event indicates that the leg to 1hich the 5%"/%&5 is mapped should be dropped then the 5%"
/%&5 1ill immediatel3 be moved onto the current best cell BN'L the Oust"added cell is not a candidate
in this processC irrespective of 1hether or not the 5%/)A timer has eApired.
4.4.4.3.3 *vent 4/
.f a ne1 4/ event is received after the 5%/)A timer has eApired then an attempt can be immediatel3
made to handover the 5%"/%&5 to the ne1 best cell as indicated in the 4/ event. .f the 4/ event is
received before the 5%/)A timer has eApired, then Bon the occasions 1here the cell to 1hich the 5%"
/%&5 is currentl3 mapped does not need to be droppedC an attempt is made to handover the 5%"/%&5
to 1hichever cell is registered as the best cell at the time at 1hich the 5%/)A timer eApires. .f the cell
to 1hich the 5%"/%&5 is currentl3 mapped is to be dropped then the 5%"/%&5 is immediatel3 moved
to the ne1 best cell as indicated in the 4/ event irrespective of 1hether or not the 5%/)A timer has
eApired.
4.4.4.3.= 5%"/%&5 to /&5 re"mapping
.f a measurement report indicates that the cell to 1hich a usercs 5%"/%&5 is currentl3 mapped should
be dropped the RN& 1ill first tr3 to handover the 5%"/%&5 to the best cell. .f this is unsuccessful Be.g.
because the best cell does not support 5%/)A or because admission control failsC the RN& 1ill tr3 to
handover to one of the other cells in the active set Bstarting at the neAt best and so on ran9ed in order of
&).&5 *cKNoC. .f no cell can be found to 1hich the 5%"/%&5 can be handed over then the bearer that
is currentl3 mapped to 5%"/%&5 1ill be re"mapped to /&5. The /&5 bearer 1hich is selected is that
1hich most closel3 satisfies the original 6o% reJuirement as provided in the RANA)L URA'
parametersU .*. .f a re"mapping to /&5 is not possible then the bearer 1ill be dropped BN'L no attempt
is made to invo9e an inter"freJuenc3 handoverC.
4.4.4.3.$ 5%"/%&5 cell change eAecution B.nter"Node 'C
7hen an inter"Node ' 5%"/%&5 cell change is performed the RN& signals a MA&"hs reset in both the
Node ' and the U*. All MA&"d )/Us that 1ere in the Node ' MA&"hs Jueue for the source cell are
deleted. The RN& then retransmits all unac9no1ledged AM"R0& )/Us Bbased on the information from
the most recentl3 received R0& status reportC to the MA&"hs at the target cell 1hen the ne1 radio lin9
is activated. The MA&"hs reset procedure triggers the sending of an R0& %tatus )/U b3 the U* but the
RN& algorithms do not rel3 on this )/U to trigger the retransmit of data.
7hen UM R0& mode is used then an3 UM"R0& )/Us that had been sent to the source BoriginalC Node
' and 1hich had not alread3 been transmitted are lost.
4.4.4.3.< 5%"/%&5 cell change eAecution B.ntra"Node 'C
7hen an inter"Node ' 5%"/%&5 cell change is performed the RN& signals a MA&"hs reset in both the
Node ' and the U*, but the MA&"d )/Us that 1ere in the Node ' MA&"hs Jueue for the source cell
are moved across internall3 1ithin the Node ' and placed in the Jueues for the target cell2s MA&"hs
rather than being discarded as 1ould be the case for inter"Node ' cell change.
4.4.4.3.> 5%"/)&&5 po1er offsets
/ifferent settings of the 5%"/)&&5 po1er offsets Bfor A&E, NA&E and &6. fieldsC and repetition
factors Bfor A&EKNA&E and &6. fieldsC ma3 be used depending on 1hether there is 4 Radio 0in9 %et
in the Active %et or more than 4. 5ence 1henever a change to the A% is made a chec9 is done to see
1hether ne1 5%"/)&&5 po1er offset and repetition factor configurations need to be signalled to the
U*.
%:)%)+Dependencies
.ntra"freJuenc3 handover has the follo1ing dependencies K interactions 1ith other algorithmsL
Measurement control
o 48 events are needed to trigger handoverP
&all admission control
o Admission control can prevent cells from entering the Active %etP
RA' mapping
o AM"R0& and MA&"hs parameters should ta9e into account the effects of data loss during
5%"/%&5 cell change.
%:)+ Database parameters
The intra"freJuenc3 handover algorithm can be configured and optimized 1ith the follo1ing commandsL
%*T 5,&,MM
A// .NTRA-R*6N&*00
M,/ .NTRA-R*6N&*00
RM: .NTRA-R*6N&*00
%*T .NTRA-R*65,
A// &*00.NTRA-R*65,
M,/ &*00.NTRA-R*65,
RM: &*00.NTRA-R*65,
%:)3 Jey per$ormance indicators
J&I Description
S!O RR# Signaing
-oad
Bpriorit3T4C
*stimation of signalling load BRR& messagesC reJuired to
support the soft handover algorithm, and so the processing load
associated and bac9haul reJuirements. This is measured in
number of Meas Rpt V A% Update messages per call BandKor secC.
,ther possibilit3 is to eApress this in 9bitKs.
So$t !ando;er Gain
Bpriorit3T4C
Reduction in U* Transmit )o1er 1hen a second leg is added to
the A% Ba cell from a different N', i.e. selectionC, compared to
that of a single leg.
.t can be also measured as the reduction of the *bKNo reJuired
1ith several U0K/0 %5, legs from the value reJuired 1ith onl3
one leg. This is the *bKNo reduction due to %5, procedure
So$ter !ando;er Gain
Bpriorit3T!C
Reduction in U* Transmit )o1er 1hen a second leg is added to
the A% Ba cell from the same N', i.e. combinationC, compared to
that of a single leg.
Acti;e Set Size
Bpriorit3T!C
/istribution BhistogramC of the number of legs in the active set of
a uniforml3 distributed U* population. 5igh active set sizes ma3
indicate too much overlap bet1een cells and so an increase in
neighbour cell interference and a capacit3 decrease.
So$ter !ando;er /actor
Bpriorit3T!C
)ercentage of &%K)% calls that are in soft handover, i.e. having
one or more additional intra"Node' radio lin9s
So$t !ando;er /actor
Bpriorit3T!C
)ercentage of &%K)% calls that are in soft handover, i.e. having
one or more additional inter"Node' radio lin9s
S!O Success Rate
Bpriorit3T4C
Ratio of the number of successfull soft handovers over the total
number of attempts.
'a> &o=er &er #ode
!its
Bpriorit3T!C
)ercentage of time the MaA )o1er per &ode is reached on the
do1nlin9, for the duration of the call. Assuming that cell planning
and )o1er &ontrol are correct, a high value indicates failure to
eAecute soft"5, on time.
&o=er Imbaance bet=een
S!O egs
Bpriorit3T!C
MaA difference in *c.o bet1een all cells in the U* active set, for
the duration of the call. 5igh imbalance means 1rong %5,
parameters, since legs 1ith lo1 po1er compared to the best cell
do not contribute to 6o%.
&o=er Imbaance bet=een
Ser;ing and Neig"bour
#es
Bpriorit3T!C
Min difference in *c.o bet1een monitored and serving cells, for
the duration of the call. 0o1 imbalance denotes that the
neighbour is a good candidate to be added to the active set.
E;ent%> Reporting Rate Number of measurement reports messages that contain a given
Bpriorit3T!C intra"freJuenc3 %5, event per unit time.
Add e;ent response Time
Bpriorit3T4C
.nterval elapsed bet1een the time 1hen the U* transmit an add"
cell event measurement report and the moment 1hen U* sends
the Active %et Update &omplete. Note that this time includes the
N'A) Radio 0in9 %etupKAddition bet1een the RN& and the
Node"'.
Deete E;ent Response
Time
Bpriorit3T!C
.nterval elapsed bet1een the time 1hen the U* transmit a delete"
cell event measurement report and the moment 1hen U* sends
the Active %et Update &omplete. Note that this time does not
include the N'A) Radio 0in9 /eletion bet1een the RN& and the
Node"'
/raction o$ time !S1
DS#! on best ce
Bpriorit3T4C
)ercentage of the time that the 5%"/%&5 is mapped to the best
cell in the Active %et. .f the 5%"/%&5 cell change algorithm is
1or9ing 1ell this value should be high. The 5%"/%&5 ma3 not
be on the best cell because it is 1aiting for the eApir3 of the
5%/)A timer follo1ing a previous cell change. A lo1 value
1ould indicate that the 5%/)A timer is too long or that change
of best cell is happening too freJuentl3.
SDU discard rate $or
!SD&A users
Bpriorit3T4C
Number of AM"R0& %/Us discarded because the number of
transmissions of a )/U, :TB/ATC, has hit the maAimum number
allo1ed, MaA/AT, triggering an %/U discard or R0& reset. The
need to retransmit AM"R0& data follo1ing 5%"/%&5 cell
change Bparticularl3 inter"Node 'C means that :TB/ATC 1ill be
higher than if the U* had been stationar3 Band sta3ed on the same
cellC.
!SD&A dropped ca rate
due to @A'1R-#
unreco;erabe errorA
Bpriorit3T4C
As above but 1here loss of data has led to a dropped call.
/uring the validation of the soft handover algorithm through simulations, the follo1ing performance
metrics 1ere considered.
&all Jualit3 and outage Baverage -*R over the call duration, per callC
RR& signalling load Bmeasurement report and A% update messagesC
Transmitted po1er per cell
Noise rise per cell
Number of active legs per cell
Average number of cells and number of Node 's in the active set
The first high"level statistics to eAamine are the voice Jualit3 B-*RC and outage probabilit3. T3picall3
the -*R target is set at !_, and the outage probabilit3 is defined b3 a -*R threshold 1hich 1as set
Barbitraril3 for the simulationsC at the -*R target V 4_, i.e. !.!_. The meaning of that metric is the
percentage of calls that do not meet their 6o% criterion. An outage 1ould occur e.g. if the maAimum
do1nlin9 TA po1er per code is reached for a long enough period of time. That could happen 1hen the
addition of a better cell to the active set is dela3ed due to the %5, algorithm. This is called call Jualit3
outage probabilit3.
A call Jualit3 outage probabilit3 in the region of 4_ or more points to a possible problem. Note that
1hen stud3ing the E). results, in addition to the mean values, one should also pa3 attention to the
distribution and evolution in time andKor in the cell la3out of the metric. -igure 4 "44 is an eAample
that highlights situations of unacceptable performance of the soft handover algorithm Beven though the
mean outage seems lo1C.
-igure 4"44. *Aample of call Jualit3 outage statistics for %5, algorithm
Another 9e3 metric for the validation is the RR& signalling load reJuired to support the soft handover
algorithm, and so the processing load associated. This includes the number of 4A measurement reports,
active set update, active set update complete and measurement control messages. &learl3, the signalling
load strongl3 depends on the U* mobilit3, cell la3out and fading environment, but in the same situation
this statistic ma3 be a determinant factor to prefer one set of parameters to another.
-inall3, the /0 N' transmit po1er and U0 noise rise characterise the cell load at 1hich the algorithm is
being evaluated, but sho1s little sensitivit3 to implementation details or parameter settings Bat least at
lo1"medium loadC.
%:)2 Optimization guideines
-or the U%R! algorithm B%5,GM*T5,/!C detailed simulation studies 1ere performed to produce
recommended parameter settings and to stud3 the sensitivit3 of the algorithm to variations in those
parameters. The U%R3 algorithm is based on that U%R! algorithm so the results of those studies are
reproduced belo1 for reference. Note ho1ever that the parameter settings recommended in the
spreadsheet that accompanies this document are not based Oust on the results of simulations but include
values actuall3 used in the )orto deplo3ment. Although some settings are the same others are different.
-or those values 1hich differ from the U%R! or )orto recommended settings the U%R! or )orto
recommendations have been included in the comments column.
The )orto net1or9 %5, settings 1ere obtained from eAtensive drive testing during the initial net1or9
deplo3ment in the centre of )orto. The centre is a difficult R- environmentL it is a valle3 1ith a 1ide
river in the middle, narro1 and steep streets 1ith thic9 buildings and a lac9 of 1ide 5, areas 1ith good
cell overlaps due to corner effects, pilot surprise, etc. The )orto settings are designed to give robust
performance in this environment at the eApense of a high signalling load. .n a more open radio
environment 1ith 1ider overlapping 5, areas the U%R! recommendations should give good
performance 1ith a lo1er signalling load.
.n the )orto deplo3ment the &A& 1as not enabled. .n that case it ma9es sense to use non"periodic 4A
and 4& event reporting as it is guaranteed that a successfull3 received report 1ill be acted upon.
5o1ever, it is eApected that &A& 1ill normall3 be enabled so the reference database ma9es use of
periodic mode reporting Bafter the event has been triggeredC to insure against the case 1here an event
cannot be acted upon because a ne1 cell cannot be added to the active set due to admission failure.
Pena!t-T"mer could be used to achieve the same effect 1ithout the need for periodic reporting but there
is then the ris9 that b3 the time the timer has eApired the cell is no longer good N it is recommended that
periodic reporting be used instead of the penalt3 timer.
%:)2)%Sensiti;ity anaysis
The soft handover algorithm has been assessed through simulations, together 1ith the U%R4 ,0)&
algorithm. The assessment 1as carried out in the U%% 1ith the purpose of validating the algorithm
implementation and its performance 1ith a reasonable set of parameter values. This section presents the
results of those simulations.
T1o different scenarios have been consideredL BiC )*/GA at 3 9mKh and BiiC )*/GA at 4 9mKh. The cell
la3out consists of $A$ Node 's, 3"sector B>$ cellsC, eJui"spaced 4 m apart, in 1rap"around mode
Bno border effectsC. The offered traffic is a miA of voice and data services. The data traffic is best effort
performing 1eb bro1sing sessions 1ith t1o different RA's, one s3mmetrical B<=K<= 9bitKsC and another
as3mmetrical B3!K4== 9bitKsC, 1ith a '0*R target of 4_.
The parameter settings used are sho1n in Table 4 "!4. Table 4 "!! and Table 4 "!3 sho1 the call
Jualit3 statistics Bmeasured -*R for voice and '0*R for dataC in uplin9 and do1nlin9. As it can be
seen, the ,0)& tends to lead to a lo1er than reJuested average -*R B.>_ instead of 4_C and much
higher standard deviation. This is a 9no1n behaviour of the U%R4 ,0)&.
&arameter Name Setting
*vent 4A
IntraRe!Th%,&r1A $ d'
H-st(&r1A 3 d'
Tr"#T"me1A <= ms
Per"&%MRRe2&rtNum(&r1A =
Re2&rtInter$a!(&r1A ! sec
4A D 4' Be"#ht
*vent 4'
IntraRe!Th%,&r1B $ d'
H-st(&r1B 3 d'
Tr"#T"me1B <= ms
*vent 4&
H-st(&r1C 3 d'
Tr"#T"me1C <= ms
Per"&%MRRe2&rtNum(&r1C =
Re2&rtInter$a!(&r1C ! sec
*vent 4/
H-st(&r1) = d'
Tr"#T"me1) <= ms
)etectStatS/"tch ,--
)"$Ctr!,"e!% MA(
Pena!t-T"me 3 sec
Table 4"!4. %5, parameter settings used in simulations
Voice /ER 7R8 Data 0-ER 7R8
Scenario Tra$$ic mi> Mean St% Mean St%
P3/&A B 6 9mCh :oice onl3 .>4 .4!= " "
P3/&A B =D 9mCh :oice V /ata
B<=K<=C
.> .4; +.+ .<4
B3!K4==C
.>! .!3+ +.$ <.!<
Table 4"!!. Uplin9 call Jualit3 statistics
Voice /ER 7R8 Data 0-ER 7R8
Scenario Tra$$ic mi> Mean St% Mean St%
P3/&A B 6 9mCh :oice onl3 4.3 .3$ " "
B<=K<=C
4.3 .3$ 4. .+
B3!K4==C
4.< .<< 4.3 .=$
Table 4"!3. /o1nlin9 call Jualit3 statistics
%tatistics on the RR& signalling load reJuired to support %5, are given in Table 4 "!=, together 1ith
some metrics related to the associated RN& processing load. -inall3, the average Node ' transmit
po1er is about < 7 and the uplin9 noise rise about 4 d'. T3picall3, onl3 !_ to 3_ of the calls have
more than one cell in their active set.
Scenario S Tra$$ic mi>
Signaing 3&"ce &n!-
:Cm*h
3&"ce D E+*E+
1FCm*h
3&"ce D
:<*1++
1FCm*h
Meas"rement Re<ort =A !,4<! !,>= 4,4!=
Meas"rement Re<ort =- ;;= 4,<$= <$
Meas"rement Re<ort =C 3;$ <!; !>$
Meas"rement Re<ort =/ ;<> 4,3<! $++
Meas"rement Re<ort 2?+9* 4?5%* +?62*
Active Set @<$ate 3?:4* 2?%64 %?95%
Meas"rement Control ;<> 4,3<! $++
Total %%?+*% %4?%2: 5?%*9
Avg E MRs <er call 4.+ $.4 !.>
Avg E AS "<$ates <er
call
4.= 3.> !.
Avg E A$$ (eg <er call 4.4 !.$ 4.$
Avg E /ro< (eg <er call .$ !. .+
Table 4"!=. %ignalling and processing load statistics
-urther to these simulation studies, a sensitivit3 anal3sis of the soft handover algorithm 1as performed,
1ith voice traffic onl3, in order to investigate the effect of the variation of a number of parameters on
the s3stem performance. The emphasis of the anal3sis 1as on events 4A and 4' parameters, but also
some radio environment factors 1ere varied. -ollo1ing there is a summar3 of the findings.
4.=.4.4 Reporting range o$ e;ent %A and e;ent %0
:ariation of the reporting range of event 4A BR4aC and event 4' BR4bC, together 1ith the h3steresis
value, effectivel3 changes the size of the handover 1indo1, i.e. the difference bet1een the *c.o level at
1hich a cell is added to the active set and that at 1hich a cell is deleted from the active set.
-or a fiAed R4b, the signalling load increases 1ith R4a, both in terms of measurement reports and
active set updates. Using R4aT3 d' ma9es it too difficult for a cell to Ooin the active set, 1hich
translates into higher inter"cell interference and higher number of U*s reaching the maAimum po1er per
code in the do1nlin9. ,n the other hand, R4aT> d' ma9es too eas3 for a cell to Ooin the active set,
1hich means higher signalling load and a larger size of the active set. Therefore R4aT$ d' is a
compromise bet1een signalling load, average active set size and radio resource usage.
7hen R4a is fiAed, the average active set size increases 1ith R4b. This is due to the fact that a cell can
sta3 longer in the active set, even 1hen its *c.o is degrading. %o R4bT$ d' is preferred over R4bT > d'
since it leads to lo1er resource utilisation, although higher RR& signalling. Note that the effect of R4b
parameter is compounded b3 the event 4& parameter settings, 1hich ma3 be responsible of deleting
cells from the active set that 1ould have sta3ed there other1ise for R4bT> d'. This is the reason 1h3
higher interference level is not sho1n in the simulations 1hen R4bT> d'.
4.=.4.! Time1to1trigger o$ e;ent %A and e;ent %0
%imulations from different values of the time"to"trigger parameter for event 4A BT4aC and event 4'
BT4bC in the range from sec to 4!; ms, sho1ed lo1 sensitivit3 in the average number of cells and
Node 's in the active set as 1ell as the call Jualit3.
Regarding the signalling load, for a given T4b, as T4a increases, the number of MRs triggered b3 event
4A decreases. 5ence, also decreases the number of MRs triggered b3 other events B4' D 4&C since the
average active set size decreases too. -or a given T4a, as T4b increases, the number of MRs triggered
b3 event 4' decreases but those triggered b3 event 4& increases as 4& is triggered before 4' in this
situation. Also, since 4& is li9el3 to lead to a s1ap of cells in the active set, it reduces the number of
events 4A too.
Results of time"to"trigger values are not conclusive, partl3 because the E).s are not appropriate, and
partl3 because it 1as not foreseen that the settings of event 4& parameters influence the results. 5ence a
value of <= ms is initiall3 chosen for both events 4A and 4', as a compromise bet1een signalling load
and handover speed.
4.=.4.3 #&I#! po=er
The variation of &).&5 po1er from 47 to !7, has a clear impact on the net1or9 interference level as
the minimum do1nlin9 transmit po1er from each cell increases. 5o1ever, it has no impact on the
signalling load or the number of cells and Node 's in the active set. This is consistent 1ith the fact that
the %5, algorithm does not use absolute events 4* and 4-, but onl3 events based on the relative
comparison of *c.o levels. .n addition, the voice call Jualit3 1as identical Bmean and std"dev of -*RC
and meeting the target values. This means that the s3stem 1as properl3 dimensioned for 47 &).&5 and
that no coverage advantage 1as gained from increasing the &).&5 po1er.
4.=.4.= -oading 7carried tra$$ic8
.n the simulations, the cell load 1as increased from 3 to =$ voice calls per cell on average to see the
impact on s3stem performance. Results sho1ed basicall3 no difference in the statistics apart from an
increase in the do1nlin9 transmit po1er and uplin9 noise rise. 5ence it 1as conclude that the s3stem
could handle the offered load Bnote that there is no ,:%- code limitationC and that further runs at <
and >$ voice calls per cell could be of interest.
4.=.4.$ Radio c"anne mode
.n addition to the algorithm parameters, the s3stem performance also depends on the characteristics of
the radio environment. .n the simulations, t1o different 1ell"9no1n radio models 1ere used, )edestrian
A and :ehicular A. The )edestrian A channel is not ver3 dispersive. At most t1o paths contribute
significantl3 to the received signal level and one of them is 4 d' belo1 the other one on average. ,n
the contrar3, the :ehicular A model is much more dispersive, 1ith mostl3 four paths contributing to the
signal 1ithin 4 d' of each other on average.
Results sho1 that the RR& signalling load metrics are not affected b3 the channel model considered.
This is clearl3 an advantage of using soft handover events based on relative thresholds, 1hich 1ould not
be the case 1ith events 4* and 4-. Also, there is an increased do1nlin9 transmit po1er and lo1er noise
rise in the uplin9 for the :ehicular A channel, as eApected from the higher number of multipaths.
4.=.4.< UE 'obiity
As a pilot scenario, a simulation run 1as carried out increasing the mobilit3 of the U* population to a
constant speed of 3 9mKh for all mobiles, as opposed to the usual speed distribution 1ith 4<.! 9mKh on
average, all other conditions and parameters being eJual. Unsurprisingl3, the results sho1 an increase in
the measurement reporting rate and active set update closel3 related to the speed ratio bet1een both
scenarios. Also, the average do1nlin9 transmit po1er increases b3 nearl3 !$_ 1hile the noise rise is
unaffected.
%:)4 !ard "ando;er
%:)4)%Introduction
Although softKsofter handover is the preferred procedure to handle RR& connection mobilit3 in U%R!,
there are times 1hen onl3 a hard handover can be performed. The hard handover procedure removes all
the R0BsC in the active set and establishes ne1 R0BsC. An intra"freJuenc3 hard handover is onl3
performed 1hen one of the follo1ing conditions appliesL
There is no .ur interface bet1een the source and target RN&.
The U* is using a )% RA' at a bit rate above a preset threshold BEB"tRateTh%.
.f one of the conditions described above holds, intra"freJuenc3 hard handover is performed on the
reception of 4/ events. Then the handover criteria are controlled b3 the parameters H-st(&r1) and
Tr"#T"me1). ,nce the hard handover is eAecuted, the monitored set becomes the neighbour list of the
ne1 best cell.
%:)4)+Dependencies
.ntra"freJuenc3 hard handover has the follo1ing dependencies K interactions 1ith other algorithmsL
Measurement controlL 4/ events are needed to trigger handover.
&all admission controlL can prevent cells entering the Active %et.
%RN% relocation.
%:)4)3Jey per$ormance indicators
J&I Description
'a>) &o=er &er #ode !it
Rate
Bpriorit3T4C
)ercentage of U*s hitting their maAimum po1er per code Bor the
number of times each U* hits its maAimum po1er per codeC.
U*s in hard handover 1ill hit their maAimum po1er per code
more freJuentl3 than U*s in soft handover as the3 approach the
cell coverage edge.
!!O Success Rate
Bpriorit3T4C
Ratio of the number of successful hard handovers over the total
number of attempts. .f the cell is too large, or the hard handover
rate too high, then significant numbers of dropped calls 1ill
occur due to failed 55,.
#e TT &o=er
Bpriorit3T!C
Average cell T8 po1er. Useful for comparing cost of high
po1ered single leg Bin 55,C vs several lo1er po1ered legs Bin
%5,C.
%:)4)2Optimization guideines
The parameter BEB"tRateTh% gives the operator the possibilit3 to handle best effort services 1ith bit
rates above certain threshold in hard handover. This is to avoid emplo3ing too man3 valuable resources
B,:%- codes, Node ' po1er, 'ac9haul, etc MC on radio bearers and coverage areas for 1hich the
s3stem has not been designed.
0 50 100 150 200 250 300 350 400
0
5
10
15
20
25
30
35
40
45
DL max power per code for Data UE (Voice + Data 64/64)
M
a
x

P
w
r

p
e
r

C
o
d
e

l
i
m
i
t

(
%
)
#calls
64k HHO
64k SHO
-igure 4"4!. )ercentage of U*s that reach the maA po1er per code for a service of <=9 data,
for each simulation run in case of %5, :s 55,
The Juestion of 1hether it is more efficient to operate data calls Babove certain rateC in hard handover or
in soft handover has been initiall3 addressed 1ith a comparison of <=K<= and 3!K4== RA's in both soft
and hard handover. -rom the point of vie1 of interference and do1nlin9 po1er consumption, in 55, it
is eApected higher po1er to be transmitted from one cell, 1hereas in %5, lo1er po1er is eApected to be
transmitted from more than one cell. This increases the probabilit3 of reaching the maAimum po1er per
code in the case of 55, as it can be seen in -igure 4 "4! for the case of a <=K<=9 data service 1ith
and 1ithout soft handover. ,n the other hand, from an ,:%- code and bac9haul point of vie1, it is
obviousl3 more efficient to operate high data rate services in 55, as fe1er resources are consumed.
The balance bet1een hardKsoft handover and resource utilisation is closel3 lin9ed to the guaranteed
service coverage given b3 the operator. /uring cell planning, the net1or9 is normall3 designed to have
voice coverage in all the cell area, and also for data services up to a certain rate Busuall3 <= 9bitKsC.
Then, for services 1ith a higher rate, coverage can onl3 be achieved if soft handover is used, as
other1ise the maAimum po1er per code is hit s3stematicall3. Then, for even higher rate services, onl3
ver3 limited coverage is possible 1ithin the cell, irrespective of 1hether %5, is enabled or not. A rule of
thumb is to set BEB"tRateTh% to the maAimum bit rate 1ith guaranteed cell coverage.
%%#ompressed 'ode
%%)% O;er;ie=
%%)%)%Description
&ompressed mode is used to allo1 U*s to perform inter"freJuenc3 and inter"RAT measurements. The
prereJuisite is that the U* supports the functionalit3. U%R3 supports compressed mode in uplin9,
do1nlin9 and combined uplin9 V do1nlin9, according to U* capabilities.
&ompressed Mode B&MC operation is used 1hen a dual mode U* BUMT% V G%M andKor /&%4;C or
a dual band U* BUMT% V UMT%C nears the limit of coverage in a UMT% s3stem that borders a G%M,
/&%4;, or another UMT% s3stem on a different freJuenc3. The &M algorithm creates a ?hole@ or
gap in the transmitted /0 andKor U0 radio frame, allo1ing the U* receiver to change freJuenc3 and
monitor the adOacent G%M or /&%4; s3stem Bfor inter"RAT handoverC or UMT% s3stem Bfor inter"
freJuenc3 handoverC. *ven though there is a gap in the transmitted frame no data is lost. All of the data
that 1ould normall3 have been sent in the frame is compressed to fit into fe1er slots.
The process for compressing the data to fit into fe1er than the normal 4$ slots is called ?time
compression@. %everal time compression methods are availableL spreading factor reduction b3 ! B%-K!C,
puncturing Brate matchingC, and higher la3er scheduling. )uncturing refers to appl3ing rate matching
techniJues for creating a transmission gap in a radio frame. %-K! consists of reducing the spreading
factor b3 ! during one compressed radio frame to enable transmission of the information bits in half of
the radio frame B>.$ slotsC. And in the higher la3er scheduling method, onl3 a subset of the allo1ed
T-&s is used in the compressed mode frame. .n U%R3 puncturing and spreading factor reduction b3 !
are supported. Note ho1ever that due to lac9 of support of puncturing b3 most U*s, it is currentl3
being considered 1hether to delete puncturing and introduce 5&% in a later version of U%R3.A.
The U* can be configured 1ith a single compressed mode pattern seJuence for each measurement
purpose. The follo1ing t3pes of gap patterns can be configured per RN& via the compressed mode
purpose BTGMPC attribute in the %*T TG)%&) command.
-or inter"freJuenc3 measurements
o -// measurement
-or inter"RAT measurements
o G%M carrier R%%. measurement
o .nitial '%.& identification
o '%.& reconfirmation
/epending on 1hether the U* needs to perform -// measurements onl3, G%M measurements onl3 or
both, the RN& activates the appropriate gap patterns. -or -// operation onl3, a single ?-//
measurement@ gap is activated. -or G%M operation onl3, three simultaneous gap patterns are activated
BR%%., '%.&G./, and '%.&Gre"confirmC. And for combined -// and G%M operation, three
simultaneous gap patters are used BR%%., '%.&G./ and -// measurementC. The '%.& re"confirmation
gap pattern is not used 1hen the U* needs to measure simultaneousl3 inter"freJuenc3 and inter"RAT
neighbours in order to decrease the impact of compressed mode operation on Jualit3 and performance.
The compressed mode procedure is initiated b3 the &RN& in U%R3 b3 sending a RA/., 0.NE
R*&,N-.GURAT.,N )R*)AR* message to the Node ' 1ith a modification of the Transmission Gap
)attern %eJuence &ode .nformation radio lin9 parameters. ,n the other hand, deactivation is achieved
via the &,M)R*%% M,/* &,MMAN/.
The 5,%7.T&5 parameter in the %*T &,RRMA0G,%7.T&5 command is used to configure
do1nlin9 &M operation via the &M&-G%U))G%7.T&5 flag (o<en iss"e for @SR6: this flag a<<ears
to be no longer available). 7hen the &M&-G)UN&TUR.NGG%U))G%7.T&5 flag is set, do1nlin9
frame time compression b3 puncturing is allo1ed, other1ise %-K! is used in all cases.
44.4.4.4 Gap pattern description
The follo1ing parameters characterise the transmission gap pattern according to 3G)) !$.!4$.
TGSN BTransmission Gap %tarting %lot NumberC. A transmission gap pattern begins in a radio
frame, henceforth called first radio frame of the transmission gap pattern, containing at least one
transmission gap slot. TG%N is the slot number of the first transmission gap slot 1ithin the first
radio frame of the transmission gap pattern.
TGL1 BTransmission Gap 0ength 4C. This is the duration of the first transmission gap 1ithin the
transmission gap pattern, eApressed in number of slots.
TGL< BTransmission Gap 0ength !C. This is the duration of the second transmission gap 1ithin the
transmission gap pattern, eApressed in number of slots. .f this parameter is not eAplicitl3 set b3
higher la3ers, then TG0! T TG04.
TG) BTransmission Gap start /istanceC. This is the duration bet1een the starting slots of t1o
consecutive transmission gaps 1ithin a transmission gap pattern, eApressed in number of slots. The
resulting position of the second transmission gap 1ithin its radio frameBsC shall compl3 1ith the
limitations of 3G)) T% !$.!4!. .f this parameter is not set b3 higher la3ers, then there is onl3 one
transmission gap in the transmission gap pattern.
TGPL1 BTransmission Gap )attern 0engthC. This is the duration of transmission gap pattern 4,
eApressed in number of frames.
TGPL< BTransmission Gap )attern 0engthC. This is the duration of transmission gap pattern !,
eApressed in number of frames. .f this parameter is not eAplicitl3 set b3 higher la3ers, then TG)0!
T TG)04.
Motorola &onfidential )roprietar3 4!4

Transmission
Transmission gap 2
gap 2
TGSN TGSN
TGL2 TGL2
TG pattern 2
#TGPRC
gap 1
Transmission Transmission
gap 1
TGD TGD
TGPL1 TGPL2
TG pattern 1 TG pattern 2
TGL1 TGL1
#1 #2 #3 #4 #5
TG pattern 1 TG pattern 1 TG pattern 2 TG pattern 1 TG pattern 2
-igure 44"43. .llustration of compressed mode pattern parameters
.n addition, the follo1ing parameters control the transmission gap pattern seJuence start and repetition.
TGPRC BTransmission Gap )attern Repetition &ountC. This is the number of transmission gap
patterns 1ithin the transmission gap seJuence. Note that onl3 infinite TG)R& is supported in
U%R3.
TGC,N BTransmission Gap &onnection -rame NumberC. This is the &-N of the first radio frame
of the first pattern 1ithin the transmission gap pattern seJuence.
The pattern parameters that define a gap seJuence are defined at the RN&. The s3stem operator cannot
add, delete, or modif3 the parameters. 5o1ever, the RN& manufacturer can set or change the gap
pattern parameters 1ith the %*T TG)%&) internal command. The patterns are selected based on
METHO), CELL T;PE, and TGPS BTransmission Gap )attern %eJuence, also referred to as
Transmission Gap Measurement )urpose " TGMPC.
INTER1RAT GA& &ATTERNS
-or UMT% to G%M hard handovers, three TG)%s Bmeasurement t3pesC are usedL R%%.,
'%.&G:erification, and '%.&GReconfirm. These three t3pes of patterns are run simultaneousl3 and
form a ?composite@ pattern. The RN& has three sets of composite patterns predefined in soft1are for
U%R!, sho1n in Table 44 "!$, Table 44 "!< and Table 44 "!>.
.n total the RN& can support up to eight sets of patterns Bin addition to the eight inter"freJuenc3
patternsC. The %*T TG)%&) command is used to enter additional sets of patterns or to modif3 an3 of
the pattern sets including the predefined sets. The -rame Mode column indicates if the gap is a single
frame gap or a double frame gap Bthe gap spans a radio frame boundar3C. The double frame method
allo1s the definition of longer gaps since the specifications set a maAimum idle length of > slots per one
4 ms radio frame. 7hen the transmission gap spans t1o consecutive radio frames, parameters must be
Motorola &onfidential )roprietar3 4!!
chosen so that no more than > slots in each radio frame are idle.
Meth&%L )uncturing
Ce!! T-2eL 0o1 %peed, Middle %peed, 5igh %peed
TG)%
TF(
=
BslotC
TF(>
BslotC
TF/
Bslot
C
TFP(
=
Bframe
C
TFP(
>
Bframe
C
Treconfbort
BsecC
Ni$abort
BpatternC
FSM$eltaCfn
BframeC
TFSN
Bslot
ZC
7rame
Mo$e
RSSI $ $ 4$ 4! TG)04 "" "" $ %ingle
0SI#M
Veri$ication
4 TG04 !> 4! TG)04 "" != = 4 /ouble
0SI#M
Recon$irm
4 TG04 !> 4! TG)04 3. "" = 4 /ouble
Table 44"!$. )uncturing gap pattern parameters for inter"RAT
Meth&%L %-K!
Ce!! T-2eL 0o1 %peed
TG)%
TF(
=
BslotC
TF(>
BslotC
TF/
Bslot
C
TFP(
=
Bframe
C
TFP(
>
Bframe
C
Treconfbort
BsecC
Ni$abort
BpatternC
FSM$eltaCfn
BframeC
TFSN
Bslot
ZC
7rame
Mo$e
RSSI 4 4 >$ != TG)04 "" "" 4 /ouble
0SI#M
Veri$ication
4= TG04 !> != TG)04 "" !! + ; /ouble
0SI#M
Recon$irm
4= TG04 !> != TG)04 $. "" $ ; /ouble
Table 44"!<. %-K! gap pattern parameter set Z4 for inter"RAT
Meth&%L %-K!
Ce!! T-2eL Middle %peed and 5igh %peed
TG)%
TF(
=
BslotC
TF(
>
BslotC
TF/
Bslot
C
TFP(
=
Bframe
C
TFP(
>
Bframe
C
Treconfbort
BsecC
Ni$abort
BpatternC
FSM$eltaCfn
BframeC
TFSN
Bslot
ZC
7ram
e
Mo$e
RSSI $ $ 4$ 4! TG)04 "" "" $ %ingle
Motorola &onfidential )roprietar3 4!3
0SI#M
Veri$ication
> > 3; 4! TG)04 "" != 3 > %ingle
0SI#M
Recon$irm
> > 3; 4! TG)04 3. "" $ %ingle
Table 44"!>. %-K! gap pattern parameter set Z! for inter"RAT
The ?&ell T3pe@ ro1 in the tables above is related to the setting of the cell parameter Cmc(Ce!!T-2e
1ith the A// &*00&M&- command as follo1sL
?0o1 %peed@ refers to 0,7G%)**/GAN/GM*/.UMG&,:*RAG*G&*00,
0,7G%)**/GAN/G5.G5G&,:*RAG*G&*00
?Middle %peed@ refers to M./G%)**/GAN/G5,TG%),TG&*00
?5igh %peed@ refers to 5.G5G%)**/GAN/GM*/.UMG&,:*RAG*G&*00,
5.G5G%)**/GAN/G5.G5G&,:*RAG*G&*00,
5.G5G%)**/GAN/G5,TG%),TG&*00
The remaining enumerations 7A0E.NGG%)**/GAN/G5,TG%),TG&*00 and
,T5*RG&*00 do not have predefined gap patterns associated 1ith them
All three TG)% measurement patterns BG%MG&ARR.*RGR%%.GM*A%UR*M*NT,
G%MG.N.T.A0G'%.&G./*NT.-.&AT.,N, G%MG'%.&GR*"&,N-.RMAT.,NC run simultaneousl3
but have their starting &-N B&onnection -rame NumberC offset b3 the FSM
$eltaCfn
value in the tables so
that the3 do not overlap Bnote that the command %*T &M&-/*0TA&-N is used to set the FSM
$eltaCfn
values, and that improper settings can result in gap overlapC. To determine the &-N for a particular
measurement pattern 1hen starting compressed mode at the Node ' and U* the follo1ing formula is
used.
TFC7N
RSS.
T B/eltaC7N V C7N
c"rr
V C M,/ !$<
TFC7N
-S.C&verification
T BC7N
RSS.
V FSM$eltaCfn=C M,/ !$<
TFC7N
-S.C&reconfirm
T BC7N
-S.C&verification
V FSM$eltaCfn>C M,/ !$<
1here
TFC7NL &-N of the first radio frame of the first pattern 1ithin the TG)%,
/eltaC7N is set 1ith the command %*T &M&- per RN& Bdefault ; framesC,
C7N
c"rr
is the current &-N BframesC,
FSM$eltaCfn='> is the frame offset for TG)% measurement t3pe.
The N
i$abort
column refers to the ?N .dentif3 abort@ .* 1ithin the ?/)&5 compressed mode info@ .*.
This indicates the maAimum number of repeats of patterns that the U* shall use to attempt to decode the
Motorola &onfidential )roprietar3 4!=
G%M cell '%.& Bnote that TG)04 and TG)0! are considered separate patternsC. %imilarl3, the T
reconfabort
column B3G)) ?T Reconfirm abort@ .*C indicates the maAimum time allo1ed for '%.& re"confirmation
of a G%M cell.
-inall3 note that some patterns in the tables have TG/ T !>, this means that there is onl3 one
transmission gap in the transmission gap pattern.
Impementation constraint
Note that, although there is no 9no1n design reason for it, the follo1ing implementation constraint has
been verified through testing and the parameters should be set accordingl3L
)e!taC,N V TGPL1 V TGPL< W !$<.
INTER1/RE, GA& &ATTERNS
The RN& has four patterns predefined in soft1are BU%R3C for UMT% to UMT% hard handovers. These
patterns are sho1n in Table 44 "!;.
.n total the RN& can support up to eight inter"freJuenc3 patterns Bin addition to the eight inter"RAT
pattern setsC. The ?%*T TG)%&)@ command is used to enter additional patterns or to modif3 an3 of the
pattern sets including the predefined sets.
TG)% TF(=
BslotC
TF(>
BslotC
TF/
BslotC
TFP(=
BframeC
TFP(>
BframeC
TFSN
BslotZC
7RAM3
M5/3
M3T)5/ C3((
TGP3
TG&S a > > != 4 TG)04 > %ingle %-K! default
TG&S b > > != = TG)04 > %ingle %-K!
5igh
%peed
TG&S c 4 $ = 4 TG)04 4
/ouble D
%ingle
)uncturing default
TG&S d 4 $ = $ TG)04 4
/ouble D
%ingle
)uncturing
5igh
%peed
Table 44"!;. .nter"freJ gap pattern parameter sets
44.4.4.! /rame Structure Types in #ompressed 'ode
The frame structure for uplin9 compressed frames is illustrated in -igure 44 "4=.
Motorola &onfidential )roprietar3 4!$
%lot Z BN
last
V 4C
/ata
)ilot T-&. -'. T)&
%lot Z BN
first
N 4C
/ata
)ilot T-&. -'. T)&
transmission gap
-igure 44"4=. -rame structure in uplin9 compress mode transmission
.n the do1nlin9, there are t1o different t3pes of frame structures defined for compressed frames. T3pe A
maAimises the transmission gap length and t3pe ' is optimised for po1er control.
7ith frame structure of t3pe A, the pilot field of the last slot in the transmission gap is transmitted.
Transmission is turned off during the rest of the transmission gap B-igure 44 "4$C.
%lot Z BN
first
" 4C
T
)
&
/ata4
T-
&.
/ata! )0
%lot Z BN
last
V 4C
)0 /ata4
T
)
&
T-
&.
/ata! )0
transmission gap
-igure 44"4$. /0 frame structure t3pe A
7ith frame structure of t3pe ', the T)& field of the first slot in the transmission gap and the pilot
field of the last slot in the transmission gap is transmitted. Transmission is turned off during the rest
of the transmission gap B-igure 44 "4<C.
%lot Z BN
first
" 4C
T
)
&
/ata4
T-
&.
/ata! )0
%lot Z BN
last
V 4C
)0 /ata4
T
)
&
T-
&.
/ata! )0
transmission gap
T
)
&
-igure 44"4<. /0 frame structure t3pe '
The frame structure t3pe is predefined in U%R3 to slot format t3pe A for all TG)s. This attribute can be
modified b3 the s3stem manufacturer through the parameter )L,rameCate#&r- in the %*T TG)%&)
command.
44.4.4.3 &o=er #ontro in #ompressed 'ode
.n compressed mode, compressed frames ma3 occur in uplin9, do1nlin9 or both. .n compressed frames,
the transmission of /)/&&5BsC and /)&&5 is stopped during transmission gaps. The aim of po1er
control in uplin9 or do1nlin9 compressed mode is to recover as fast as possible a %.R close to the target
%.R, after each transmission gap.
Motorola &onfidential )roprietar3 4!<
'asicall3, the behaviour is the same in compressed mode as in normal mode, eAcept that the target %.R
and step size is offset b3 higher la3er signalling, as specified in T% !$.!4=, during a given recover3
period, eApressed as a number of slots. .n the U*, offsets are computed from database parameters
'E)e!taSIR1, 'E)e!taSIRA(ter1, and Bif 'E)e!taSIR<3a!"% and 'E)e!taSIRA(ter<3a!"% are set to
?:alid@C 'E)e!taSIR<, and 'E)e!taSIRA(ter<. 0i9e1ise the Node ' offsets are computed from
N&%eB)e!taSIR1, N&%eB)e!taSIRA(ter1, and Bif N&%eB)e!taSIR<3a!"% and
N&%eB)e!taSIRA(ter<3a!"% are set to ?:alid@C N&%eB)e!taSIR<, and N&%eB)e!taSIRA(ter<.
.n addition, the parameters ITP B.nitial Transmit )o1er modeC and RPP BRecover3 )eriod )o1er
control modeC further define transmit po1er control behaviour in compressed mode. The po1er control
method .T) Mode and 4 operate in the uplin9 and R)) Mode and 4 operate in both the uplin9 and
do1nlin9. Use of .T) Mode and R)) Mode are eJuivalent to non compressed mode or normal mode
BNMC operation.
.n U%R3, compressed mode po1er control parameters are predefined to the follo1ing values for all
transmission gap patterns.
ITP T 4
RPP T
'E)e!taSIR1 T 'E)e!taSIRA(ter1 T d'
'E)e!taSIR< T 'E)e!taSIRA(ter< T d'
N&%eB)e!taSIR1 1 N&%eB)e!taSIRA(ter1 1 D $-
N&%eB)e!taSIR< 1 N&%eB)e!taSIRA(ter< 1 D $-
44.4.4.= #ompressed 'ode Operation
U* and Node ' compressed mode operation is triggered b3 the inter"RAT or inter"freJuenc3 handover
algorithm 1hen certain criteria are met. RN& processing for compressed mode control can then be
summarised in the follo1ing steps and functions.
4. &ompressed mode activation. The trigger condition for the initiation of compressed mode Bi.e.
measurement of inter"RAT andKor inter"freJ neighboursC is 1hen the current active set Jualit3 is
belo1 the !/ event threshold and the strongest cell in the active set has inter"freJuenc3 andKor
inter"RAT neighbours defined. %imilarl3, compressed mode is eAited, at a radio frame boundar3,
1hen the current active set Jualit3 is above the !- threshold or 1hen the U* is commanded to
handover to another RAT and leave the UMT% s3stem.
!. %election of U0 onl3, /0 onl3 or U0 and /0 compressed mode operation is based on U*
capabilities Bsingle or dual receiverC and neighbouring cell information Bi.e. RatCe!!T-2e and
Ban%In% settings of the A// G%M&*00 commandC.
/0 onl3. To allo1 single receiver U*s to measure G%M '&&5 or &).&5
U0 and /0. To allo1 single receiver U*s to measure close"b3 carriers Be.g. /&% 4; and
Motorola &onfidential )roprietar3 4!>
other -// freJuenciesC
U0 onl3. To allo1 dual receiver U*s to measure close"b3 freJuencies
3. %election of the compressed mode method B%-K! or puncturingC
.n the uplin9, onl3 spreading factor reduction is used.
.n the do1nlin9 U%R3 soft1are supports both %-K! and puncturing. The parameter
S,TurnP&"nt defines the minimum spreading factor for 1hich %- reduction is applied.
)uncturing is applied if the current RA' %- is less than S,TurnP&"nt provided that the
&M&-G)UN&TUR.NGG%U))G%7.T&5 flag is set.
.f %-K! method is selected and the desired %- code is not available, use alternative
scrambling codes.
=. %election of the transmission gap pattern parameters from the predefined set b3 the setting of
parameters Cmc(Ce!!T-2e and S,TurnP&"nt. Note that both U* and Node ' must use the
same gap pattern if U0 and /0 compressed mode is active, but not necessaril3 the same time
compression method.
$. .nitiate compressed mode operation at the U* and Node ' b3 sending a RA/., 0.NE
R*&,N-.GURAT.,N )R*)AR* message to the Node '.
Note that during and follo1ing a transmission gap pattern, alternative po1er recover3 modes are
available as described in section 44.4.4.3.
Impementation constraint
Note that the %-K! compression method is al1a3s used for AMR voice calls, including the case 1hen it
is a multi"RA' call 1ith an AMR voice RA'.
%%)%)+Dependencies
&ompressed mode is Oust a handover support function. .t is triggered b3 RN& 1hen the measurements
of inter"RAT 55, and inter"-R6 55, are initiated. Under these cases, &M actions are basicall3 the
same, but the parameters selected are different for the t1o 55, algorithms. &M is a passive algorithm
1hich is triggered b3 inter"RAT 55, and inter"-R*6 55, onl3, but it does not trigger other
algorithms. /uring the &M operation, the normal po1er control method is modified.
Motorola &onfidential )roprietar3 4!;
%%)+ Database parameters
The related database parameters includeL ,DM parameters and .nternal )arameters N Transmission
Gap )atterns and )o1er &ontrol in &ompressed Mode. The follo1ing commands can be used to set the
above parametersL
%*T &M&-
%*T TG)%&)
A//KM,/ &*00&M&-
The detailed commands and corresponding parameters can be found in the reference spreadsheet.
%%)3 Jey per$ormance indicators
J&I Description
SIR De;iation in #'
Bpriorit3T!C
MaA, Avg, %td deviation of %.R *rror Btarget " estimatedC in
compressed mode frames, for the duration of the call
A'R ,uaity in #'
Bpriorit3T4C
M,% BMean ,pinion %coreC during compressed mode operation for
AMR services
D- T> &=r Increase
in #'
Bpriorit3T4C
)ercentage increase of do1nlin9 transmit po1er during compressed
mode frames compared to normal frames. &ompressed mode frames
are sent 1ith higher po1er than normal frames to compensate for the
lo1er %- or higher puncturing.
UE T> &=r Increase
in #'
Bpriorit3T!C
)ercentage increase of U* uplin9 transmit po1er during compressed
mode frames compared to normal frames
Time to report inter1
RAT neig"bour
Bpriorit3T!C
Average time reJuired b3 the U* to measure and report an inter"RAT
neighbourP from the time the neighbour cell has a value above
threshold until the time 1hen the measurement report is sent.
Averaged over all cells in the neighbour list
0SI# Decode Time
Bpriorit3T4C
Average time reJuired b3 the U* to decode the '%.& of an inter"RAT
neighbourP from the moment RA0ev is above threshold until the
moment 1hen a measurement report is sent
&rob 0SI# Decoding
Bpriorit3T4C
)ercentage of inter"RAT 55, attempts to a neighbours 1hich '%.&
has been decoded, over total number of attempts
%%)2 Optimization guideines
%%)2)%&arameters optimization
%election of the desired time compression method in the do1nlin9 is performed b3 setting the cell
parameter S,TurnP&"nt4 Generall3, spreading factor reduction is a safer method from the point of vie1
of radio bearer performance under compressed mode since no data is lost BOust compressed into fe1er
Motorola &onfidential )roprietar3 4!+
slotsC. The dra1bac9 is the subseJuent shortage of ,:%- codes and higher interference introduced into
the s3stem Bi.e. capacit3 decreaseC. ,n the contrar3, puncturing removes bits from the encoded bit
stream, thereb3 decreasing the coding gain. This ma3 lead to bloc9 retransmissions especiall3 at high
data rates.
%imulations have also sho1n good performance for voice service in compressed mode through %-K!.
Therefore the recommendation is to use %-K! for voice and lo1 data rate services Bi.e. up to <= 9bitKsC
and puncturing for high data rate services.
-inall3, selection of the gap pattern out of the available set for each measurement purpose is achieved
b3 the setting of the Cmc(Ce!!T-2e parameter. &urrentl3, t1o different default sets are provided for each
compressed mode method, one for high speed environment and another for lo1"medium speed. The idea
here is to account for the radio channel variation, and so shorter and more freJuent gaps are preferred
for high speed environments as opposed to longer and less freJuent gaps. Note, ho1ever that the
measurement occasion, in total, is similar in both cases.
&arameter #omments
Cmc(Ce!!T-2e According to U* mobilit3 environment
S,TurnP&"nt )uncturing is preferred for high data rates, sa3
above <= 9bitKs
)e!taC,N ; frames
The s3stem manufacturer must ensure that the TG)% parameter set predefined at the RN& provides
good enough performance under a variet3 of scenarios, i.e. gives enough fleAibilit3 to the net1or9
operator. %uitable compressed mode patterns need to ta9e into account minimum reJuirements for U*
measurements of R%%., '%.& and -// carriers, as given b3 T% !$.433. Modelling results from
`6o%3;"Tas9>aa sho1 that the optimum gap pattern depends on the number of G%M neighbours to
measure and recommends the parameters in Table 44 "!+ to Table 44 "3<.
TGM) FSM/elta
C7N
TFSN TF(= TF(> TF/ TFP(= TFP(>
Ni$abort
(<attern)
Treconfabort
(sec)
RSSI dd = > > 4<$ 4! 4! dd dd
0SI# ID 44 ; 4= 4= < 4! 4! 4 dd
0SI# Recon <! ; 4= 4= < 4! 4! dd 4.$
Table 44"!+. Recommended gap pattern parameters for %-K! and long G%M neighbour list
TGM) FSM/elta
C7N
Ni$abort
(<attern)
Treconfabort
(sec)
RSSI dd = = = 4<$ 4! 4! dd dd
0SI# ID 44 ; 4= 4= < 4! 4! 4 dd
0SI# Recon <! ; 4= 4= < 4! 4! dd 4.$
Table 44"3. Recommended gap pattern parameters for %-K! and short G%M neighbour list
TGM) FSM/elta
C7N
Ni$abort
(<attern)
Treconfabort
(sec)
RSSI dd = > dd !> < < dd dd
0SI# ID 4= = > > =$ < < ! dd
0SI# Recon dd
Table 44"34. Recommended gap pattern parameters for puncturing and long G%M neighbour list
TGM) FSM/elta
C7N
Ni$abort
(<attern)
Treconfabort
(sec)
RSSI dd = = dd !> < < dd dd
0SI# ID 4= = > > =$ < < ! dd
0SI# Recon dd
Table 44"3!. Recommended gap pattern parameters for puncturing and short G%M neighbour list
TGM) /eltaC7N TFSN TF(= TF(> TF/ TFP(= TFP(>
/DD 'easurement + = > > 4<$ 4! 4!
Table 44"33. Recommended gap pattern parameters for inter"freJ onl3 and %-K! method
TGM) /eltaC7N TFSN TF(= TF(> TF/ TFP(= TFP(>
/DD 'easurement ;3 = > dd !> < <
Table 44"3=. Recommended gap pattern parameters for inter"freJ onl3 and puncturing method
TGM) FSM/elta
C7N
Ni$abort
(<attern)
Treconfabort
(sec)
RSSI dd = > > 4<$ 4! 4! dd dd
0SI# ID 44 ; 4= 4= < 4! 4! 4 dd
/DD 'eas dd = > > 4<$ 4! 4! dd dd
Table 44"3$. Recommended gap pattern parameters for combined inter"freJ"RAT and %-K! method
TGM) FSM/elta
C7N
Ni$abort
(<attern)
Treconfabort
(sec)
RSSI dd = > dd !> < < dd dd
0SI# ID 4= = > > =$ < < 4 dd
/DD 'eas dd = > dd !> < < dd dd
Table 44"3<. Recommended gap patterns for combined inter"freJ"RAT and puncturing method
.n terms of compressed mode po1er control parameters, according to `6o%3;"*!a, lin9 level simulation
results recommend to set U*KNode ' /elta%.R4, /elta%.Rafter4, /elta%.R! and /elta%.Rafter! to
4 d' for speech and data services for compressed mode b3 puncturing. -or compressed mode b3 %-
reduction, these offsets should be set to . d' for both speech and data services.
-rom the point of vie1 of alternative po1er recover3 modes during compressed mode, the current
recommendation is to set ITP T D RPP T , i.e. eJuivalent to po1er control operation during
uncompressed BnormalC frames. 5o1ever, note that validation of the compressed mode algorithm and
parameter optimisation is still ongoing through s3stem simulations.
/ied data
%ome &M profile optimization has been performed in the ,ptimus net1or9, the results are documented
in the follo1ing presentationL
?&M )rofile ,ptimization@, Anton Ealachev, #uan &arlos del Rio, 44 March !$, available at
httpLKKcompass.mot.comKgoK4344+3!+.
%%)2)+&arameter recommendations
The related database parameters are documented in the ?Reference )arameters %preadsheet@.
%%)2)3E>pected J&I ;aues
J&I E>pected J&I ;aue
SIR De;iation in #'
Bpriorit3T!C
T'/
A'R ,uaity in #'
Bpriorit3T4C
3.3
D- T> &=r Increase
in #'
Bpriorit3T4C
T'/
UE T> &=r Increase
in #'
Bpriorit3T!C
T'/
Time to report inter1
RAT neig"bour
Bpriorit3T!C
<= ms
0SI# Decode Time
Bpriorit3T4C
\ 4s
&rob 0SI# Decoding
Bpriorit3T4C
X +;_
%+Inter1$reOuency !ando;er
%+)% O;er;ie=
%+)%)%Description
To allo1 for multi"carrier deplo3ment, U%R3 supports inter"freJuenc3 hard handover for both &% and
)% domains. This is necessar3 to avoid discontinuous carrier coverage during U* movement. This
section covers inter"freJuenc3 handover due to poor radio lin9 Jualit3 but note that the hard handover
mechanism is also applied to inter"carrier load balancing B1hich is covered in another section of this
documentC.
.nter"freJuenc3 handover is based on a combination of periodic and event"triggered reporting depending
on the Jualit3 of the used freJuenc3. The U* is commanded to evaluate events !/ and !-. 7hen the
RN& receives a !/ event and the strongest pilot in the active set Bserving cellC has inter"freJuenc3
neighbours, compressed mode is activated if reJuired and a ne1 M*A%UR*M*NT &,NTR,0
message is sent to begin either periodic or event triggered measurement reporting of inter"freJuenc3
neighbouring cells. &onversel3, 1hen the RN& receives a !- event or the strongest pilot in the active set
no longer has inter"freJuenc3 neighbours, inter"freJuenc3 reporting ends. The flag
Inter,re?InterRATMeasIn% BA// &*00M*A%C indicates 1hether the cell has inter"freJuenc3 cells,
inter"RAT neighbour cells, or both in its idle mode neighbour list Bas broadcast on %.'44C. 5o1ever, the
connected mode neighbour list 1ill be composed of all defined neighbours in the data base, irrespective
of the settings of the A// &*00M*A% command. Note that, inter"freJuenc3 and inter"RAT
compressed mode gap patterns can run simultaneousl3.
*valuation of !/K!- events is made b3 using either *cKNo or R%&) depending on the setting of the
Inter,re?Meas>uant"t- attrib"te (A// C3((.NT3R7R3!)5C5HC. Note that in previous releases
this 1as obtained b3 mar9ing the cell as a ?center@ cell or as a ?verge@ BedgeC cell.
After inter"freJuenc3 measurements are initiated, the flag Inter,re?Re2&rtM&%e indicates 1hether
periodic or event"triggered reporting B!'C is used b3 the U* to report on the Jualit3 of current cell and
inter"freJuenc3 neighbours. Note that onl3 periodic reporting 1as supported in previous releases.
The 5,%7.T&5 parameter in the %*T &,RRMA0G,%7.T&5 command is used to enable or
disable the inter"freJuenc3 handover functionalit3 via the .NT*RG-R*6U*N&(G5,G%7.T&5 flag.
.n addition, this functionalit3 can be enabled or disabled in each cell individuall3 using the A//KM,/
&*005,&,MM command.
4!.4.4.4 Inter1$reOuency reporting e;ents
The events that trigger the initiation of inter"freJuenc3 measurements are described in the follo1ing
table. Note that event 4/ is used to detect changes in the strongest active set pilot. This is important for
monitoring the strongest pilot neighbour configuration.
E;ent Name E;ent Description Associated &arameters
E;ent +D The estimated Jualit3 of the currentl3 used
freJuenc3 is belo1 a certain threshold
Threshold used freJuenc3
53steresis value
Time to trigger
E;ent +/ The estimated Jualit3 of the currentl3 used
freJuenc3 is above a certain threshold
Threshold used freJuenc3
53steresis value
Time to trigger
The criterion for events !/ and !- is defined according to an absolute threshold. Measurement reports
are generated 1hen the estimated Jualit3 of the used freJuenc3 is above Bor belo1C a given threshold,
and the h3steresis and time to trigger conditions are fulfilled. The absolute threshold level can be
configured in U%R3 independentl3 for each traffic t3pe B)%, &%C, event B!/ or !-C and Juantit3 BR%&)
or *c.oC 1ith the parameters Inter,re?.Th%<)- and Inter,re?.Th%<,- B1here AT&% or )% and
3TR%&) or *&., measurementC.
The freJuenc3 Jualit3 estimate is defined in 3G)) as an aggregate measure of the Jualit3 of all cells in
the active set 1ith the follo1ing eApressionL
+ -est +
N
i
+ i + + carrier + carrier
(ogM 8 M (og 8 (ogM !
+ A
+
,
_
4 C 4 B 4 4
4
1here
+ carrier
!
is the estimated Jualit3 of the active set on freJuenc3 O.
M
carr"er 0
is the estimated Jualit3 of the active set on freJuenc3 +.
M
" 0
is a measurement result of cell i in the active set on freJuenc3 +.
N
A 0
is the number of cells in the active set on freJuenc3 +.
M
Best0
is the measurement result of the best cell in the active set on freJuenc3 +.
B
0
is a parameter sent from UTRAN to U* and used for freJuenc3 +.
Then the triggering conditions for events !/ and !- are respectivel3L
!
! ! / / carrier
) Threshol$ !
and !
! ! 7 7 carrier
) Threshol$ ! + .
As the measurement Juantit3, both &).&5 *cKNo and &).&5 R%&) ma3 be used in U%R3 depending
on the setting of the Inter,re?Meas>uant"t- attrib"te (in A// C3((.NT3R7R3!)5C5H). .n
<revio"s releases this #as obtaine$ by mar9ing the cell as a ?center@ cell or as a ?verge@ BedgeC cell.
The filtering 1eight 8+ defines ho1 much relevance is given to the Jualit3 of the best cell 1ith respect
to the remaining cells in the active set. This is given in U%R3 b3 the parameter Be"#ht,&r'se%,re? on
a per cell basis.
-inall3, the h3steresis and time to trigger dela3 values can be configured per cell in U%R3 1ith the
parameters H-st(&r<8 and Tr"#T"me<8 B1here I T / or -C respectivel3.
4!.4.4.! Inter1$reOuency periodic and e;ent1triggered reporting
,nce a !/ event is received b3 UTRAN, the U* is configured to perform either periodic or event"
triggered monitoring of -// cells on different freJuencies, depending on the setting of the flag
Inter,re?Re2&rtM&%e.
.n the case of periodic reporting, the interval for periodic measurements is configured in the
Per"&%Re2&rtInter$a! attribute. ,n reception of a !- event, periodic inter"freJuenc3 reporting is
disabled.
.n the case of event"triggered reporting, the U* is reJuested to report !' events. This 1ill also be
disabled on reception of a !- event. The triggering condition for event !' isL
!
! ! G G G - - carrier "n"se$ carrier "n"se$
) T ! +
and
!
! ! G G G - - carrier "n"se$ carrier "n"se$
) T ! +
.
1here
>
unuse%_carr"er
is the Jualit3 estimate of a non"used freJuenc3 that becomes better than an
absolute threshold.
T
unuse%_carr"er_<
is the absolute threshold that applies for this non"used freJuenc3 in that
measurement.
H
<
is the h3steresis parameter for the event !b.
>
use%_carr"er
is the Jualit3 estimate of the used freJuenc3.
T
use%_carr"er_<
is the absolute threshold that applies for the used freJuenc3 in that
measurement.
These parameters are set b3 the %*TKA//KM,/ &*00.NT*R-R*65,&,: commands. As 1ith
events !/ and !-, each of the t1o thresholds in !' can be set for either R%&) or *cKNo reporting, and
independentl3 for &% and )% traffic.
4!.4.4.3 Inter1$reOuency "ando;er processing
.n the case of event"triggered reporting using event !', the RN& 1ill ta9e the target cell that triggered
the report as the handover target, and inter"freJuenc3 handover procedures 1ill be initiated.
.n the case of periodic reporting, the RN& processes the reports it receives, and for each one decides
1hether to handover, and if so to 1hich cell. The RN& receives Jualit3 estimates of all Bintra"freJuenc3
or inter"freJuenc3C cells in the monitored set 1ithin the M*A%UR*M*NT R*),RT message. Then, the
RN& estimates the Jualit3 of the used freJuenc3 1ith the follo1ing eJuation
) (ogM 8 M (og 8 (ogM !
+ -est +
N
i
+ i + + carrier + carrier
+ A
+ +
,
_
4 C 4 B 4 4
4
1here
>
carr"er 0
M
carr"er 0
M
" 0
is a measurement result of cell i in the active set on freJuenc3 +.
N
A 0
is the number of cells in the active set on freJuenc3 O.
M
Best0
is the measurement result of the best cell in the active set on freJuenc3 +.
B
0
is a parameter sent from UTRAN to U* and used for freJuenc3 +.
H is the h3steresis parameter.
Then, if the estimated Jualit3 of the active set is 1orse than the reported Jualit3 of another carrier and
the time to trigger condition is fulfilled, inter"freJuenc3 hard handover is performed. .n addition, the
Jualit3 of the destination cell for the handover has to be above certain &).&5 *cKNo and &).&5 R%&)
minimum thresholds.
The eApression used to estimate the freJuenc3 Jualit3 is the same as the one used b3 the U* for the
reporting of events !/ and !-. 5o1ever, the eJuation parameters are different. The h3steresis and time
to trigger values for 55, processing are given in U%R3 b3 the parameters H-st(&rHHO and
Tr"#T"meHHO, respectivel3. The lo1est acceptable &).&5 R%&) and *cKNo levels of the hard
handover destination cell are set in the A// &*00.NT*R-R*65,&,: command attributes
HHORSCPM"n and HHOEcN&M"n, respectivel3.
%+)%)+Dependencies
7hen the cell has both inter"freJuenc3 and inter"RAT neighbours, there is a need to set some parameters
to resolve BiC the selection of !/K!- triggers Bgiven that these are set independentl3 for the t1o handover
t3pesC, and BiiC the selection of measured or target cells Bgiven that onl3 one or both t3pes could be
monitored, and also that both inter"freJuenc3 and inter"RAT cells might simultaneousl3 satisf3 the
handover conditionsC. The commands A//KM,/ &*005,&,MM provide control of these
interactions.
.n addition, during the operation of inter"freJuenc3 55, algorithm, the &M algorithm is triggered in
order to generate the corresponding gap patterns. After the target inter"freJuenc3 cell is selected, &A&
algorithm is invo9ed to decide 1hether the resources in the target cell are available.
%+)+ Database parameters
The main commands for configuration of the parameters involved in the inter"freJuenc3 55, algorithm
are the follo1ingL
%*T .NT*R-R*65,&,:
A// &*00.NT*R-R*65,&,:
M,/ &*00.NT*R-R*65,&,:
RM: &*00.NT*R-R*65,&,:
,ther commands include parameters 1hich are useful to control the handover operation, as mentioned
in the teAt. These includeL
A// &*00M*A%,
A// &*005,&,MM
%*T &,RRMA0G,%7.T&5
%+)3 Jey per$ormance indicators
J&I Description
A'R ,uaity during
Inter1/reO !!O
Bpriorit3T4C
M,% BMean ,pinion %coreC during inter"-reJ hard handover
eAecution for AMR services
Inter1/reO !!O /aiure
Rate
Bpriorit3T4C
)ercentage of attempts failed 1hen the s3stem is tr3ing to
handover the call to another freJuenc3
Inter1/reO !!O deay
Bpriorit3T4C
Average time reJuired to complete an inter"-reJ 55, procedure,
from the reception of !/ event until reception of the )h3 &hann
Reconfig &omplete message b3 the RN&
%+)2 Optimization guideines
%+)2)%&arameter recommendations
%+)2)+E>pected J&I ;aues
J&I E>pected J&I ;aues
A'R ,uaity during
Inter1/reO !!O
Bpriorit3T4C
-ield test
Inter1/reO !!O /aiure
Rate
Bpriorit3T4C
\ !_
Inter1/reO !!O deay
Bpriorit3T4C
\ $ms
%+)2)3Sensiti;ity anaysis
No data available.
%3Inter1$reOuency !ando;er 7!SD&A8
%3)% O;er;ie=
%3)%)%Description
This section describes the conditions under 1hich a /)&5 hard handover of a 5%/)A U* 1ill trigger a
5%"/%&5 serving cell change of this U*. The /)&5 hard handover includes intra"freJuenc3 55,,
inter"freJuenc3 55, and inter"RAT 55,. This algorithm does not need special measurement reports
and is onl3 triggered b3 /)&5 hard handover Bsome measurement reports ma3 trigger /)&5 hard
handoverC.
The process for implementing this algorithm can be summarised in the follo1ing steps.
,btain /)&5 hard handover reJuirements of a 5%/)A U* B/)&5 hard handover is processed as
normal handover algorithmC.
Get the cell information of the target cell 1hich the /)&5 of this U* 1ill be handed over to.
.f the target cell belongs to the same RN& as the source cell and is 5%/)A capable, 5%"
/%&5 can be established in the target cell and this cell can be the ne1 serving cell of 5%"
)/%&5. The handover 1ill fail if 5%/)A admission control fails.
.f the target cell belongs to the same RN& as the source cell but is not 5%/)A capable,
1hile performing hard handover, the '* or %treaming service on 5%"/%&5 1ill be mapped
to /&5 in the target cell. The handover 1ill fail if /&5 admission control fails.
.f the target cell belongs to a different RN&, accompanied %RN% relocation is performed,
channel t3pe and parameters are determined b3 target RN&. %o if the target cell does not
support 5%/)A or 5%/)A resource of the target cell are not enough to admit the ne1
5%/)A services, the non"5%/)A /&5 channel ma3 be the channel t3pe after relocation.
.f the target cell belongs to !G s3stem, access parameters are determined b3 !G s3stem.
%3)%)+Dependencies
This algorithm 1ill be triggered b3 /)&5 hard handover of the 5%/)A U*. /)&5 hard handover
algorithms include intra"freJuenc3 hard handover algorithm, inter"freJuenc3 hard handover algorithm
and inter"RAT hard handover algorithm. Note that in U%R 3. inter"freJuenc3 load balancing and inter"
RAT handover load based algorithms are not applicable to 5%/)A U* so these t1o algorithms 1ill not
trigger 5%/)A hard handover.
7hen applied to inter"freJuenc3 hard handover in the same %RN&, the process of 5%"/%&5 serving
cell change in this algorithm is the same as in the intra"freJuenc3 handover algorithm Bsee 4.4.4.3C.
7hen applied to inter"freJuenc3 hard handover in a different RN&, the eAecution of %RN% relocation is
the same as in the 5%/)A %RN% Relocation algorithm Bsee 4<.4.!C.
.n the case of 5%"/%&5 inter"freJuenc3 handover, if the 5%/)A service 1ill be mapped on 5%"/%&5
in the target cell, then 5%/)A admission control algorithm 1ill be triggered to decide 1hether to accept
it or not. .f not, this service can be mapped on /&5P if the 5%/)A service 1ill be mapped on /&5 in
the target cell, then /&5 admission algorithm 1ill be triggered to decide 1hether to accept it or not.
/&5 admission control algorithm 1ill determine 1hether the hard handover is successful or not.
%3)+ Database parameters
None.
%3)3 Jey per$ormance indicators
J&I Description
!SD&A Inter1/reO
!!O /aiure Rate
Bpriorit3T4C
)ercentage of attempts failed 1hen the s3stem is tr3ing to handover the
5%/)A call to another freJuenc3
!SD&A Inter1RAT
!!O /aiure Rate
Bpriorit3T4C
)ercentage of attempts failed 1hen the s3stem is tr3ing to handover the
5%/)A call to another s3stem
%2Inter1RAT !ando;er
%2)% O;er;ie=
%2)%)%Description
The purpose of the inter"RAT handover procedure is to, under the control of the net1or9, transfer a U*
connection from one radio access technolog3 Be.g. UTRANC to another Be.g. G%MC. U%R3 supports
both, handover from G%M to UTRAN and handover from UTRAN to G%M on &% and )% domains
B&ell &hange ,rderC, but not simultaneousl3. This section covers onl3 handover from UTRAN to G%M.
.n order to offer 1orld1ide coverage, the handover from UTRAN to G%M is a 9e3 feature especiall3
during earl3 deplo3ment stages 1here islands of UMT% coverage are envisaged. 7hen an inter"RAT
handover is eAecuted, the U* must establish the connection to G%M and then release all UMT% radio
resources.
The measurements to support the inter"RAT handover functionalit3 can be made 1ithout simultaneous
use of t1o receiver chains at the U*. .n this case, the U* can perform the measurements b3 using idle
periods in the do1nlin9 transmission created b3 the &ompressed Mode procedure.
.nter"RAT handover is based on a combination of periodic or event"triggered measurement reports and
onl3 applies to cells in the UTRAN coverage area, 1hich have G%M cells included in the neighbour list.
.nitiall3, the U* is commanded to evaluate the Jualit3 of the used freJuenc3 through events !/ and !-.
7hen the RN& receives a !/ event, a ne1 M*A%UR*M*NT &,NTR,0 message is sent to begin
either periodic or event"triggered measurement reporting of G%M neighbouring cells. &onversel3, 1hen
the RN& receives a !- event, inter"RAT reporting ends. %election of 1hether *c.o or R%&) is to be
used as the measurement Juantit3 for events !/ and !- is performed b3 setting the
<)<,Meas>uant"t- attribute in the A// &*00.NT*RRAT5,&,: command.
After inter"RAT measurements are initiated, the flag InterRATRe2&rtM&%e indicates 1hether periodic
or event triggered reporting B3AC is used b3 the U* to report on the Jualit3 of the current cell and inter"
RAT neighbours. Note that onl3 periodic reporting 1as supported in previous releases.
-or inter"RAT handover to be enabled in a given cell, the cell must have G%M adOacent cells. .n
addition, the Inter,re?InterRATMeasIn% flag BA// &*00M*A% commandC indicates 1hether the
inter"freJuenc3 andKor inter"RAT neighbours 1ill be broadcast on %.'44 for a given cell Bi.e. in its idle
mode neighbour listC. 5o1ever, the connected mode neighbour list 1ill be composed of all defined
neighbours in the data base, irrespective of the settings of the A// &*00M*A% command. Note that
in U%R3, a cell can be configured as having inter"freJuenc3, inter"RAT or both t3pes of neighbours.
The 5,%7.T&5 parameter in the %*T &,RRMA0G,%7.T&5 command is used to enable or
disable the inter"RAT handover functionalit3 via the flags INTER_RAT_CS_O'T_SBITCH and
INTER_RAT_PS_O'T_SBITCH, controlling respectivel3 &% and )% inter"RAT handovers. .n
addition, this functionalit3 can be enabled or disabled in each cell individuall3 using the A//KM,/
Motorola &onfidential )roprietar3 4=4
&*005,&,MM command.
4=.4.4.4 Inter1RAT reporting e;ents
These events are event !/ and event !- and are described in the inter"freJuenc3 handover section.
4=.4.4.! Inter1RAT periodic and e;ent1triggered reporting
U%R3 supports independent configuration of the !/K!- thresholds for &% and )% RA's. This is set
1ith the parameters InterRAT.Th%<)- and InterRAT.Th%<,-, 1here A T &% or )%, and 3 T R%&) or
*&.,.
,nce a !/ event Bcurrent active set Jualit3 is belo1 a given thresholdC is received b3 UTRAN 1ith
G%M neighbours and 1here the appropriate flags have been set, the U* is configured to perform either
periodic or event"triggered monitoring of G%M neighbouring cells Bdepending on the
InterRATRe2&rtM&%e attributeC. The measurement Juantit3 is G%M carrier R%%., but '%.&
identification and reconfirmation must be also attempted.
.n the case of periodic reporting, the interval for periodic measurements is configured 1ith the
InterRATPer"&%Re2&rtInter$a! attribute of the &*00 .NT*RRAT5,&,: command. /uring inter"
RAT measurements, the U* continues to monitor the Jualit3 of the current active set and on the
reception of a !- event, periodic inter"RAT measurement reporting is disabled.
.n the case of event triggered reporting, the U* is reJuested to report 3A events. This 1ill also be
disabled on reception of a !- event. The triggering conditions for event 3A areL
! K
3a @se$ @se$
) T !
and
! K
3a RAT 5ther RAT 5ther RAT 5ther
) T C.5 M + +
1here
>
use%
is the Jualit3 estimate of the used UTRAN freJuenc3.
T
use%
is the absolute threshold that applies for the used freJuenc3 in that measurement.
H
:a
is the h3steresis parameter for event 3a.
M
OtherRAT
is the measurement Juantit3 for the cell of the other s3stem.
CIO
OtherRAT
is the cell individual offset for the cell of the other s3stem.
T
OtherRAT
is the absolute threshold that applies for the other s3stem in that measurement.
7ith the eAception of the cell individual offset, these parameters are set b3 the %*TKA//KM,/
&*00.NT*RRAT5,&,: commands. As 1ith events !/ and !-, the threshold for the used UTRAN
freJuenc3 in 3A can be set for either R%&) or *cKNo reporting, and also independentl3 for &% and )%
traffic. 5o1ever, the 3A threshold for the G%M s3stem is strictl3 the received po1er level of the G%M
'&&5 carrier BR%%.C, though it can also be set independentl3 for &% and )% traffic.
Motorola &onfidential )roprietar3 4=!
4=.4.4.3 Inter1RAT "ando;er processing
.n the case of event"triggered reporting using event 3A, the RN& 1ill ta9e the G%M target cell that
triggered the report as the handover target, provided that the cell capabilities match the reJuirements of
the current RA'. .nter"RAT handover procedures then follo1.
.n the case of periodic reporting, the RN& processes each report it receives, and on each report decides
1hether to initiate handover, and to 1hich cell. The RN& receives Jualit3 estimates of all G%M cells in
the monitored set 1ithin the M*A%UR*M*NT R*),RT message. The Jualit3 measure used is G%M
carrier R%%., but in addition, the U* also performs G%M '%.& identification and G%M '%.&
reconfirmation Bdepending on the BSIC3er"(- flagC.
Then, if the G%M carrier R%%. is greater than a certain threshold Bincluding h3steresisC and the time to
trigger eApires, inter"RAT handover is performed. The target G%M cell should be the best"ran9ed cell
1hose '%.& has been identified and reconfirmed. 5o1ever, if there are no cells 1ith '%.& identified,
the cell 1ith the best R%%. value is chosen Bactuall3 there are different handover criteria for '%.&
verified and non"verified, see belo1C. Also note that '%.& reconfirmation is not currentl3 used in the
handover metric.
Note that there are t1o time"to"trigger values used b3 the RN& 1hen processing measurement reports
from the U*. ,ne time"to"trigger is used for cells 1ithout a confirmed '%.& and the other time"to"
trigger is used for cells 1ith a confirmed '%.&. T3picall3, the timer for '%.& confirmed cells can be set
to zero and that 1ould trigger immediatel3 a handover to such a cell 1ithout further dela3. This is
reasonable as it is deemed that a confirmed '%.& cell should be of a good enough Jualit3 to handover a
call. ,n the other hand, the timer for non"confirmed '%.& cells is t3picall3 set to a non"zero value and
onl3 1hen it eApires 1ould the handover be triggered Bassuming the cell level is still above the specified
minimum R%%. thresholdC. .f a cell level drops belo1 the minimum threshold after the timer has started,
the timer is stopped and obviousl3 no handover 1ill occur at that point.
&onfiguration of the G%M R%%. threshold level, h3steresis value and time to trigger dela3 is achieved in
U%R3 through the attributes InterRATC&$HO.Th% B1here AT &% or )%C, H-st,&rInterRAT and
T"meT&Tr"#,&r. 9/here .A3er"(- &r N&n3er"(-1 respectivel3, 1ith the A//
&*00.NT*RRAT5,&,: command on a per cell basis. Note that the G%M threshold attributes are the
same as those used for triggering event 3A in event"triggered operation, but here those values are used
instead 1ithin the internal RN& algorithm.
A cell enters the candidate list for handover 1hen the R%%. Bplus cell individual offsetC is greater
than InterRATC&$HO.Th% V H-st,&rInterRAT*< at least during a period of
T"meT&Tr"#,&r3er"(- Bfor G%M cells reported 1ith '%.& verifiedC or T"meT&Tr"#,&rN&n3er"(-
Bfor G%M cells reported 1ith '%.& non"verifiedC.
5andover is eAecuted to the first G%M cell that fulfils the criteria above, and if there is more than
one cell in the candidate list, the one 1ith strongest R%%. is chosen.
A cell eAits the candidate list for handover 1hen the R%%. Bplus cell individual offsetC is less than
InterRATC&$HO.Th% " H-st,&rInterRAT*< an3 time. .t must re"satisf3 the above conditions to
re"enter the candidate list.
.f a handover to a G%M cell fails for 1hatever reason, the RN& 1ill not initiate a handover to that
Motorola &onfidential )roprietar3 4=3
G%M cell for that U* for a period of Pena!t-T"me,&rInterRATHO.
%2)%)+Dependencies
7hen the cell has both inter"freJuenc3 and inter"RAT neighbours, there is a need to set some parameters
to resolve BiC the selection of !/K!- triggers Bgiven that these are set independentl3 for the t1o handover
t3pesC, and BiiC the selection of measured or target cells Bgiven that onl3 one or both t3pes could be
monitored, and also that both inter"freJuenc3 and inter"RAT cells might simultaneousl3 satisf3 the
handover conditionsC. The commands A//KM,/ &*005,&,MM provide control of these
interactions.
.n addition, during the eAecution of coverage based inter"RAT 55,, &M is triggered 1ith the
associated parameters BTGPS, TGPL1, TG), TGPL< etc.C in order to measure the neighbour cells.
Also in the case of eAecution of 0&&, inter"RAT 55, is li9el3 to be triggered.
The commands that have parameters to configure in relation to .RAT handover areL
%*T .NT*RRAT5,&,: Bset the RN&"oriented parametersC
A// &*00.NT*RRAT5,&,: Badd cell"oriented parametersC
M,/ &*00.NT*RRAT5,&,: Bmodif3 cell"oriented parametersC
,ther commands include parameters 1hich are useful to control the handover operation, as mentioned
in the teAt. These includeL
A// &*00M*A%
%*T &,RRMA0G,%7.T&5 Binvolving one parameter 5,%7.T&5C
A// &*005,&,MM
A// G%M&*00 Binvolving t1o parameters BAN)IN) and RATCELLT;PEC
M,/ G%M&*00 Binvolving parameters BAN)IN) and RATCELLT;PEC.
J&I Description
A'R ,uaity during
Inter1RAT !!O
M,% BMean ,pinion %coreC during inter"RAT hard handover
eAecution for AMR services
Motorola &onfidential )roprietar3 4==
Inter1RAT !!O $aiure
Rate
)ercentage of attempts failed 1hen the s3stem is tr3ing to
handover the call to another technolog3
Inter1RAT !!O deay Average time reJuired to complete an inter"RAT 55, procedure,
from the MR triggered is received until the 5, -R,M UTRAN
&,MMAN/ message is sent to the U*
%2)2 Optimization guideines
%2)2)%&arameter recommendations
%2)2)+E>pected J&I ;aues
A'R ,uaity during
Inter1RAT !!O
Bpriorit3T4C
X 3.3
Inter1RAT !!O /aiure
Rate
Bpriorit3T4C
\ !_
Inter1RAT !!O deay
Bpriorit3T4C
\ $ms
%2)2)3Sensiti;ity anaysis
No data available.
Motorola &onfidential )roprietar3 4=$
%4#ombined inter1$reOuency and inter1RAT
"ando;er
.n addition to stand"alone inter"freJuenc3 or inter"RAT hard handover, U%R3 also supports a combined
hard handover algorithm, in case a cell has both t3pes of neighbours definedL inter"freJuenc3 and G%M,
and provided also that the attribute Inter,re?RATS/"tch in A// &*005,&,MM is set such that
both t3pes of neighbours are measured.
.n broad terms, the algorithm implementation is ver3 similar for an3 miAture of neighbour cells. The
difference relies in the configuration parameters to be used, compressed mode configuration and the
selection of the target cell Bespeciall3 in situations 1hen there is more than one candidate in the listC.
The Jualit3 of the used freJuenc3 is evaluated b3 using the RR& events !/ D !-. ,n reception of event
!/, the U* begins periodic or event"triggered measurement reporting of all inter"freJuenc3 and G%M
neighbouring cells defined in the database. ,n reception of event !-, inter"freJuenc3 and inter"RAT
measurement reporting ends. %etting of the !/K!- thresholds Bper traffic t3peC, is achieved 1ith either
the standard inter"freJuenc3 or inter"RAT attributes depending on the value of the
C&e."stMeasTh%Ch&"ce parameter in the command A// &*005,&,MM.
,nce a !/ event is received, the conditions for hard handover eAecution are monitored at the RN&.
5andover can be triggered in periodic mode b3 an inter"freJ or an inter"RAT neighbour, 1hichever
meets the minimum level, h3steresis and time"to"trigger conditions first, 1ith no further distinction, or in
event"triggered mode b3 the reception of a !' or 3A event. '3 setting those parameters Bindependentl3
for inter"freJ and inter"RAT neighboursC, priorit3 can be given to one or another t3pe as desired.
5o1ever, if one or more inter"freJ neighbour cells and one or more inter"RAT neighbour cells Jualif3
simultaneousl3 for hard handover, priorit3 is given to the inter"freJuenc3 neighbour as target cell.
.n case the U* reJuires using compressed mode in order to ta9e the measurements, the RN& starts a
three gap pattern for the follo1ing measurement purposesL -// measurement, R%%. and '%.&
identification.
Motorola &onfidential )roprietar3 4=<
%6SRNS reocation
%6)% O;er;ie=
The U%R3 %RN% relocation and 5%/)A %RN% relocation algorithms are described in this section.
%6)%)%SRNS reocation
The relocation of %RN& is a UMT% functionalit3 used to change the serving RN& from one RN& to
another RN&. This 1ill move the &N connection point from source RN& to target RN& 1hen U* has
all lin9s under the target RN&. The relocation procedure ta9es several stages from start to complete.
The procedure includesL
Relocation )reparationL this procedure is to prepare relocation of %RN& and to allo1
Relocation co"ordination in the target RN&.
Relocation resource allocationL this is to allocate resources from target RN& for a
relocation of %RN&.
Relocation detectionL this procedure is to indicate b3 the RN& the detection of %RN&
relocation eAecution to the &N.
Relocation &ompletionL this procedure is to indicate b3 the target RN& the completion of
relocation of %RN& to the &N.
The figure belo1 depicts the message seJuence flo1 for successful relocation procedure.
Motorola &onfidential )roprietar3 4=>
The %RN& 1ill not Oust start the relocation procedure 1hen it deletes the last lin9 on the source RN&.
The %RN& uses t1o criteria to decide if relocation procedure 1ill be needed. 7hen either condition is
true, the relocation procedure 1ill be triggered b3 the %RN&.
4<.4.4.4 SRNS reocation triggers $or #S case
4. %RN%RG)R,)GG/*0A(G%7.T&5 is turned ,N for relocation triggered b3 .ur dela3 or
%RN%RG.URGR*%R&*G%7.T&5 is turned ,N for relocation triggered b3 .ur congestion,
!. All legs in the active"set of a U* are under the same /RN&,
3. ,ne of the follo1ing optimization criteria is metL
aC /ela3 &riterion
This criterion is applied to services 1ith 6o% 1ith dela3 constraints, i.e. conversational or
streaming. This criterion is met 1hen the difference bet1een the maAimum allo1ed -) transfer
dela3 Bfrom Transfer /ela3 .* in RANA) RA' Assignment ReJuest messageC and the current -)
Motorola &onfidential )roprietar3 4=;
dela3 is lo1er than the value specified in the parameter %RN%/ela3,ffset i.e. %RN%/ela3,ffset V
MeasuredG-)G/ela3 Q Transfer /ela3.
bC &ongestion &riterion
The &ongestion criterion is met 1hen the follo1ing sub"conditions are metL
&ongestion alarm onL A congestion alarm to the %RN% Relocation algorithm is raised 1hen the
measured AA0! band1idth percentage used of the total )&R allocated for user data traffic over .ur
is higher than the specified threshold, i.e. .ur user"plane traffic congestion.
.ur periodic timer has eApiredL this timer starts 1hen the congestion alarm is raised.
=. )revious %RN% Relocation happened for the same U* earlier than the time specified b3 the
parameter %RN%R*Apir3Time.
$. .f all legs lie under the /RN& be3ond a certain long time 1hich is 0MT"configurable, the %RN%
relocation should be triggered.
Note. &ombination 4 `cond. 4 V cond. ! V cond. 3 V cond.=.a as 1ell as &ombination ! `cond. 4 V
cond. ! V cond. $a 1ill trigger %RN% relocation, other1ise the call continues through the .ur and no
%RN% relocation is performed. -or &ombination 4, the parameter %RN%R.urReselectTimer0en is used
for resource optimisation relocation select timer, i.e. the .ur periodic timer above. 7hen the congestion
alarm is raised, the %RN& 1ill start this timer. Upon timer eApir3, the %RN& 1ill choose the first
%RN%RMaANum users to perform the relocation procedure.
4<.4.4.! SRNS reocation triggers $or &S case
4. %RN%RG.URGR*%R&*G%7.T&5 is turned ,N for relocation triggered b3 .ur congestion,
!. All legs in the active"set of a U* are under the same /RN&,
3. The follo1ing optimization criterion is metL
aC &ongestion &riterion.
The &ongestion criterion is met 1hen the follo1ing sub"conditions are metL
&ongestion alarm onL A congestion alarm to the %RN% Relocation algorithm is raised 1hen the
measured AA0! band1idth percentage used of the total )&R allocated for user data traffic over .ur
is higher than the specified threshold, i.e. .ur user"plane traffic congestion.
.ur periodic timer has eApiredL This timer starts 1hen the congestion alarm is raised.
=. )revious %RN% Relocation happened for the same U* earlier than the time specified b3 the
parameter %RN%R*Apir3Time.
$. .f all legs lie under the /RN& be3ond a certain long time 1hich is 0MT"configurable, the %RN%
relocation should be triggered.
Motorola &onfidential )roprietar3 4=+
N,T*L &ombination 4 `cond. 4 V cond. ! V cond. 3 V cond.=.a as 1ell as &ombination ! `cond. 4 V
cond. ! V cond. $a 1ill trigger %RN% relocation, other1ise the call continues through the .ur and no
%RN% relocation is performed. -or &ombination 4, the parameter %RN%R.urReselectTimer0en is used
for resource optimisation relocation select timer, i.e. the .ur periodic timer above. 7hen the congestion
alarm is raised, the %RN& 1ill start this timer. Upon timer eApir3, the %RN& 1ill choose the first
%RN%RMaANum users to perform the relocation procedure.
%6)%)+!SD&A SRNS Reocation
U%R3. 5%/)A %RN% relocation algorithm focuses on the process of %RN% relocation 1ith 5%/)A
involved. The follo1ing descriptions of the algorithm assumeL before %RN% relocation Bi.e. before
%RN& initiates %RN% relocation procedureC, at least one RA' of a user is mapped to 5%"/%&5 in
%RN& and that the R++ %RN% relocation procedure Bfor RA's mapped to /&5 onl3C is supported.
7ith RA' mapped to 5%"/%&5 in %RN&, t1o %RN% relocation scenarios are supported in U%R3.,
triggered b3 different conditionsL ,ne is %RN% relocation 1ithout .ur supportP the other is %RN%
relocation 1ith .ur support.
.f .ur is available Bthis implies that there is .ur interface bet1een %RN& and /RN&, and the .ur
interface is in effect during %RN% relocation, i.e. %5, of /&5 over .ur is supportedC, then the second
relocation scenario can be supported unless U%R3 conditions for 55, appear, 1here the first
relocation scenario 1ill be used.
4<.4.!.4 SRNS reocation =it"out Iur support
.n this scenario, the .ur interface is not available Bthis ma3 impl3 that either there is no .ur interface or
the .ur interface is not in effectC, and the %RN% relocation procedure is triggered b3 inter RN% hard
hand over Beither intra freJuenc3 or inter freJuenc3C. The relocation is U* involved in this scenario due
to the feature of hard handover.
%RN% relocation 1ith hard handover ma3 be triggered b3 a 4/ event B.ntra freJuenc3C indicating best
cell is under the /RN& Bi.e. TRN& for relocationC or b3 inter freJuenc3 55, condition for inter
freJuenc3 %RN% relocation 1ith hard handover. At this situation, U* is still under control of %RN&,
but is moving to a location controlled b3 the target RN& based on measurement information and
9no1ledge of the UTRAN topolog3. ,nce this situation is encountered, %RN& decides to initiate a
combined hard handover and %RN% relocation. The algorithm used and the signalling flo1 are
compliant 1ith the 3G)) specifications T%!$.=43, T%!3.<, T%!$.+3< and T%!$.33.
,ne particular thing to be noted in U%R3. %RN% relocation is the RANA) R*0,&AT.,N
R*6U.R*/ message sent from %RN& to the &N to initiate the relocation. The message also provides
the RR& .nitialisation .nformation to TRN&. 'ased on this information, TRN& prepares the 5ard
5andover Message B%uch as )h3sical channelKTransport channel reconfiguration, radio bearer
establishment or reconfiguration, etc.C. .n U%R3.%RN% relocation algorithm implementation, the
%RN& shall not provide channel t3pe, i.e. the URA' Tr&5 MappingU .* 1ithin U%ource RN& to Target
RN& Transparent &ontainerU .* is not included in the RANA) R*0,&AT.,N
R*6U.R*/ message. The channel t3pe is decided b3 TRN&. The TRN& decides 1hether a service 1ill
be configured to a 5%"/%&5 based on U* capabilit3, cell 5%"/%&5 configuration, service t3pe and
data bit rate. Therefore, if the target cell does not support 5%/)A, the non"5%/)A /&5 channel 1ill
be the channel t3pe after relocation.
4<.4.!.! SRNS reocation =it" Iur support
.n this scenario, the .ur interface is available. The relocation is lossless 1ithout involving U*. As
5%/)A over .ur is not supported in U%R3. RN&, this scenario actuall3 utilizes the R++ %RN%
relocation, i.e. relocation 1ithout 5%/)A information, and Oust before performing %RN% relocation, a
transition from 5%"/%&5 state to /&5 state for the 5%"/%&5 leg 1ill occur before the relocation.
After successful %RN% relocation, the ne1 %RN& 1ill decide if the transition bac9 to 5%"/%&5 state
can be performed according to some criteria.
The corresponding %RN% relocation procedure is described in three phases as belo1.
4<.4.!.!.4 Transition to /&5 state
.n this phase, the %RN& shall trigger a transition from /&5 B5%"/%&5 sub"stateC to /&5 B/&5 sub"
stateC 1hen a 5%/)A U* is in inter"RN% handover 1ith .ur support Bi.e. %5, of /&5 over .ur
supportedC. A /&5 radio bearer that most closel3 satisfies the RA' 6o% reJuirements is selected. The
transition is implemented using R0 Reconfiguration Bunder %RN&C. The purpose for such transition is
to 9eep the continuit3 of the service ever carried on 5%"/%&5.
The transition is triggered b3 *vent 4' Bimpl3ing a primar3 &).&5 leaves the reporting rangeC. The
5%G/%&5 leg is maintained under a cell in the %RN&, even if that cell is not the best in the active set
until the point 1hen the last leg Bcurrentl3 bearing 5%"/%&5C under the %RN% has to be removed. At
this time point, 5%"/%&5 1ill be transitioned to /&5 still under %RN& using R0 Reconfiguration,
1hich is follo1ed b3 the deletion of the /&5 Oust transitioned from 5%"/%&5. After that, all /&5
R0s in the active set under the %RN& 1ill be deleted. After deletion of the /&5 R0s in %RN&, %RN&
does not store an3 information that a 5%"/%&5 has ever been used for the user.
4<.4.!.!.! Relocation conditions
The conditions to trigger relocation are eAactl3 the same as the conditions for U%R3. %RN% relocation
triggers B)% caseC described earlier.
,nce the triggering conditions are met, the R++ %RN% relocation procedure shall be performed, i.e.
relocation 1ithout 5%/)A information.
.n this scenario, the U* is alread3 under control of target RN&, so the relocation is transparent to the
U*. The %RN& Oust assigns the cservingc function to the target RN&, 1hich then becomes the %erving
RN&.
4<.4.!.!.3 Transition bac9 to 5%"/%&5 state
After %RN& relocation, the target RN& 1ill trigger a transition from /&5 B/&5 sub"stateC to /&5
B5%"/%&5 sub"stateC if the U* is in a 5%/)A capable cell, subOect to 5%"/%&5 admission control.
Motorola &onfidential )roprietar3 4$4
This actuall3 is a separate function since the TRN& 1ould not 9no1 that a /&5 1as previousl3
mapped to 5%"/%&5 state before relocation.
%6)%)3Dependencies
There are some dependencies bet1een 5%/)A %RN% relocation and %5,, 55, and RA' to R'
mapping algorithms.
-or 5%/)A %RN% relocation 1ith .ur supported, %5, event 4' 1ill trigger the transition from 5%"
/%&5 to /&5.
-or 5%/)A %RN% relocation 1ithout .ur supported, the intra" or inter" freJuenc3 55, to a cell
belonging to a different RN& 1ill simultaneousl3 trigger a %RN% relocation procedure.
The dependenc3 bet1een 5%/)A %RN% relocation and RA' to R' mapping algorithm isL 1hen tr3ing
to mapping 5%"/%&5 to /&5 during relocation, RA' to R' mapping algorithm 1ill be responsible to
choose a /&5 radio bearer that most closel3 satisfies the RA' 6o% reJuirements.
The related 0MT commands are A// NRN&, %*T &,RRMA0G,%7.T&5, %*T %RN%R and %*T
%TAT*T.M*R. The parameters 1ill be in the phase .. spreadsheet.
Note that the commands and parameters are the same as those used in U%R! eAcept for one more
parameter added in U%R3 Bbut not 3et available in the 0MT v4.$...!.C 1hich is used in the triggering
condition B$C.
J&I Description
RE-O#)Succ&rep .ncremented upon receipt of a RANA) message R*0,&AT.,N &,MMAN/
sent from the &N B%ource sideC to the source RN&, indicating a successful
relocation preparation, on a per RN& basis.
RE-O#)Succ .ncremented upon receipt of a RANA) message .u R*0*A%* &,MMAN/
sent from the &N B%ource sideC to the source RN& in response to a
R*0,&AT.,N R*6U.R*/ message, indicating a successful relocation, on a
per RN& basis.
Motorola &onfidential )roprietar3 4$!
%6)2 Optimization guideines
To be completed.
Motorola &onfidential )roprietar3 4$3
%5Radio Resource and -oad 'anagement
%5)% Introduction
This chapter of the optimization guide is dedicated to a number of algorithms that are used to address
issues related to managing the UTRAN2s radio resources and controlling the s3stem load. The chapter
consists of the follo1ing sectionsL
5%/)A cell configuration, in 1hich ph3sical 5%/)A parameters Be.g. po1er and ,:%-
codes reserved for 5%/)A and 5%"/)&&5 parametersC are configuredP
&all Admission &ontrol B&A&C, used 1hen deciding 1hether or not to admit a ne1 call or a
ne1 radio lin9 in a cellP includes uplin9 and do1nlin9 /&5 and 5%"/%&5 admission
algorithmsP
)o1er &ontrol, used to control the transmitted po1er of cells and U*s in order to maintain
a given Jualit3 of service 1ithout creating eAcessive interferenceP includes open, closed,
inner and outer loop control mechanisms as 1ell as do1nlin9 po1er balancingP
0oad &ongestion &ontrol B0&&C, used to control the U0 and /0 s3stem load and to balance
the loads bet1een cells and carriersP includes 0oad Reduction B0/RC, to graduall3 reduce
the load and ma9e room for &A&, and ,ver 0oad &ontrol B,0&C, to Juic9l3 reduce load
and restore s3stem stabilit3P
/irected Retr3 /ecision B/R/C, used to redirect U*s to other cells, carriers or RATs
follo1ing a failure to establish RR& connection or RA' assignmentP includes RR& Retr3
/ecision, Redirection and RA' Retr3 /ecision B/&5 and 5%/)AC algorithmsP
0a3ered &ell Traffic Absorption B0&TAC, used to trigger inter"freJuenc3 hard handovers
bet1een micro" and macro"cell on different carriers in a 5ierarchical &ell %tructure B5&%C
environmentP
&ell 'reathing, used to control the transmit po1er of the common pilot B)"&).&5C in order
to contract or eApand cell coverage areas in response to cell loadP
)otential User &ontrol B)U&C, used to change inter"freJuenc3 cell reselection parameters to
passivel3 balance the load across carriers.
Motorola &onfidential )roprietar3 4$=
%*!SD&A #e #on$iguration
%*)% !SD&A po=er and codes resources
%*)%)%&arameter o;er;ie=
4;.4.4.4 Description
There are three cell specific 5%/)A parameters 1hich set up the ph3sical resources available for
5%/)A users on a specific cellL
HSP)SCHCO)EN'M
o Number of %preading -actor B%-C 4< codes reserved for 5%")/%&5 ph3sical channels in
the cell. These codes are used to carr3 the user data so the more codes that are available the
higher the maAimum possible throughput is for the cell. At least one code must be 9ept for
non"5%")/%&5 channels so this has a maAimum theoretical value of 4$.
o The U%R3 Motorola MA&"hs 5%"/%&5 scheduler can onl3 allocate up to five codes to
5%")/%&5 so in practice this value must be five or less. This is adeJuate to serve a single
&ategor3 < U* B1hich is onl3 capable of receiving $ codesC 1hich is the most li9el3 t3pe of
U* in initial deplo3ments.
HSSCCHCO)EN'M
o Number of %preading -actor B%-C 4!; codes reserved for 5%"%&&5 ph3sical channels in
the cell. These codes are used to carr3 signalling information to U*s 1hich are about to
receive data on the 5%")/%&5s. ,ne 5%"%&&5 is reJuired for ever3 U* 1hich is to
receive data during a !ms TT. so the more codes that are available the higher the maAimum
possible number of code multipleAed users allo1ed on a !ms TT. Bsometimes referred to as
the &/MC. The maAimum value allo1ed b3 standard is =.
o The U%R3 Motorola MA&"hs 5%"/%&5 scheduler can onl3 schedule a single user per !ms
TT. B&/MT4C so in practice this value is fiAed at one.
HS)PAPOBER
o Total po1er reserved for 5%/)A shared channels Bi.e. 5%")/%&5s and 5%"%&&5sC in a
cell. Also 9no1n as the 5%/)A po1er partition. This does not include the po1er on
dedicated channels, e.g. /)&&5s, of users 1ho are using 5%/)A N that po1er is treated as
belonging to Rel++ channels. The higher the po1er available the larger the cell coverage
area for 5%/)A users andKor the higher the maAimum cell throughput is li9el3 to be on
Motorola &onfidential )roprietar3 4$$
5%/)A, but correspondingl3 the more limited the Rel++ channels are li9el3 to be.
o U%R3 RRM cell load reduction algorithms use the maAimum cell po1er Be.g. !7C minus
the reserved 5%/)A po1er as the upper limit of cell loading. The higher the 5%/)A
reserved po1er the more heavil3 loaded the Rel++ portion of the cell 1ill appear to be,
regardless of the actual 5%/)A used.
4;.4.4.! Dependencies
The follo1ing algorithms ma9e use of the size of the 5%/)A po1er partitionL
)U&
0&&
The size of the po1er partition ma3 need to ta9e into account the AM"R0&KMA&"d )/U size
configured b3 the RA'"to"R' Mapping algorithm as this size dictates the minimum data rate 1hich
must eAtend to the cell edge.
%*)%)+Reated -'T commands
The commands for configuring 5%/)A resources are sho1n belo1. The related database parameters are
documented in a separate spreadsheet, the ?Reference )arameters %preadsheet@.
A// &*005%/)A Add high speed do1nlin9 pac9et access B5%/)AC parameters
for a cell
M,/ &*005%/)A Modif3 high speed do1nlin9 pac9et access B5%/)AC
parameters of a cell Bsee A// &*005%/)A for details of
settable parametersC
RM: &*005%/)A Remove high speed do1nlin9 pac9et access B5%/)AC
parameters from a cell
A&T &*005%/)A Activate the high speed do1nlin9 pac9et access B5%/)AC
function of a given cell
/*A &*005%/)A /eactivate the high speed do1nlin9 pac9et access B5%/)AC
function of a given cell
%*)%)3Jey per$ormance indicators
J&I Descriptions
!S1S##! #e #o;erage &an the 5%"%&&5 be successfull3 received at the cell edge^
Motorola &onfidential )roprietar3 4$<
!S1&DS#! #e #o;erage 7hen broadcasting at the lo1est data rate Bcorresponding to a
single MA&"d )/U per !ms TT.C can the 5%")/%&5 be
successfull3 received at the cell edge^
A;erage #e !S1DS#! T"roug"put Throughput B9bpsC of cell.
A;erage User !S1DS#! T"roug"put Throughput B9bpsC of individual users.
A;erage E !S1&DS#! codes used Number of 5%")/%&5 codes t3picall3 used. .f all the codes are
constantl3 in use then more codes could be added or else the
5%/)A po1er partition could be reduced. .f not all the codes are
used then the 5%/)A po1er partition could be made bigger or the
number of codes reduced.
%*)%)2Optimization guideines
4;.4.=.4 E>pected J&I ;aues
4;.4.=.! Sensiti;ity anaysis
The amount of 5%/)A resources allocated 1ill var3 from deplo3ment to deplo3ment according to the
priorities and needs of customers. At one eAtreme the operator ma3 1ant to minimise the impact of
5%/)A on Rel++ capacit3, in 1hich case onl3 a fe1 codes and a small amount of po1er should be
allocated to 5%)/A, 1hile at the other eAtreme the operator ma3 have an 5%/)A overla3 or access
point strateg3, in 1hich case the maAimum number of codes BM,T Node ' allo1s up to $ in U%R3C
and po1er Bup to the maAimum cell po1er minus the common channel and pilot po1er minus an
overhead for /&5sC should be allocated. Unless it is eApected that the net1or9 1ill be /0 code limited
the use of $ codes Bthe maAimum availableC is al1a3s recommended as it 1ill allo1 a &ategor3 < mobile
to receive data at the maAimum rate provided it is close enough to the base station.
-igure 4; "4> sho1s the results of Matlab simulations b3 Nic9 7hinnet Bbased on the follo1ing
assumptionsL $ 5%")/%&5 codes, &/MT4, ! 7 cell po1er, 4.< 7 5%"%&&5 po1er, TU3 po1er
dela3 profile, sub"urban macro geometr3 distribution, &ategor3 < U*sC. .t sho1s the average cell and
user throughput Bthe latter of 1hich is 9ept more or less fiAed throughout b3 var3ing the number of
usersC as a function of the size of the 5%/)A po1er partition.
Motorola &onfidential )roprietar3 4$>
-igure 4;"4>L &ell and User throughput vs. 5%/)A )o1er for $ codes, &/MT4
The follo1ing can be noted from this curveL
.t can be seen that at ver3 lo1 po1ers Bbelo1 c. !_ cell po1erC the cell throughput drops ver3
Juic9l3. This is because the MA&"hs scheduler is choosing to attempt to send data to a user 1hose
&6. Jualit3 estimate is so lo1 that no data can actuall3 be sent. This happens due to the nature of
the scheduler 1hich uses a metric based on dela3 and fairness as 1ell as &6., so that a user 1hich
has suffered long dela3s gets chance to be scheduled even though its &6. is ver3 poor. .n U%R3
there is no option for the scheduler to choose a second user if transmission to the first selected user
cannot ta9e place. This suggests that the 5%/)A po1er partition for U%R3 should be set to be at
least !_ of the cell po1er.
&ell throughput gro1s slo1l3 after c. !$_ cell po1er, e.g. to double the throughput from the !$_
value 1e need to triple the po1er. This suggests that unless an 5%/)A"onl3 overla3 scenario is
being considered then no more than c. $_ of the cell po1er should be allocated to 5%/)A in
U%R3 as it 1ill not be used efficientl3.
.n addition to these considerations, the 5%"%&&5 po1er and total 5%/)A po1er must be set so that the
5%"%&&5 and the 5%")/%&5 using at least the minimum 5%/)A data rate Bcorresponding to one
MA&"d )/U per !ms TT.C can be detected at the cell edge. The latter reJuirement 1ill be affected b3
the choice of )/U size configured in the RA' mapping algorithm. The larger the )/U size, the larger
the minimum rate and the smaller the coverage area for a given po1er partition.
Motorola &onfidential )roprietar3 4$;
%*)+ A#JBNA#JB#,I reporting settings
%*)+)%&arameter o;er;ie=
4;.!.4.4 Description
These parameters determine the repetition factors Bthe number of consecutive !ms TT.s over 1hich the
same message should be repeatedC for A&EKNA&EK&6. messages and the &6. feedbac9 c3cle Bthe
period, in units of !ms TT.s, of &6. reportingC used on the 5%"/)&&5 on the U0.
The A&E and NA&E messages share a common repetition factor 1hich ma3 var3 according to 1hether
the U* is in soft handover or not and according to the value of the U*2s minimum inter"TT. interval
BN'L the minimum inter"TT. interval, the value of 1hich is defined b3 the U* categor3, specifies the
minimum number of !ms TT.s 1hich must separate the starts of transmissions to the same U* on the
5%")/%&5C. The dependence on TT. interval is onl3 used for U*s not in %5,. -or eAample, an
A&EKNA&E message from a U* not in %5, 1ith a minimum inter"TT. interval of ! uses the repetition
factor ACKNACKRE,< 1hile an A&EKNA&E message from a U* in %5, uses the repetition factor
ACKNACKRE,,ORSHO regardless of the minimum inter"TT. interval.
-or the &6. message the repetition factor and feedbac9 c3cle var3 onl3 according to 1hether the U* is
in soft handover or not. -or eAample, a &6. message from a U* not in %5, uses the repetition factor
C>IRE, and the feedbac9 c3cle C>I,BCK 1hile a U* in %5, uses the repetition factor
C>IRE,,ORSHO and the feedbac9 c3cle C>I,BCK,ORSHO.
The argument for allo1ing these parameters to var3 according to %5, status isL
5%"/)&&5 po1er is determined b3 the /)&&5 po1er Bvia offsets, see 4;.3C but the 5%"/)&&5
is onl3 decoded b3 the 5%/)A scheduling cell 1hereas the /)&&5 is received b3 all %5, cells.
.n %5, the /)&&5 po1er is t3picall3 lo1er due to the benefits of diversit3. These benefits are not
shared b3 the 5%"/)&&5 1hich 1ill therefore suffer poorer performance.
This can be compensated for b3 repeating the message several times 1hen in %5,, but at the
eApense of restricting ho1 often the U* can receive data. .n practice this should not be a problem as
in a loaded s3stem a U* is unli9el3 to be scheduled on consecutive !ms TT.s.
4;.!.4.! Dependencies
The 5%"/)&&5 1ill affect the behaviour of the U0 po1er control algorithm.
%*)+)+Reated -'T commands
The commands for configuring the A&EKNA&EK&6. reporting settings are sho1n belo1. The related
database parameters are documented in a separate spreadsheet, the ?Reference )arameters
%preadsheet@.
Motorola &onfidential )roprietar3 4$+
%*T 5%/)&&5 %et RN&"oriented 5%"/)&&5 po1er control algorithm parameters
A// &*005%/)&&5 Add cell"oriented 5%"/)&&5 po1er control algorithm parameters
M,/ &*005%/)&&5 Modif3 cell"oriented 5%"/)&&5 po1er control algorithm parameters
RM: &*005%/)&&5 Remove cell"oriented 5%"/)&&5 po1er control algorithm parameters
%*)+)3Jey per$ormance indicators
J&I Descriptions
&7NA#J1UA#J8 )robabilit3 that a NA&E message is incorrectl3 decoded as an A&E. This
situation is detrimental to pac9et data transfer and can onl3 be detected in
the higher la3ers, thus reJuires small failure probabilit3.
&7A#J1UN#J8 )robabilit3 that an A&E message is incorrectl3 decoded as a NA&E. This
situation can usuall3 be recovered at the receiver and thus reJuires onl3
moderate failure probabilit3.
&7DTT1UA#J8 )robabilit3 that a /T8 is incorrectl3 decoded as an A&E. Arises 1hen the
U* misses the decoding of the 5%"%&&5 and, as a result, does not transmit
an ac9no1ledgement as eApected b3 the Node '. %ince this event occurs
1ith lo1 probabilit3 b3 design, the probabilit3 of detecting an A&E 1hen
nothing is sent ma3 be 9ept at a moderate probabilit3
%*)+)2Optimization guideines
4;.!.=.4 E>pected J&I ;aues
J&I Vaue
&7NA#J1UA#J8 \ 4e"=
&7A#J1UN#J8 \ 4e"!
&7DTT1UA#J8 \ 4e"!
4;.!.=.! Sensiti;ity anaysis
*Atensive simulation studies of the 5%"/)&&5 parameter settings have been performed Bsee
?A&EKNA&E and &6. %ignalling :alues for the 5%"/)&&5@, Rapeepat Ratasu9 and Amitava
GhoshC. .n those simulations it 1as determined that it is preferable to use repetition 1hen in %5,,
rather than boosting the message offsets.
%*)3 !S1D&##! po=er o$$sets
%*)3)%&arameters o;er;ie=
4;.3.4.4 Description
These parameters determine the po1er offsets, relative to the U0 /)&&5 transmit po1er, used b3 the
various messages, A&E, NA&E or &6., carried on the 5%"/)&&5.
-or the A&E and NA&E messages the po1er offsets var3 according to 1hether the U* is in soft
handover or not and according to the value of the U*2s ?minimum inter"TT. interval@. The dependence
on TT. interval is onl3 used for U*s not in %5,. -or eAample, an A&E message from a U* not in %5,
1ith a minimum inter"TT. interval of 4 uses the po1er offset ACKPO1 1hile a NA&E message from a
U* in %5, 1ith a minimum inter"TT. interval of 3 uses the po1er offset NACKPO:,ORSHO .
-or the &6. message the po1er offsets var3 onl3 according to 1hether the U* is in soft handover or
not. -or eAample, a &6. message from a U* in not in %5, uses the po1er offset C>IPO, 1hile a U*
in %5, uses C>IPO,ORSHO.
The po1er offsets are allo1ed to var3 according to %5, status for the same reason as the repetition
factors, i.e. to compensate for lo1er /)&&5 po1ers 1hen in %5,. )o1er offsets ma3 be varied in
%5, instead of or in conOunction 1ith the repetition factors.
4;.3.4.! Dependencies
The 5%"/)&&5 po1er offsets 1ill affect the behaviour of the U0 po1er control algorithm.
%*)3)+Reated -'T commands
The commands for configuring the 5%"/)&&5 po1er offsets are sho1n belo1. The related database
parameters are documented in a separate spreadsheet, the ?Reference )arameters %preadsheet@.
%*T 5%/)&&5 %et RN&"oriented 5%"/)&&5 po1er control algorithm parameters
Motorola &onfidential )roprietar3 4<4
A// &*005%/)&&5 Add cell"oriented 5%"/)&&5 po1er control algorithm parameters
M,/ &*005%/)&&5 Modif3 cell"oriented 5%"/)&&5 po1er control algorithm parameters
RM: &*005%/)&&5 Remove cell"oriented 5%"/)&&5 po1er control algorithm parameters
%*)3)3Jey per$ormance indicators
J&I Descriptions
&7NA#J1UA#J8 )robabilit3 that a NA&E message is incorrectl3 decoded as an A&E. This
situation is detrimental to pac9et data transfer and can onl3 be detected in
the higher la3ers, thus reJuires small failure probabilit3.
&7A#J1UN#J8 )robabilit3 that an A&E message is incorrectl3 decoded as a NA&E. This
situation can usuall3 be recovered at the receiver and thus reJuires onl3
moderate failure probabilit3.
&7DTT1UA#J8 )robabilit3 that a /T8 is incorrectl3 decoded as an A&E. Arises 1hen the
U* misses the decoding of the 5%"%&&5 and, as a result, does not transmit
an ac9no1ledgement as eApected b3 the Node '. %ince this event occurs
1ith lo1 probabilit3 b3 design, the probabilit3 of detecting an A&E 1hen
nothing is sent ma3 be 9ept at a moderate probabilit3
%*)3)2Optimization guideines
4;.3.=.4 E>pected J&I ;aues
J&I Vaue
&7NA#J1UA#J8 \ 4e"=
&7A#J1UN#J8 \ 4e"!
&7DTT1UA#J8 \ 4e"!
4;.3.=.! Sensiti;ity anaysis
*Atensive simulation studies of the 5%"/)&&5 parameter settings have been performed Bsee
?A&EKNA&E and &6. %ignalling :alues for the 5%"/)&&5@, Rapeepat Ratasu9 and Amitava
Motorola &onfidential )roprietar3 4<!
GhoshC. .n those simulations it 1as determined thatL
A&E messages should be sent at higher po1er than NA&E messages as the3 must be decoded 1ith
greater certaint3 in order to minimise the probabilit3 of the Node ' misinterpreting a NA&E as an
A&E since this situation is detrimental to pac9et data transfer and can onl3 be detected in the higher
la3ers, 1hereas the Node ' misinterpreting an A&E as a NA&E is less detrimental and can be
overcome b3 the receiver.
The NA&E offset need not be too large as a NA&E message 1hich fails to be decoded 1ill have
little conseJuence as the M,T Node ' 1ill interpret a lac9 of an A&EKNA&E message as a NA&E
so it is better that a NA&E not be decoded at all than it be decoded incorrectl3 as an A&E.
Motorola &onfidential )roprietar3 4<3
%9#a Admission #ontro
%9)% O;er;ie=
%9)%)%Introduction
-or ne1 call reJuests, inter freJuenc3 hard handoffs and call reconfigurations B1ithin the same transport
channelC, both the do1nlin9 and uplin9 admission control chec9s are performed as per the flo1chart in
-igure 4+ "4;.
-igure 4+"4;L -lo1 diagram for ne1 call reJuests, inter freJuenc3 hard handoffs and call
reconfigurations B1ithin the same transport channelC
The basic algorithm flo1 is ver3 similar as in U%R! also. .n fact, for non"5%/)A calls, there is
absolutel3 no difference if the reJuest is not one involving 5%/)A. -or 5%/)A calls t1o reJuests are
generated, one for the /0 bearer part to the 5%/)A admission control module and the second to the
/&5 admission control algorithm for the /0 /&5 admission on the do1nlin9, and the U0 /&5 and
Motorola &onfidential )roprietar3 4<=
5%"/)&&5 admission on the uplin9. Thus, it is not onl3 /0 /)&&5, but also /0 /)/&5 is
included. /)&&5 1ill onl3 carr3 T)&, T-&. and )ilot information, %R' and R' is carried on
/)/&5. The flo1 of the /&5 admission control remains the same as before N uplin9 chec9 follo1ed
b3 the do1nlin9. The decision of RRM module level needs the results of /&5 /0 and U0 admission
control modules as 1ell as the 5%/)A admission control module. 'earer reconfiguration 1ith the same
class is handled Juite easil3 N 5%/)A to 5%/)A b3 the 5%/)A admission control and /&5 to /&5
b3 the /&5 admission control Blogic is Oust as before in U%R!C. 5o1ever, for bearers being
reconfigured from 5%/)A to /&5 or vice"versa, certain specific procedures need to be follo1ed and
described in section 4.4.=.
4+.4.4.4 Reguar D#! #A# modue
The call admission control algorithm applies to /&5 calls and Rel++ po1er consuming portions of
5%/)A calls, namel3, /0 /&5, U0 /&5. .t does not cover -A&5KRA&5 admission control.
There are t1o &A& algorithms available per operator2s choiceL )o1er Measurement based call
admission control BA0G,R.T5MG-.R%TC, and *Juivalent Number of Users based call admission
control BA0G,R.T5MG%*&,N/C. The *NU not onl3 can be used as a primar3 &A& algorithm but
can also as a bac9up algorithm 1hen the )o1er Measurement algorithm is not performing due to fault3
condition.
4+.4.4.! !SD&A1reated D#! #A# modue
The admission control mechanism of the 5%/)A related /&5 &A& module is ver3 similar to the
regular /&5 &A& module 1ith some differences that aim to incorporate 5%/)A reJuests as 1ell as
improve upon noted issues from before.
.n 5%/)A Related /&5 &A& module, admission of the uplin9 5%"/)&&5 is carried out, the
incremental 5%"/)&&5 load factor is calculated 1ith 5%"/)&&5 field po1er and assumed activit3
factor, and the summarised load factor of U0 /&5 is used to ma9e admission decision.
The po1er measurement of ?Transmitted &arrier )o1er of All &odes Not Used for 5%")/%&5 or 5%"
%&&5 Transmission@ in N'A) is used in &A& algorithm 1hen considering 5%/)A influence.
4+.4.4.3 !SD&A #A# modue
Admission control of 5%"/%&5 bearers is concerned 1ith ensuring that the 6o% reJuirements of the
call such as throughput and transfer dela3s are satisfied. The 5%/)A &A& module is focus on the
admission control of the do1nlin9 5%"/%&5. 5%/)A &A& algorithm includes t1o 9inds of admission
control algorithm. ,ne is general admission control, 1hich is focus on maAimum number and maAimum
bit rate. Another is admission control for %treaming RA's, 1hich focus on the sum of Guaranteed 'it
Rates.
4+.4.4.= Recon$iguration bet=een D#! and !S1DS#!
-or the scenario of a transport channel s1itch bet1een /&5 and 5%/)A Band vice"versaC, admission
Motorola &onfidential )roprietar3 4<$
flo1 is illustrated in -igure 4+ "4+ and -igure 4+ "!.
-or an 5%/)A call being changed to a /&5 call, the RN& 1ill first remove an3 call state at the
5%/)A &A& module and then, at the /&5 &A& module, the RN& 1ill tr3 to admit the /0 /&5 part
of the call Boriginall3 carried on 5%")/%&5C. The U0 and /0 %R', carried on /&5 both before and
after the 5%"/%&5 admission 1ill not be considered. .f reOected, the call 1ill remain on 5%"/%&5
channel. %1itching from 5%"/%&5 to /&5 is t3picall3 triggered on handover Be.g. if ne1 best cell
does not support 5%/)AC.
-or a /&5 call being changed to an 5%/)A call, the RN& 1ill first remove the contribution of the /0
/&5 bearer, 1hich 1ill be carried on 5%")/%&5, on the /0 part of the /&5 &A& module and then
perform an admission chec9 for the 5%"/)&&5 on the U0 part of the /&5 &A&. Then the RN& 1ill
perform an admission chec9 in 5%/)A &A& module. %1itching from /&5 to 5%"/%&5 1ill be
triggered b3 mobilit3 or the removal of a congestion situation.
-igure 4+"4+L -lo1 diagram of Tr&5 reconfiguration from /&5 to 5%/)A
Motorola &onfidential )roprietar3 4<<
-igure 4+"!L -lo1 diagram of Tr&5 reconfiguration from 5%/)A to /&5
%9)%)+D#! Admission #ontro
This section covers Regular /&5 &A& module and 5%/)A related /&5 &A& module 1hich are
described in -ig 4. )o1er Measurement based call admission control algorithm and *Juivalent Number
of Users based call admission control algorithm are described. The main difference bet1een Regular
/&5 &A& and 5%)/A related /&5 &A& is focus on U0 5%"/)&&5 admission and use of the
UTransmit carrier po1er not consumed b3 5%"/%&5 and 5%"%&&5U )o1er measurement, in the cases
1here 5%/)A calls are to be admitted.
4+.4.!.4 'easurement 0ased #a Admission #ontro Agorit"m
4+.4.!.4.4 Algorithm ,vervie1
.n 7&/MA s3stem, admission of a ne1 call 1ill increase the loading in both uplin9 and do1nlin9. .n
the uplin9, the increase in the loading is indicated b3 the increase in the total interference level Bi.e.,
Received Total 7ideband )o1er RT7)C. .n the do1nlin9, the increase in the loading is indicated b3 the
increase of transmitted po1er. The increase of loading in both uplin9 and do1nlin9 ma3 cause the
s3stem drop calls.
To guarantee the eAisting user2s transmission Jualit3 1hile maintaining coverage and optimal radio
resource utilization, admission control is used to manage the allocation of radio resources using the
/&5 to the ne1 call arrivals. The admission control is carried out for the follo1ing t3pes of call
reJuestsL
Motorola &onfidential )roprietar3 4<>
Ne1 call reJuest
%oft handover reJuest
5ard handover reJuest
*Aisting call reconfiguration reJuest
%R' ReJuest on the /&5
5%/)A ReJuest on associated U0 5%"/)&&5
The admission control algorithm covers the po1er based admission control for dedicated transport
channel. -or dedicated transport channel, the admission control process is divided into uplin9 admission
control and do1nlin9 admission control, 1hich are carried out separatel3 in the uplin9 first then
do1nlin9. /ifferent priorit3 can be given for different service b3 setting up a higher threshold for the
service B'!C&n$Th% $s4 '!OtherTh%C and 5andover.
Note that the call admission control algorithm described in this section covers onl3 the po1er aspect of
the overall call admission process. .t does not cover code management, ATM bac9haul lin9 capacit3,
&)U usage, common channel -A&5KRA&5 admission control. This po1er based &A& algorithm also
interacts 1ith other algorithm such as /&&&, /R/, )U&, 0&&, .nter"carrier 0oad 'alancing
algorithms, and the Radio Resource Management BRRMC. The final acceptance of the call is performed
b3 the RRM based on the result collected from other algorithms to ensure all the UTRAN resources are
used properl3 and efficientl3.
4+.4.!.4.4.4 Uplin9 Admission &ontrol
4. Get data rate and *bKNo for the reJuest serviceP
!. Get current RT7) and bac9ground noise to calculate current load factorP
3. Get U0 common channels2 load factorP
=. &alculate the predicted load factor per trigger of the &A&P
$. &ompare 1ith the thresholdP
<. .f eAceed reOect the callP
>. ,ther1ise proceed to the do1nlin9 chec9ing.
4+.4.!.4.4.! /o1nlin9 Admission &ontrol
4. Get data rate and *bKNo of the reJuest serviceP
!. &alculate the do1nlin9 transmitting po1er increment for the reJuestP
Motorola &onfidential )roprietar3 4<;
3. Get the B*cKNoCi of all the current services iP
=. ,btain the current do1nlin9 total transmitted po1er for the serving cell N this is the N'A) ?TA
carrier po1er@ or UTA carrier po1er not used b3 5%"%&&5 or 5%"/%&5U measurement
filtered 1ith moving average filterP
$. &alculate the predicted transmitting po1er percentageP
<. &ompare to the threshold B/l&onvThd, /l,therThd, /l5oThdC. .f it eAceeds the threshold, call
is reOected. ,ther1ise admit the call.
4+.4.!.4.! Trigger of Admission ReJuest
4+.4.!.4.!.4 Ne1 &all ReJuest
The ne1 call reJuest is described as the 4
st
RA' reJuest 1here the %R' 1as established on the common
channels -A&5KRA&5 prior to the RA' reJuest.
Upon a ne1 call reJuest, the &A& first eAecute the uplin9 admission control as above. .f uplin9 is
accepted, then proceed to the do1nlin9. .f both accepted, then call is admitted.
The thresholds used for the ne1 call are dependent on the reJuested service t3peL U#on;T"d?
D#on;T"d? UOt"erT"d? DOt"erT"d.
4+.4.!.4.!.! Admission &ontrol for Reconfiguration
The admission control for the reconfiguration can be triggered b3L
/&&& algorithm to change the data rate or transport channel,
A ne1 RA' reJuest 1here the %R' has alread3 been established on the /&5 previousl3,
Multi"RA' reJuest.
Upon reJuest, the &A& calculates the eAiting load factor, and the ne1 load factor based on the
reconfigured RA' reJuest. .f the ne1 load factor is less than the eAisting load factor, accept the reJuest.
,ther1ise the load factor is compared to the threshold of the reJuested service.
4+.4.!.4.!.3 Admission &ontrol for 5andover
-or intra"freJuenc3 soft and hard handover, uplin9 admission control is not needed as the noise from the
U* has alread3 been presented in the ne1 cell. %o, proceed to do1nlin9 admission control of the ne1
call reJuest. The service specific threshold is replaced 1ith the handover threshold Bi.e. )!H&Th%1.
-or inter"freJuenc3 hard handover reJuest, its estimated total uplin9 and do1nlin9 load factors for the
serving cell are obtained the same 1a3 as the3 are described in the ne1 call reJuest section. The
Motorola &onfidential )roprietar3 4<+
estimated total uplin9 load factor for the serving cell is chec9 against the uplin9 and do1nlin9 handover
thresholdsL U!oT"d and D!oT"d.
To give high priorit3 to the handover reJuests, a higher admission threshold is used for handover
admission control.
4+.4.!.4.!.= Admission &ontrol for Multi"RA's
The admission of Multi"RA' is handled depends on ho1 the RA's are reJuested.
.n the case of multiple RA's are included in one RA' Assignment ReJuest, the RN& estimates the
total load factor b3 adding up all the load factors of the reJuested RA's based on the service t3pe
and data rate. .t then chec9s the total load factor against the thresholds of each RA' per service
t3pe. The RA's are admitted onl3 if all the RA's can be accepted b3 the &A&. ,ther1ise all the
RA's included in the reJuest 1ill be reOected.
.n the case of multi"RA' call reJuest through multiple RA' Assignment ReJuests, the RN&
handles the subseJuent RA' reJuest as a reconfiguration case 1ith the thresholds based on the
service t3pe.
4+.4.!.4.!.$ Admission &ontrol for Uplin9 5%"/)&&5
.n the case of 5%/)A reJuest, admission control for U0 5%"/)&&5 is triggered. An incremental
uplin9 /&5 load factorKeJuivalent user for 5%"/)&&5 is calculated. The increment is computed b3
eJuations that ta9e the 5%"/)&&5 field po1er offset parameters into account as 1ell as some
assumption on the activit3 of the 5%"/)&&5.
4+.4.!.4.!.< Admission &ontrol for the %ignalling Radio 'earer on /&5
Admission of %R' established onto the /&5 is handled based on the ?*stablishment &ause@ included
in the RR& &onnection ReJuest message received from U*. .f the &ause is ?*mergenc3 &all@, the RN&
&A& shall admit the %R'.
.f the cause is ?Registration@ or ?/etach@, the RN& chec9s the uplin9 and do1nlin9 ?&ongestion
.ndicator@ for the cell. The %R' can be accepted onl3 if the cell is N,T under the congestion condition
in both directions. The Uplin9 and /o1nlin9 &ongestion .ndicator is a congestion condition set b3 the
0&& algorithm based on the upper bound of ,0& thresholdsL UO-#T"d and DO-#T"d. The
condition is clear 1hen the load is belo1 the lo1er bound of ,0& thresholds UO-#RsT"d and
D-O-#RsT"d. Refer to Radio 0oad &ontrol section of RRM %-RA%.
.f the &ause is
,riginating &onversational &all,
Terminating &onversational &all,
.nter"RAT cell re"selection,
.nter"RAT cell change order,
the RN& admits the %R' based on the conversational thresholdsL U-#on;T"d and D#on;T"d.
.f the &ause is
,riginating %treaming &all,
,riginating .nteractive &all,
,riginating 'ac9ground &all,
Terminating %treaming &all,
Terminating .nteractive &all,
Terminating 'ac9ground &all,
&all re"establishment,
the RN& admits the %R' based on the non"conversational thresholdsL U-Ot"erT"d and DOt"erT"d.
-or all other &auses not covered above, i.e.
,riginating %ubscribed traffic &all,
,riginating 5igh )riorit3 %ignalling,
,riginating 0o1 )riorit3 %ignalling,
Terminating 5igh )riorit3 %ignalling,
Terminating 0o1 )riorit3 %ignalling,
Terminating " cause un9no1n.
the %R' is established onto the common channel, therefore no &A& is performed.
4+.4.!.4.!.> Admission &ontrol for the /&&&
The call admission reJuest initiated b3 the /&&& is treated as a ?reconfiguration@ service described in
the UAdmission &ontrol for the ReconfigurationU. The threshold used to compare 1ith is conversational
or non"conversational threshold based on the t3pe of service. .f the reconfigured data rate is lo1er than
the eAisting one, then the call is admitted. .f it2s higher, then the load factor is compared 1ith the
threshold of the traffic t3pe Oust li9e the ne1 call to determine if the reJuest can be granted. .n the case
of reconfiguration is reOected b3 the &A&, the call 1ill be continued 1ith current data rate.
Note in order for the /&&& algorithm to move a U* from -A&5 to /&5 state, the %RN& has to be
co"located 1ith &RN& such that an internal message can be sent from /&&& to &A& algorithms to
trigger the R' ?reconfiguration@. ,ther1ise, %RN% relocation has to occur prior to /&&& can assign
/&5 to the U*.
Motorola &onfidential )roprietar3 4>4
4+.4.!.4.!.; Admission &ontrol for *mergenc3 &all
/uring emergenc3 call admission, the po1erKload factor and ,:%- code usage are chec9ed. .n case of
po1er resource or ,:%- resource chec9 failure Bi.e. due to s3stem overloadC for an emergenc3 call
reJuest, a priorit3 and pre"emption mechanism 1ill 9ic9 in to release a selected non"emergenc3 call. The
priorit3 and pre"emption mechanism should select a U*, 1hich has onl3 one RA' if possible, and has
the same %- level as that reJuired b3 the emergenc3 call reJuest. .f the mechanism cannot find a U* at
that %- level, it should select another U* at the neAt %- level so that the selected U* can be pre"empted
to release radio resource for the emergenc3 call reJuest. The selection and pre"emption is handled
outside the &A& algorithm.
4+.4.!.4.!.+ Admission &ontrol for /irect Retr3 /ecision B/R/C
,nce an alternative"serving cell is selected for the direct retr3, a ne1 call reJuest is sent to the RN&
1hich manages the cell. The &A& for the ne1l3 selected serving cell 1ill conduct a call admission
control as the ne1 call reJuest and send the result to the RR Management in the RN& for the final
admission decision.
4+.4.!.4.!.4 Admission &ontrol for .nter"&arrier 0oad 'alancing
The 0/' has a set of parameters and thresholds to select a U* to recommend hard handover to a
different carrier. &A& 1ill be performed for the target cell 1hen reJuested.
4+.4.!.4.3 &alculation of 0oad -actor
This section provides a high"level vie1 of the 0oad -actor calculation.
4+.4.!.4.3.4 Uplin9 0oad -actor *Juation
The uplin9 predicted total load factor
c
@(
can be calculated asL
NAC, AC, comm @( @(
(
K
c
+ + +
1here

@(
is the uplin9 current total load factor RT7) is filtered 1ith an alpha filter and a moving
average filter, and
@(
is calculated 1ith eJuation
total N @(
. P K 4
1here
P
N
is the bac9ground noise. .ts value can be determined b3 one of the t1o methods depends
upon the room condition of the site, especiall3 temperature.
.
total
is the RT7) in the measurement report. .n the definition of
@(
the filtered value of the
ratio .
total
is used.
( is the load factor for the reJuest. &alculation of 0 is dependent on the trigger of the &A&, e.g.
ne1 call or inter"freJuenc3 handover reJuest, %R' admission reJuest, multi"RA' reJuest.

comm
is the common channel load factor. .t is currentl3 a database parameter that can be set using
MM0 command.
Motorola &onfidential )roprietar3 4>!
AC, K NAC,
is the reservation for the A&EKNA&E portion of the 5%"/)&&5. B0MT parameterL
'LHS)PCCHRS3),ACTOR1
-or multiple call reJuests during one measurement reporting interval, the same RT7) value is used.
No method has been devised to solve the problem caused b3 set"up latencies.
Uplin9 load factor
@(
is al1a3s calculated b3 formula
total N @(
. P K 4
1henever it is used. The
predicted uplin9 load factor is onl3 used in admission chec9, after chec9, it is not used again. 5o1ever,
for the algorithm under abnormal conditions, total eJuivalent number of uses is 9ept in the data"base
until the corresponding call ends.
-or 5%/)A calls the U0 portion is considered as a multi"RA' call. .n multi"RA' load factor
estimation, *cKNo of 5%"/)&&5 associated 1ith 5%"/)&&5 activit3 factor is used. A detailed model
of the 5%"/)&&5 activit3 factor is calculated using the &6. reporting freJuenc3 B#,I/0#J,
#,I/0#J/ORS!OC, &6. po1er B#,I&O, #,I&O/ORS!OC, &6. repetition factor B#,IRE/,
#,IRE//ORS!O? and the %5, status of the U0 /&5 bearer.
4+.4.!.4.3.4.4 0oad factor for the ne1 %R'
.f the %R' is established on the /&5, the %R' is considered as a ne1 call reJuest.
The load factor for the %R' isL

L (1+ f )
1
1+
1
E
c
/ N
0
( )
SRB
1here
f is other"cell interference factor, an ,DM cell"oriented parameter B'LIntere,act&r1.
The B*cKNoC
%R'
is the *cKNo for the %R' reJuest. .t can be calculated based on the follo1ing
eJuationL

N
3
8
R
v
N
3
b c
1here the *bKNo is obtained based on the follo1ing stepsL

0oo9 up the reference '0*R vs. *bKNo curves preset cell environment t3pe.
.dentif3 the suited reference curve for the service t3pe of the reJuest, in terms of &% &&
B&onvolutional &odingC, &% T& BTurbo &odingC, )% &&, and )% T&. .n this case, &% &&
B4!.! 9bitKs AMRC is used as the reference curve for %R'.
'ased on the target '0*R, find the corresponding *bKNo from the reference curve.
AdOust the *bKNo for the specific data rate, i.e. in this case either 3.= for 3.= 9bitKs %R' or
43.< for 43.< 9bitKs %R' Bthe calculation formula can be found in 4+.4.!.4.$C.
Motorola &onfidential )roprietar3 4>3
The activit3 factor for the reJuest v is hard"coded as 4 in the load factor calculation.
R is the data rate of the reJuest, i.e. 3.= 9bitKs or 43.< 9bitKs.
4+.4.!.4.3.4.! 0oad factor for the first RA' reJuest 1hen %R' is established on /&5
( ) ( )

,
_
+
+
SR- c comb c
N 3 N 3
(

K
4
4
4
K
4
4
4
fC B4
1here
f is the other"cell interference factor, an ,DM cell"oriented parameter B'LIntere,act&r1.
B*cKNoC
%R'
is the *cKNo calculated for 3.= 9bitKs or 43.< 9bitKs %R' using the &% && as reference
curve. Activit3 factor is hard coded to 4.
B*cKNoC
comb
is the *cKNo for the combined R' and %R' for 1hich the combined activit3 factor is
hard"coded as 4.
4+.4.!.4.3.4.3 0oad factor for the ne1 call and inter freJuenc3 handover
( )
comb c
N 3
f (
K
4
4
4
C 4 B
+
+
1here
f is the other"cell interference factor, an ,DM cell"oriented parameterB'LIntere,act&r1.
The B*cKNoC
comb
is the *cKNo of the combined service of an %R' and of traffic RA'BsC reJuests, for
1hich the combined activit3 factor is hard"coded as 4.
4+.4.!.4.3.4.= 0oad factor for the reconfiguration
.f B*cKNoC
comb!
is greater than B*cKNoC
comb4
, the load factor for the reconfiguration reJuest is calculated
asL
( ) ( )

,
_
+
+
4 !
K
4
4
4
K
4
4
4
C 4 B
comb o c comb o c
N 3 N 3
f (
1here
Motorola &onfidential )roprietar3 4>=
B*cKNoC
comb4
and B*cKNoC
comb!
are respectivel3 the *cKNo for the combined service before and after
the reconfiguration.
4+.4.!.4.3.4.$ 0oad factor for Multi"RA's
The load factor for the multi"RA' is estimated similar to the reconfiguration reJuest.
( ) ( )

,
_
+
+
4 !
K
4
4
4
K
4
4
4
C 4 B
comb o c comb o c
N 3 N 3
f (
1here
B*cKNoC
comb4
is the *cKNo for the eAisting RA'BsC.
B*cKNoC
comb!
is the *cKNo for the ne1 multiple RA' service Bcombined the reJuest 1ith the eAisting
RA'BsCC.
4+.4.!.4.3.! /o1nlin9 0oad -actor *Juation
.n Regular &A& module, no po1er 1as used b3 5%/)A channels. The filtered N'A) po1er
measurement of ?TA carrier po1er@ is used to calculate /0 0oad -actor. .n 5%/)A related /&5 &A&
module, the filtered N'A) po1er measurement of ?Transmitted &arrier )o1er of All &odes Not Used
for 5%")/%&5 or 5%"%&&5 Transmission@ is used to calculate /0 0oad -actor. The measurements in
these t1o scenarios are all called P
non)S/PA
(NC in the /0 load factor calculations.
The do1nlin9 predicted total load factor is defined as
non)S/PA
non)S/PA non)S/PA
/(
P
P P N P
maA,
maA, c
C B
+ +
1here
P
max'non)S/PA
is the total po1er configured for all non"5%/)A channels.
is the /l&&50oad-actor in the parameter database.
P
non)S/PA
(N) is obtained from the current filtered N'A) po1er measurements of the non"5%/)A
codes P
RelJJ
after filtering b3 a moving average filter 1ith 1indo1. This moving average filter is
designed to counteract an3 measurement errors or biases.
After each admitted user, P
non)S/PA
(N) is not updated.
-or multiple call reJuests during one measurement interval the same value of P
non)S/PA
(N) is used.
P is the po1er increment due to the reJuest. /epending on the t3pe of the reJuest, the calculation
of P is described in the follo1ing sections.
Motorola &onfidential )roprietar3 4>$
.f the 5%/)A admission control or the RRM admission control chooses to reOect the user, then the
contribution to P
non)S/PA
(N) of the reOected user is not subtracted, because the values are not updated
1ith ever3 admission in the first place.
Notes
No set"up latenc3 is considered.
No RA&5K-A&5 information is used for /&5 admission control.
.n the current realization, the /%&5 is not considered.
At present, other than the 6o% class, no other entr3 of the 6o% element Btraffic handling priorit3, etc
MC is used in the admission control.
.n the current realization P
max
is assumed fiAed. .f this is variable, then the algorithm 1ould need to
factor this in both the admittance criteria as 1ell as the update procedure.
-or 5%/)A user, if there is no /&5 service, then /&5 1ill onl3 carr3 %R', if there is other /&5
service Bsuch as AMRC, then /&5 1ill carr3 %R'VAMR, 1hich is a combination service. .n U%R3
&A&, 5%/)A part is ne1l3 added to admit the 5%")/%&5 and 5%"%&&5. There is no direct
interaction bet1een the t1o parts, and there is no separate /0"/)&&5 admission control,.
4+.4.!.4.3.!.4 )o1er increment for %R'
The %R' reJuest is considered as a ne1 call reJuest. The po1er increment is calculated as follo1s.
( )
( )
1
]
1

+
C B C 4 B
C K G B K 4
K
C B

4
N P
N 3 CP.C)
P
N 3
N 3
< N P
non)S/PA
SR- c
CP.C)
SR-
c
SR-
c
N

1here
B*cKNoC
%R'
is the /)&5 *cKNo for the %R' service. .t can be calculated asL
C K G B K
No 3b /PC)
8
R
v N 3
c

1here
/)&5G*bKNo is obtained from the '0*R vs *bKNo curves per cell environment t3pe.
the activit3 factor v for the reJuest is hard"coded as 4 in the calculation to be conservative
R is the actual data rate, e.g. set to 3.= 9bitKs for 3.= 9bitKs %R'.
C BN P
non)S/PA
is the carrier transmit po1er for the total non"5%/)A active users and it is
obtained from the current filtered N'A) po1er measurements of the non"5%/)A codes after
filtering.
(CP.C)&3cCNo)
SR-
is the &).&5 *cKNo value reported b3 the U* 1ho sent the %R' reJuest
P
CP.C)
is the &).&5 po1er for the cell
Motorola &onfidential )roprietar3 4><
represents the do1nlin9 channel orthogonalit3 factor Ban 0MT parameter Orth&,act&rC.
4+.4.!.4.3.!.! )o1er increment for ne1 call and handover
The po1er increment for a ne1 call Bno prior %R' established on /&5C and handover reJuest can be
calculated asL
( )
( )
1
]
1

+
C B C 4 B
C K G B K 4
K
C B

4
N P
N 3 CP.C)
P
N 3
N 3
< N P
non)S/PA
SR- c
CP.C)
comb
c
comb
c
N

1here
B*cKNoC
comb
is the /)&5 *cKNo for the handover or ne1 call reJuest, 1hich t3picall3 is a combined
service of a 3.= 9bitKs %R' and R'BsC, for 1hich the combined activit3 factor is hard"coded to 4 for
ne1 call and for handover reJuest.
C BN P
non)S/PA
filtering.
(CP.C)&3cCNo)
SR-
is the &).&5 *cKN value reported b3 the U* for 1hich the ne1 call or
handover reJuest 1as sent.
P
CP.C)
is the &).&5 po1er for the cell.
4+.4.!.4.3.!.3 )o1er increment for reconfiguration
-or the reconfiguration reJuest 1ith increased B*cKNoC
comb!
, the follo1ing eJuation is used to estimate
the po1er increment due to the reconfiguration
( )
4
4
!
4
C K B
K
comb
comb o c
comb c
P
N 3
N 3
P
,
_

1here ( )
( )

,
_
C B C 4 B
K G
K
4
4
4
N P
N 3 CP.C)
P
N 3 P
non)S/PA
comb
o c
CP.C)
comb
c comb

1here
B*cKNoC
comb4
is the /)&5 *cKNo before reconfiguration.
B*cKNoC
comb!
is the /)&5 *cKNo for the service after reconfiguration.
C BN P
non)S/PA
Motorola &onfidential )roprietar3 4>>
filtering.
(CP.C)&3cCNo)
comb=
is the &).&5 *cKNo value reported b3 the U* for 1hich the reconfiguration
reJuest 1as sent.
P
CP.C)
4+.4.!.4.3.!.= )o1er increment for multi"RA's
-or the multiple RA' reJuest 1ith increased B*cKNoC
comb!
, the follo1ing eJuation is used to estimate the
po1er increment due to the multiple RA' reJuestL
( )
4
4
!
4
C K B
K
comb
comb o c
comb c
P
N 3
N 3
P
,
_

1here ( )
( )

,
_
C B C 4 B
K G
K
4
4
4
N P
N 3 CP.C)
P
N 3 P
non)S/PA
comb
o c
CP.C)
comb
c comb

1here
B*cKNoC
comb4
is the /)&5 *cKNo before the reconfiguration due to the multi"RA' reJuest.
B*cKNoC
comb!
is the /)&5 *cKNo for the combined service after reconfiguration due to the multi"
RA' reJuest.
C BN P
non)S/PA
filtering.
(CP.C)&3cCNo)
comb=
is the &).&5 *cKNo default value set in the parameter database.
P
CP.C)
4+.4.!.4.= 'ac9ground Noise
.f the site is at a temperature"controlled room, the noise floor 1ill be relativel3 stable after the initial
calibration. Therefore, it is not necessar3 to change the )N value. The default method should be chosen
and the BacC#r&un%N&"se is set to the initial calibrated measurement that is done 1hen no user is in the
s3stem.
.f the site2s temperature changes along 1ith the outside, an auto"adaptive method is recommended. The
function of auto noise floor updating can be s1itched on or off in the &A& algorithm Bthe s1itch 1ill be
in the parameter databaseC. 7hen the eJuivalent number of users in the cell is lo1er than a threshold
Motorola &onfidential )roprietar3 4>;
B1ill added into the parameter databaseC, 1hich is a configurable parameter, the measured noise floor is
regarded as being a valid value. The number of users in neighbouring cells is not considered. The
duration of the auto adaptation is a configurable parameter B1ill be in the parameter databaseC.
4+.4.!.4.$ '0*R vs. *bKNo &urves
The '0*R vs. *bKNo curves can be modified via ?%*T TRA-*'N,@ command.
-our different '0*R *bKNo curves are referenced b3 the &A& for different services and can be
modified through the ?%*T TRA-*'N,@ commandL
&% &onvolutional &oding N use 4!.! 9bitKs AMR convolutional coding
&% Turbo coding N use 4!.! 9bitKs AMR turbo coding curve
)% &onvolutional &oding N use 4== 9bitKs data 1ith convolutional coding
)% Turbo &oding N use 4== 9bitKs data 1ith turbo coding
%R' N use 4!.! 9bitKs AMR &&
%ince
! !
!

K G K G
$ c
$
b b
N 3 /PC) N 3 /P/C)

+

,
the *bKNo conversion formula for &% isL
( ) ( )
!
! . 4! ,
!
! . 4! ,
!
,
!
,
! . 4!
4
4
K K
9 $
9 c
R $
R c
b R b
N 3 N 3
+
+

1here
$
is the gain factor for /)/&5 and

c
is the gain factor for /)&&5.

The *bKNo conversion formula for )% isL
( ) ( )
!
4== ,
!
4== ,
!
,
!
,
4==
4
4
K K
9 $
9 c
R $
R c
9 b R b
N 3 N 3
+
+

1here
$
is the gain factor for /)/&5 and

c
is the gain factor for /)&&5.

Motorola &onfidential )roprietar3 4>+
4+.4.!.4.< Activit3 -actor
The activit3 factor is al1a3s set to 4 b3 the &A& for the ne1 reJuest, this includes
the 4
st
RA' reJuest 1here %R' 1as established on the common channels,
inter"freJuenc3 hard handover,
%R' establishment on the /&5.
.f /&5 has alread3 been assigned 1hen a reJuest is received, the &A& hard codes the activit3 factor to
4 if the /&&& is activated. .f /&&& is not activated, it2ll read it from the configured parameter.
The activit3 factor BUlAct-actor-orAAAA, /lAct-actor-orAAAAC used in the U%R3 is defined as an
application activit3 factor on the /)/&5. .t2s then converted to the activit3 factor for the 1hole /)&5
of a single service using the eJuation belo1. The default value of the activit3 factor for AMR voice is
.$.
4+.4.!.4.<.4 &alculation of Uplin9 Activit3 -actor
-or single RA'
! !
!
,
!
$ c
$ /P/C)i i c
i
v
v

+
+
-or multi RA's

!
,
!
,
!
,
!
,
comb $ comb c
comb $
comb +
+
comb +
+ +
comb c
comb
R
R v
v

+
4+.4.!.4.<.! &alculation of /o1nlin9 Activit3 -actor

-or single RA'
$ata Pilot TPC T7C.
$ata /P/C) i Pilot TPC T7C.
i
N N P5 N P5 N P5
N v N P5 N P5 N P5
v
+ + +
+ + +
[ 3 [ ! [ 4
[ 3 [ ! [ 4
,
-or multi RA's
comb +
+
comb +
+ +
/P/C) comb
R
R v
v
,
1here
v
O
is the activit3 factor of +"th RA', 1hich is the default value set in the database parameter eAcept
1hen the /&&& is s1itched on and the RA' is data. .n this case v
O
is set to 4.
R
+
is the data rate for the +"th RA'.
4+.4.!.4.> &ell *nvironment T3pe
Three t3pes of &ell *nvironment are defined b3 the &A& algorithmL TU BT3pical Urban areaC, RA
BRural AreaC, and 5T B5ill3 Terrain areaC as defined in the !$.+=3. The *nvironment T3pe is
configurable b3 the operator BCe!!En$T-2eC for a cell.
The *nvironment T3pe, in conOunction 1ith coding mode B&onvolution coding e and 4K3 rate, Turbo
coding, no codingC and service t3pe, is used to select the corresponding '0*R vs. *bKNo curve.
4+.4.!.! EOui;aent Number o$ User #a Admission #ontro Agorit"m
-or &% services that are using convolutional coding, the '0*R vs. *bKNo curves for 4!.! 9bitKs AMR
are selected as reference curves. -or )% services that are using convolutional coding, the '0*R vs.
*bKNo curves for 4== 9bitKs data 1ith convolutional coding are selected as reference curves. These
reference curves can be input into the database b3 0MT command SET TRA/E0N:.
The *bKNo of the reference service is read from the '0*R vs. *bKNo to derive the eJuivalent number of
reference service users for a specific service t3pe.
The uplin9 *NU is defined asL
( )
( )
+
+
+
+ c
@(
ref c
@(
N 3
N 3
3N@
K
4
4
K
4
4
.
The do1nlin9 *NU is defined asL
( )
( )
+
/(
ref c
+ c
/(
N 3
N 3
3N@
K
K
.
1here
f represents the interference factor of the neighbouring cells on uplin9, a database parameter,
*cKNo is the *cKNo for +"th user.
Motorola &onfidential )roprietar3 4;4
4+.4.!.3 Setting t"e admission t"res"od based on t"e ENU
4+.4.!.3.4 Uplin9
-or eJuivalent number of users based admission, the pole capacit3 BmaA capacit3 1ith respect of
reference service for the carrierC, PC, is calculated asL
( ) ( )

,
_
+
+
ref c
N 3 f
PC
K
4
4
4
4
.
1here
( ) ( ) 3;= K 4!! K K

ref b ref c
N 3 N 3
f represents the interference factor of the neighboring cells on uplin9 Ban 0MT parameter
'LIntere,act&rC.
Then the load factor at the threshold level can be calculated asL
U0ThresholdGvalue[PC,
U0ThresholdGvalue uses the same po1er measurement based algorithm thresholds for the uplin9, i.e.
'!H&Th%, '!C&n$Th%, '!OtherTh%.
&onsidering a proportion of the po1er and code resource is assigned to 5%/)A, thereb3 it reduced the
capacit3 available for the R++ channels. Thus, the load factor threshold should be decreasing for not
admission too much users. There has t1o 1a3s to adOust this thresholdL
4. %et a higher reference *cKNoGin ,M& via 0MT command according to po1er proportion of
5%/)A.
!. Add a factor to *NU eJuation, 1hich decrease the *NU result according to po1er proportion
of 5%/)A.
4+.4.!.3.! /o1nlin9
.n do1nlin9, there has a complicated relationship bet1een po1er threshold, load factor, and eJuivalent
number of users 1ith the fact that a proportion of the po1er and code resource can be assigned to
5%/)A. Algorithm used one more parameterL do1nlin9 total eJuivalent number of users
B)LTOTALE>'SERN'MC, and the other parameters used b3 do1nlin9.
The *NU of different thresholds is calculated asL
/0ThresholdGvalue[ do1nlin9 total eJuivalent number of users
Motorola &onfidential )roprietar3 4;!
/0ThresholdGvalue uses the same po1er measurement based algorithm thresholds for the do1nlin9, i.e.
)LH&Th%, )LC&n$Th%, )LOtherTh%)
%9)%)3!S1DS#! Admission #ontro
4+.4.3.4 Agorit"m O;er;ie=
,nl3 non"&onversational )% RA's ma3 be mapped onto 5%/)A channels. )% RA's of 'ac9ground
and .nteractive traffic class are considered 'est *ffort B'*C services because the3 do not have a
guaranteed throughput. %treaming RA's, ho1ever, are characterized b3 a Guaranteed 'it Rate BG'RC,
1hich must be met.
Admission control of 5%"/%&5 bearers is concerned 1ith ensuring that the 6o% reJuirements of the
call such as throughput and transfer dela3s are satisfied. The call reJuest Bne1, handover,
reconfiguration, transport channel s1itch, active set update, etc MC is passed on to the appropriate
&A& modules, 5%/)A &A& module andKor /&5 &A& module. The admission control of the do1nlin9
5%"/%&5 is performed in the 5%/)A &A& module and admission of the uplin9 5%"/)&&5 is carried
out b3 the /&5 &A& module. .ncremental 5%"/)&&5 load factor is calculated 1ith 5%"/)&&5 field
po1er and assumed activit3 factor, and the summarised load factor of U0 /&5 is used to ma9e
admission decision. The decisions from both the 5%/)A &A& and /&5 &A& modules are then sent to
the RRM module so that the final admission decision can be ta9en. ,nl3 1hen all the decision modules
sending input to the RRM module allo1 admittance, does the RRM module admit the call.
-or 5%/)A calls 1hen an Active %et update is performed in the ne1 leg, a /0 /&5 chec9 is
performed, but a U0 /&5 chec9 is not performed.
5%/)A &A& algorithm includes t1o 9inds of admission control algorithm. ,ne is general admission
control, 1hich is focus on maAimum number and maAimum bit rate. Another is admission control for
%treaming RA's, 1hich focus on the sum of Guaranteed 'it Rates.
Note that in 5%/)A &A&, because of the difficulties in predicting usage patterns and radio conditions,
it 1ould be useful to consider congestion information in admission control. .t ma3 be preferable to use
direct measurements of congestion to ma9e admission decisions. )otentiall3 useful measurements
include the N'A) ?5%"/%&5 )rovided 'it Rate@ Bnot supported in U%R3C and internal RN&
measurements from the R0& stac9. More 1or9 should be done to investigate such ?closed loop@
admission algorithms in the future.
4+.4.3.! Genera Admission #ontro onto !S1DS#!
The follo1ing three chec9s are performed for an3 RA', regardless of traffic class.
4+.4.3.!.4 .nsure that the total number of users per Node ' 1ill not eAceed a threshold
.f the total number of 5%/)A users at the Node ', after admission, eAceeds the threshold
Motorola &onfidential )roprietar3 4;3
Ma.Hs2%a'sersPerN&%eB Bthis parameter is not in 0MT 4.$...3., and need to be addedC, the
admission reJuest is reOected.
,ne of the reasons for supporting this chec9 is because there are hard limits on the processing
capabilities per Node '. -or eAample in U%R3 a maAimum of < users per Node ' are supported.
4+.4.3.!.! .nsure that the total number of users per cell 1ill not eAceed a threshold
.f the total number of 5%/)A users in the cell, after admission, eAceeds the threshold
Ma.Hs2%a'sersPerCe!! Bsuch parameter is in 0MT 4.$...3. but need to confirm its meaning 1rt
maA number of users per Node 'C, the admission reJuest is reOected.
4+.4.3.!.3 .nsure that the sum of MaAimum 'it Rates 1ill not eAceed a threshold
-or each admission reJuest onto 5%/)A channels, Admission &ontrol predicts the value of this sum
after admission b3 adding the MaAimum 'it Rate of the current admission reJuestL
re0"est )S/PA )S/PA
R N R N R + + C B C 4 B
1here
R
)S/PA
BN4=C is a prediction for the sum of the MaAimum 'it Rate of all RA's that 1ill be mapped
to 5%"/%&5 channels of the cell, including the current reJuest one.
R
)S/PA
BNC is a sum of the MaAimum 'it Rate of all RA's currentl3 mapped to 5%"/%&5 channels
of the cell.
R
re0"est
is MaAimum 'it Rate of current RA' reJuest.
The threshold R
th$
for the sum of the MaAimum 'it Rates isL
totalrate ave th$
Ratio P , R [ [ C 4 [ B
1here
,
ave
is average 5%")/%&5 bit rate per code in 9bitKs BA;eDataRate&er#ode/or!SD&A, this
parameter is not in 0MT 4.$...3., and need to be addedC.
P is the number of 5%")/%&5 codes B!S&DS#!#ODENU'C.
Ratio
totalrate
is 5%"/%&5 service threshold Bthis parameter is not in 0MT 4.$...3., and need to be
addedC.
.f R
)S/PA
BN V 4C is greater than R
th$
, the admission reJuest is reOected.
Motorola &onfidential )roprietar3 4;=
4+.4.3.3 Admission #ontro o$ Streaming RA0s onto !S1DS#!
%treaming RA's are also subOect to the General 5%/)A chec9s in the previous section.
-or each admission reJuest for a %treaming RA' onto 5%/)A channels, Admission &ontrol predicts the
value of this sum after admission b3 adding the Guaranteed 'it Rate of the current reJuestL
re0"est F-R )S/PA F-R )S/PA F-R
R N R N R
, , ,
C B C 4 B + +
.
1here
R
F-R')S/PA
BN4=C is the sum of the Guaranteed 'it Rate of all %treaming RA's currentl3 mapped to
5%"/%&5 channels of the cell, including the current reJuest one.
R
F-R')S/PA
BNC is a sum of the Guaranteed 'it Rate of all %treaming RA's currentl3 mapped to 5%"
/%&5 channels of the cell.
R
F-R're0"est
is Guaranteed 'it Rate of current %treaming RA' reJuest.
The threshold R
F-R'th$
for the sum of the Guaranteed 'it isL
( )
4
[ [ 4 [
,
F-R
ave th$ F-R
Ratio
P , R .
1here
,
ave
is the average 5%")/%&5 bit rate per code in 9bitKs BA;eDataRate&er#ode/or!SD&A, this
parameter is not in 0MT 4.$...3. no1, and need to be addedC.
P is the number of 5%")/%&5 codes. B!S&DS#!#ODENU'C
Ratio
F-R
is the 5%"/%&5 guarantee bit rate service threshold B!SDS#!G0RT!DC.
.f R
F-R')S/PA
BN V 4C is greater than R
F-R'th$
, the admission reJuest is reOected.
%9)%)2Dependencies
.n U%R3 there is a fiAed po1er partition bet1een the 5%/)A channels and the R++ channels, i.e. a
maAimum po1er budget is allocated to 5%/)A channels for the MA&"5% to use and R++ channels are
allocated the remaining po1er Btotal cell po1er minus the 5%/)A po1er budgetC.
4+.4.=.4 RR 'odue
The RR module acts as a central controller 1hich ma9es the final decision on call admission. .f one of
the follo1ing events happens, the RR module reOects the admission reJuest, be it for a ne1 call, a
reconfiguration or a handoverL
there is not enough ,:%- code resource,
Motorola &onfidential )roprietar3 4;$
there is not enough .ub band1idth resource,
there is not enough &)U resource,
the call reJuest is reOected b3 the &A& module for /&5.
the call reJuest is reOected b3 the &A& module for 5%/)A admission
The &all Admission &ontrol B&A&C algorithm for /&5 is responsible for the po1er"based call
admission control of the R++ channels. The 5%/)A &A& module is responsible for the po1er"based
call admission control of the 5%/)&5 channels. Neither module eAplicitl3 chec9s other resources, such
as code, bac9haul .ub, or &)U, etc M The results of the admission chec9s are sent to the RR module
for the final admission decision.
Admission $aiure
7hen a ne1 call is being established, the RA' mapping decides 1hich transport channel should be used
to carr3 that RA'. .f 5%"/%&5 is chosen but admission control fails to admit the corresponding radio
bearer, then the RA' mapping 1ill tr3 to map the RA' reJuest on a /&5 1ith a maAimum bit rate the
closest to the maAimum bit rate reJuested b3 the RA'.
4+.4.=.! OVS/ codes management
,:%- codes management is done b3 a different algorithm, 1hich is independent of the &A&. The
results of code management and &A& chec9ing are gathered at the RR module 1ith other resource
management information to ma9e the final admission decision for the reJuest.
.n U%R3 5%/)A code allocation is performed 1hen configuring the cell and cannot be changed
d3namicall3 later on b3 the RN&.
4+.4.=.3 Directed Retry Decision 7DRD8
7hen admission control refuses admission of R++ reJuest on the current carrier, the /R/ algorithm
ma3 tr3 to admit the call on another carrier Banother 3G cellC.
,nce an alternative"serving cell is selected for the directed retr3, a ne1 call reJuest is sent to the &A&.
The &A& 1ill perform a call admission control for the ne1 target cell, follo1ing the procedure of a ne1
call reJuest, and send the result to the RR module in the RN& for the final admission decision.
7hen admission control refuses admission of 5%/)A reJuest on the current carrier, the 5%/)A /R/
algorithm ma3 tr3 to admit the call on another carrier Banother 3G cellC and the usual &A& procedure
for a ne1 call is performed.
4+.4.=.= A'R Rate #ontro 7A'R#8
AMR& should perform a &A& chec9 1henever it increases the rate.
Motorola &onfidential )roprietar3 4;<
4+.4.=.$ Dynamic #"anne #on$iguration and Transport #"anne S=itc"ing 7D###8
.n the case that the /&&& desires to increase the bearer rate of a particular user on the uplin9 or the
do1nlin9 or both, a reconfiguration reJuests is sent to &A& for admission chec9ing.
.n order for the /&&& algorithm to move a U* from -A&5 to /&5 Bor 5%"/%&5C state, the %RN&
has to be co"located 1ith the &RN& such that an internal message can be sent from /&&& to &A&
algorithms to trigger the radio bearer reconfiguration. ,ther1ise, %RN% relocation has to occur before
/&&& can move the U* to /&5 Bor 5%"/%&5C state.
4+.4.=.< -oad #ongestion #ontro 7-##8
.t is the case that 0&& not chec9 1ith the &A& 1hile ta9ing an3 rate reduction Breduction of number of
MA& )/Us that can be transmittedC or call"drop actions, but chec9 1ith the &A& before an3 rate
increases Bbac9 to regular levelsC. -or MA& T-& recover3 after overload release threshold is triggered,
MA& la3er 1ill recover the T-& bac9 to the normal level step b3 step, there 1ill be no &A& chec9. -or
rate reductions this 1ill serve to reduce the current estimate of the uplin9 and do1nlin9 load factors so
that the &A& module trac9s the load better. The 0&& stops the reduction of data rate according to the
actual measured T&)KRT7) lo1er than 0&& threshold.
There are four level of thresholds defined for the 0oad &ongestion &ontrol algorithm. The first ! lo1er
level thresholds are meant to be set lo1er than the &A& threshold, and the3 activateKdeactivate the first
stage of basic congestion control called 0/R. .n this stage, 0&& uses the .u 6o% re"negotiation, '*
rate reconfiguration, inter"carrier load balancing and inter"RAT load balancing algorithms to conduct
cell 1ide congestion control to a group of users. The other ! higher level thresholds are meant to be set
higher than the &A& thresholds, and the3 activateKdeactivate the !
nd
stage of ,ver 0oad congestion
&ontrol B,0&C. .n this stage, a fast rate reduction and lin9sKusers release are used. /uring the recover3
stage after congestion condition is relieved, 1here '* rates have been decreased the 0&& 1ill increase
the user data rate step b3 step to its normal rate. All actions ta9en during 0/R, ,0&, and recover3
stage are eAecuted 1ithout chec9ing 1ith the &A&.
4+.4.=.> &otentia User #ontro 7&U#8
)U& algorithm does not chec9 &A& eAplicitl3. 5o1ever, )U& algorithm updates the broadcasting
information for U* cell"selection according to measurement report. &A& algorithm trigger 1ill occur
onl3 if call reJuest eAists.
4+.4.=.; R-# con$iguration
There is no specific congestion control algorithm for the 5%/)A partition. 5o1ever, the R0&
mechanism provides one mechanism for dealing 1ith overload to meet 6o% reJuirement. %treaming
users 1hich are in bad conditions, or 1hich are not meeting 6o% targets due to overload can be removed
via R0&, appropriate configuration of R0& is important for 5%/)A. /ifferent R0& settings are better
to be used for best effort B'*C users and for streaming users 1hich have different 6o% reJuirements.
Motorola &onfidential )roprietar3 4;>
4+.4.=.+ Reations"ip bet=een D#! #A# and !SD&A #A# mec"anism
'ecause the 5%/)A Node ' scheduler is used to manage po1er and code 1ithin the constraints defined,
the purpose of 5%/)A &A& is to directl3 ensure that 6o% reJuirements are met, this is different to the
case of /&5 &A& 1here the algorithm ensured that 6o% is met indirectl3 b3 ensuring that po1er levels
are not eAceeded.
-or an 5%/)A call, t1o sets of chec9s are performedL one 1ith the 5%/)A &A& mechanism to
determine 1hether the 6o% of the /0 bearer can be met, and another 1ith the /&5 &A& mechanism to
chec9 1hether the U0 /&5 as 1ell as 5%/)A specific channels B/0 /)&&5 and 5%"/)&&5C can be
admitted or not.
The commands that have parameters that influence admission control are as follo1sL
%*T A/M&TR0
A// &*00&A& BMa.HS)SCH'serNum2erN&%eB and
A$#)ataRatePerC&%e,&rHS)A are still not accomplished in 0MT 4.$...3., and
Ma.B"tNumA%mTh%,&rHs%2a parameter is 1ith different name and meaning at 0MT
4.$...3. no1 and need to be implemented in 0MTC
M,/ &*00&A& Bsame comments as above about missing parametersC
%*T 0/M
%*T &*00%*TU)
M,/ &*00%*TU)
%*T &*00R0)7R
%*T 5%/)&&5
A// &*005%/)&&5
M,/ &*005%/)&&5
RM: &*005%/)&&5
A// &*005%/)A
M,/ &*005%/)A
RM: &*005%/)A
A&T &*005%/)A
/*A &*005%/)A
There are no special restrictions in using these commands other than the natural one of using the M,/
commands after the A// or %*T command.
Motorola &onfidential )roprietar3 4;;
%9)3 Jey &er$ormance Indicators
J&I Description
#a0oc<Rate#on;
&all bloc9ing rate for &onversational service
#a0oc<RateStreaming
&all bloc9ing rate for R++ %treaming service
#a0oc<RateInteracti;e
&all bloc9ing rate for R++ .nteractive service
#a0oc<RateStreaming!sdpa
&all bloc9ing rate for 5%/)A %treaming service
#a0oc<RateInteracti;e!spda
&all bloc9ing rate for 5%/)A .nteractive service
-oad/actor#e
Total traffic load factor on a cell. This is the percentage of
total non"5%/)A maAimum po1er.
A;gT"roug"putStreaming
Average Throughput for 5%/)A %treaming users
!sdpa&o=Uti
The utilisation of allocated 5%/)A po1er
!sdpa#odeUti
The utilisation of allocated 5%/)A code resource
%9)2 Optimization Guideines
%9)2)%&arameters and recommendations
%9)2)+E>pected J&I ;aues
0isted belo1 is the simulation result.
J&I Name E>pected J&I Vaues
Motorola &onfidential )roprietar3 4;+
#a0oc<Rate#on;
&A& algorithm performance per &onversational serviceL
Actual %imulated Average *rlangK&ellL $3.>+===4$ $;.< <4.4!=>!3$
Arrival Rate B&allsKsecKcellC $3.3 < <<.>
/0 )o1er .;_ 4.44_ !.<<_
Number of ne1 call bloc9ed .$4!_ 4.!>=_ 43.+!;_
Number of handover reJuest
bloc9ed ._ 4.;3_ .!$;_
U0 )o1er
Number of ne1 call bloc9ed ._ ._ .+4_
bloc9ed ._ ._ ._
,:%- &ode
Number of ne1 call bloc9ed ._ .4!_ ._
bloc9ed ._ .4=_ ._
#a0oc<RateStreaming
&A& algorithm performance per %treaming serviceL
Actual %imulated Average
%essionsK&ellL 4!.+! 4=.<> 4>.! 4;.$
Arrival Rate
B%essionsKsecK&ellC .33 .= .=> .$3
/0 )o1er .!<_ .!4$_ 4.=$=_ !.;43_
Number of ne1
call bloc9ed ._ .=!_ 3.3+_ <.4<_
Number of
handover reJuest
bloc9ed .=!_ .;_ .!4_ .4;_
U0 )o1er
Number of ne1
call bloc9ed ._ ._ ._ .;_
Number of
handover reJuest
bloc9ed ._ ._ ._ .!_
,:%-&ode
Number of ne1
call bloc9ed 4.!!_ 3.$<_ >.4=_ +.3!_
Number of
handover reJuest
bloc9ed 4.<>_ $.+!_ 44.4>_ 4<.44_
#a0oc<RateInteracti;
e
4_
#a0oc<RateStreaming
!sdpa
4_
#a0oc<RateInteracti;
e!spda
4_
-oad/actor#e T'/
A;gT"roug"putStreamin
g
T'/
!sdpa&o=Uti T'/
!sdpa#odeUti T'/
E). validation conditionsL
%ingle cell condition 1ith no neighbour cell configured.
Test focus on Ne1 &all Radio Admission &ontrol.
No traffic miAing.
,verload or &ongestion control is off.
&all Admission threshold set to 4_ BAdmitting maAimum callsC
Traffic activities for all calls are assumed to be 4_.
! test scenariosL 4!.!E AMR calls and <=EK<=E interactive call.
-irst scenario is 34 <=EK<=E interactive )% calls. ,ne call at a time until all calls are
brought up and sta3 for 3 minutes. The 3!nd call 1ill be reOected. Measure &all 'loc9ing
rate, &all /rop Rate and &ell 0oad -actor.
%econd scenario is $; 4!.!E AMR &% calls. ,ne call at a time until all calls are brought up
and sta3 for 3 minutes. The $+th call 1ill be reOected. Measure &all 'loc9ing rate, &all
/rop Rate and &ell 0oad -actor.
-urther, the proportion of :oice calls, %treaming sessions and .nteractive sessions is better to be
assigned according to reJuirement model or test individuall3.
0oad-actor&ell is measured to chec9 the utilisation of capacit3 on R++ services.
Average throughputs for streaming U* are used to measure 1hether algorithm admits too man3 users
that 6o% becomes unacceptable or not. Utilisation of 5%/)A po1er and code resources indicate
1hether the available resources are 1ell utilised or not.
%9)2)3Sensiti;ity anaysis
5%/%&5 Total Rate threshold parameter is used to set 5%"/%&5 service over"allocated threshold. .f
this parameter set too high, too man3 users 1ill be admitted and streaming users2 6o% 1ill be reduced,
though the scheduler 1ould bac9 off the rate of '* users in an attempt to deliver the 6o% for the
streaming users firstl3. .f this parameter set too lo1, the utilization and throughput 1ill be reduced. And
this parameter is highl3 related to traffic model and 6o% reJuirements.
Motorola &onfidential )roprietar3 4+4
+:&o=er #ontro
+:)% O;er;ie=
This section covers the implementation of the po1er control feature in our UTRAN. .t includes a
presentation of the different po1er control mechanisms and of the ,M& commands and parameters
used to configure and optimize the operation of the feature. 7henever appropriate, some aspects of the
feature optimization are discussed.
)o1er &ontrol in UMT% is one of the most important features that directl3 impact the s3stem coverage
and capacit3. The main function of the po1er control feature is to ensure that the po1er used b3 each
channel is a small as possible Bto minimize the total interference in the net1or9 hence to maAimize the
capacit3C 1hile providing the 6ualit3 of %ervice B6o%C reJuired b3 the different services admitted in the
s3stem. This is a challenging tas9 as the po1er levels var3 all the time due to users2 mobilit3, traffic
variation and changes in the propagation environment. The support of services Be.g. voice, video, high"
rate data transferC 1ith ver3 different 6o% characteristics, hence ver3 different po1er reJuirements, also
contributes to that challenge.
There are a number of po1er control mechanisms in UMT%, either proprietar3 or defined in the 3G))
specifications. 7hen a particular solution is proprietar3, it has to rel3 on the signalling protocols BRR&,
N'A)C defined in the 3G)) specifications to operate properl3 in a multi"vendor environment BRN&,
Node ' and U*C. Motorola UTRAN is compliant 1ith this reJuirement.
The po1er control feature includes open loop po1er control and closed loop po1er control. -or each of
these, the uplin9 and do1nlin9 po1er control mechanisms are presented separatel3, including the
do1nlin9 po1er balancing algorithm.
+:)+ Open -oop &o=er #ontro
+:)+)%Introduction
.n an open loop po1er control mechanism, the transmitter has to determine the transmit po1er 1ithout
an3 eAplicit feedbac9 from the receiver as to 1hether that po1er level is satisfactor3. An eAample of
such a mechanism occurs 1hen the U* starts an access c3cle transmitting on the )RA&5. Note
ho1ever that it does not mean that the transmitter has no information at all about the conditions of the
receiver. -or eAample, the U* reports the &).&5 measurements to the RN& and the RN& can use such
measurements to decide on the initial do1nlin9 transmit po1er that should be used b3 the Node '. .n
the opposite direction, the U* ma3 9no1 the uplin9 noise rise in a particular cell to compute the initial
transmit po1er to use on the )RA&5.
This is a fairl3 crude mechanism. -or eAample, it assumes that the pathloss of the radio channel is
Motorola &onfidential )roprietar3 4+!
identical on the uplin9 and on the do1nlin9, 1hich can be a fair assumption over a long period of time
but is certainl3 not the case over short periods. To compensate for such inaccuracies, either the
transmitter tends to include some margin in its transmit po1er estimation or further mechanisms are
reJuired to ensure a suitable communication Bfor eAample, the po1er ramp used on the )RA&5C.
+:)+)+Do=nin<
/iscussion of the do1nlin9 common channel po1er settings is outside the scope of this document. .t is
rather an essential part of the net1or9 planning phase. The main reference po1er is that of the common
pilot channel from 1hich all the other channels are referred to.
The difference bet1een the maAimum cell po1er Ma.T.P&/er and the &).&5 po1er PCPICHP&/er
should be greater than or eJual to 43 d', subOect to the additional constraint that Ma.T.P&/er does not
eAceed the Node ' capabilit3 of =< d'm.
+:)+)3Upin<
.n this case the U* adOusts its transmit po1er based on the assumption that the radio channel
characteristics are s3mmetrical on the uplin9 and on the do1nlin9. This process reJuires initiall3 an
estimate of the do1nlin9 pathloss. This is done b3 the U* using the measured &).&5 received signal
code po1er BR%&)C and the &).&5 transmit po1er level broadcast b3 the cell.
,pen loop po1er control is used for uplin9 transmission of the )h3sical Random Access &hannel
B)RA&5C to adOust its initial signal po1er during access of U* to UMT% services.
To assist the U*, UTRAN broadcasts the follo1ing information in the %3stem .nformation 'loc9
number $ B%.'$C in each cell using the &ommon 'roadcast &hannel B'&5CL
The cell transmitted po1er level of the )rimar3 &ommon )ilot &hannel B)"&).&5C signal
defined b3 the parameter Pc2"chP&/er. Note that the Pc2"chP&/er value must be set in the
range defined b3 parameter values M"nPCPICHP&/er and Ma.PCPICHP&/er. The
range of &).&5 po1er levels gives fleAibilit3 in limiting or eAtending the area of soft
handover. Moreover the &ell 'reathing algorithm adOusts the &).&5 po1er level in the
range defined b3 these t1o parameters.
Measurement of the cell interference po1er level in the uplin9.
The constant U* preamble transmission po1er offset that compensates ineJualit3 bet1een
U0 and /0 transmission channels. The selection of the offset value should ensure that the
preamble signal received at the Node ' has sufficient po1er to be detected. The offset is
called constant value and is defined b3 the parameter C&nstant$a!ue, 1hich also specifies
the reJuired level of &K. in the uplin9.
U* measures received pilot signal code po1er B&).&5GR%&)C to estimate do1nlin9 path loss and then
calculates the initial preamble transmission po1er level using the follo1ing formulaL
Motorola &onfidential )roprietar3 4+3
)
)RA&5
T Pc2"chP&/er " &).&5GR%&) V U0 interference V C&nstant$a!ue
1here all Juantities are either in d' or in d'm, as appropriate.
.t is 1orth noting that the @( interference is the aggregate uplin9 noise and interference po1er level
measured b3 the Node ' in each cell 1ithin 7&/MA channel band1idth. The value of the U0
interference level is broadcast in the cell using %.' >.
The Node ' detection threshold for preamble detection depends on the Node ' receiver sensitivit3.
7hen the Node ' detects that a preamble is being transmitted, it measures the signal"to"interference
ratio during that preamble transmission. .f that measurement is greater than a given threshold specified
b3 the parameter Pream!eTh%, a positive ac9no1ledgement BAcJuisition .ndicatorC is sent on the
AcJuisition .ndicator &hannel BA.&5C. A negative ac9no1ledgement is transmitted if the preamble is
detected but there is no )RA&5 code resource available for the U*. .f the Node ' cannot even detect
that a preamble is being transmitted, no ac9no1ledgement is sent on the A.&5, i.e. a ?No Ac9@. The
po1er used on the A.&5 is determined b3 the parameter AICHP&/erO((set 1hich specifies the po1er
offset bet1een the A.&5 and the &).&5.
.f the U* does not receive a positive or negative AcJuisition .ndicator BA.C in the A.&5 follo1ing the
preamble transmission, it repeats the preamble transmission up to a maAimum number of times defined
b3 the parameter Pream!eRetransMa.. /uring a preamble access c3cle, the preamble transmission
po1er level is incremented after ever3 preamble transmission b3 a given amount specified b3 the
parameter P&/erRam2Ste2. The U* transmission po1er on )RA&5 must not eAceed a maAimum limit
specified b3 the parameter Ma.A!!&/e%'!T.P&/er 1hich can be set on a per cell basis. -urthermore,
in case the preamble transmission po1er computed b3 the U* eAceeds the maAimum allo1ed po1er b3
< d', the U* 1ould abort the ph3sical random access procedure `T% !$.!4=a.
.f no positive A. is received b3 the U* after the maAimum number of preamble transmissions, the U*
repeats the entire access procedure. 5o1ever there is a maAimum number of times such access
procedures can be repeated, 1hich is specified b3 the parameter Mma..
.f during the access procedure, a negative A. is received then the U* eAits the access procedure.
7hen the U* decodes a positive A., it initiates the transmission of the message part of the random
access procedure. This transmission starts after the last transmitted preamble follo1ed b3 the defined
number of uplin9 access slots. The transmission dela3 time is given b3 the number of access slots
specified b3 the parameter AICHT.T"m"n# according to the follo1ing ruleL
if AICHT.T"m"n# T then the transmission occurs after 3 access timeslots dela3 bet1een
the )RA&5 access preamble part and the A.&5 ac9no1ledgement,
if AICHT.T"m"n# T 4 then the transmission occurs after = access timeslots dela3 bet1een
the )RA&5 access preamble part and the A.&5 ac9no1ledgement.
The transmission of the message part of the access procedure uses a ph3sical channel 1hose structure is
similar to that of a /)&5, i.e. it is made of a /)&&5 and of a /)/&5. The po1er of these t1o
channels is controlled b3 the t1o parameters Ga"n,act&rBetaC and Ga"n,act&rBeta) `T% !$.!4=
section $.4.!.$.4a.
Motorola &onfidential )roprietar3 4+=
Moreover, the po1er level of the transmission of the message part is controlled b3 the parameter
P&/erO((setP2m. To be precise, this parameter is the po1er offset bet1een the /)&&5 of the message
and the last transmitted preamble, i.e. the /)&&5 po1er level is determined b3 the follo1ing
relationshipL
P
message2$<cch
T P
P
V P&/erO((setP2m Bin d' or d'm, as appropriateC
1hereL
P
message2$<cch
is the po1er on the /)&&5 part of the message transmission,
P
P
is the po1er of the last transmitted preamble.
A simplified po1er level dependenc3 bet1een preamble and message transmission of the random"access
procedure is sho1n in the figure belo1.

Pp-m
Po
Po

Message
409 !"ips 409 !"ips 409 !"ips 10 ms
Pream#$e
time
+:)+)2Database parameters
The table belo1 gives the main commands and parameters to configure the open loop po1er control
operation.
&arameter Descriptions #ommand
C&nstant$a!ue )reamble signal reception threshold used to
calculate the transmit po1er of the first preamble
in the random access process
3G))
A//
)RA&5'A%.&
Pream!eTh% This parameter defines the preamble threshold of
the )RA&5. The preamble 1ill be confirmed
onl3 1hen the ratio bet1een the preamble po1er
received in the preamble period and the
interference is larger than this threshold.
3G))
A//
)RA&5'A%.&
AICHP&/erO((set /ifference bet1een the transmit po1er )&).&5
and each of A.&5.
3G))
A//
&5)7R,--%*T
Motorola &onfidential )roprietar3 4+$
Pream!eRetransMa. MaAimum number of preambles transmitted in a
preamble ramping c3cle.
3G))
A//
)RA&5'A%.&
P&/erRam2Ste2 )o1er step up to be applied b3 the U* 1hen a
Non AcJuisition .ndicator is received or 1hen no
acJuisition indicator at all is received.
3G))
A//
)RA&5'A%.&
Mma. MaAimum number of random access preamble
ramping c3cles
3G))
A// RA&5
AICHT.T"m"n# The timeslot offset bet1een the access preamble
of the )RA&5 and A.&5 ac9no1ledgement
3G))
A//
&5)7R,--%*T
P&/erO((setP2m )o1er offset bet1een the preamble and the
message part of the )RA&5
3G))
A//
)RA&5T-&
Ma.A!!&/e%'!T.P&/er MaAimum allo1ed po1er U* transmitted on
RA&5.
3G))
A//
&*00%*0R*%*0
Ga"n,act&rBetaC U0 /)&&5 gain set up
3G))
A//
)RA&5T-&
Ga"n,act&rBeta) U0 /)/&5 gain set up
3G))
A//
)RA&5T-&
+:)+)4Jey &er$ormance Indicators
J&I Descriptions
&RA#! 'essage
Detection Success Ratio
)ercentage of successfull3 detected )RA&5 messages to the total number of
transmitted )RA&5 messages b3 the U*.
&RA#! 'essage
Transmission Deay
Average and +$_ percentile of time dela3 samples measured from the time the
first )RA&5 preamble is sent until the RA&5 message part is successfull3
transmitted b3 the U* B.ndicator of dela3 introduced b3 the 04 )RA&5 po1er
ramping procedureC.
&reambe Detection
Success Ratio
)ercentage of the successfull3 detected )RA&5 preambles and the total number of
transmitted )RA&5 preambles.
+:)+)6Optimization guideines
7hen setting the )RA&5 parameters, it is desirable to obtain minimum latenc3 and minimum
interference Bnoise riseC on the uplin9.
The minimum latenc3 is desirable because mostl3 the RA&5 is used b3 the U* to access the s3stem and
Motorola &onfidential )roprietar3 4+<
the time to do so should be as small as possible for the user eAperience. .t is also desirable because there
is no closed loop po1er control on the RA&5, so the UTRAN does not have fast or direct control of the
interference created b3 the U*s on the RA&5.
The minimum interference is desirable obviousl3 to minimize the impact of RA&5 users on the Jualit3
of the calls alread3 established and on the s3stem capacit3.
These t1o reJuirements are contradictor3 but it seems more important Bin a first phase at leastC to
achieve the minimum latenc3 provided the interference is not too high Brather than the other 1a3 roundC.
.n that case, the C&nstant$a!ue can be set fairl3 high and the P&/erRam2Ste2 can be fairl3 lo1 Be.g. 4
d'C. This 1a3 1e aim to achieve ver3 high probabilit3 of detection of the first preamble in the access
c3cle. .n the fe1 cases 1here the first preamble is not detected, a reasonabl3 small po1er step is used so
that the interference created b3 the U* increases onl3 slightl3.
A viable alternative is to use a much smaller C&nstant$a!ue and a much higher P&/erRam2Ste2 Be.g. 3
d'C. .n that case, the obOective is to give a chance to the Node ' to detect a lo1 signal level and 1hen
that does not happen first time, ramp up Juic9l3 the preamble transmission po1er.
.t is eApected that both approaches above should lead to a similar interference level at the time the
preamble is successfull3 detected b3 the Node ', the main difference being the number of preambles it
too9 to succeed, i.e. most of the time bet1een one to three preambles.
,nce the preamble has been detected, the probabilit3 of error on the message part of the RA&5
transmission depends on the po1er ratio parameter P&/erO((setP2m.
!.!.<.4 &arameters and recommendation
!.!.<.! E>pected J&I ;aues
T'/.
+:)3 #osed -oop &o=er #ontro
+:)3)%Introduction
&losed loop po1er control means that the receiver gives some feedbac9 to the transmitter so that the
transmitter can adOust its po1er accordingl3. .n 7&/MA closed loop po1er control is implemented on
both the uplin9 and the do1nlin9, i.e. both the Node ' and the U* provide feedbac9 to each other and
both use that feedbac9 to adOust their o1n transmit po1er. &losed loop po1er control comprises t1o
different mechanismsL
inner loop po1er control,
outer loop po1er control.
Motorola &onfidential )roprietar3 4+>
The outer loop is responsible for setting an %.R target for a ph3sical channel, or to be more precise, on
the /)&&5. %uch a target should be computed so that the 6o% reJuirements of the services carried
over that ph3sical channel are met. T3picall3 Bbut not eAclusivel3C the outer loop ensures that a given
'0*R target is met on average. Note that multiple transport channels, each carr3ing a service 1ith its
o1n 6o% reJuirement, can be multipleAed on the same ph3sical channel. The outer loop po1er control
algorithm is not specified in the 3G)) specifications and is a proprietar3 algorithm. 'ut it is important
to note that the 3G)) specifications state that the UTRAN is responsible for the uplin9 outer loop
po1er control and that the U* is responsible for the do1nlin9 outer loop po1er control. Therefore the
UTRAN has no control over the do1nlin9 po1er control and this 1ill var3 1ith each U* vendor.
,n the other hand, the inner loop po1er control is specified in the 3G)) specifications and mandator3
for the Node ' and the U*. The principle is ver3 simpleL the receiver measures the %.R on the /)&&5
Bt3picall3, but not eAclusivel3, on the dedicated pilot bitsC and compares that measured %.R 1ith the %.R
target determined b3 the outer loop po1er control. .f the measured %.R is less than the target %.R, the
receiver sends a ?po1er up@ command to the transmitter, other1ise it sends a ?po1er do1n@ command.
%uch commands are represented b3 the T)& bits in the /)&&5 1hich are sent in ever3 time slot.
+:)3)+Do=nin<
!.3.!.4 Initiaization
,n the do1nlin9, the /)&&5 and the /)/&5 are time"multipleAed. The /)&&5 comprises three
different fields, the dedicated pilot bits, the transmit po1er control bits BT)&C and the transport format
combination identifier bits BT-&.C. *ach control field has its o1n po1er offset 1ith respect to the
/)/&5. All these po1er offsets can be set from the ,M&.
There are defined the follo1ing po1er offsetsL
T2cP& is the po1er offset bet1een the T)& bits and the /)/&5,
Motorola &onfidential )roprietar3 4+;
T(c"P& is the po1er offset bet1een the T-&. bits and the /)/&5,
P"!&tP& is the po1er offset bet1een the dedicated pilot bits and the /)/&5.
7hen a ne1 Radio 0in9 is set up, the RN& determines the initial do1nlin9 transmit po1er using the
&).&5 *c.o measurements reported b3 the U*, the maAimum data rate of the bearer and the *bNo
target corresponding to the '0*R target to be met for that bearer, 1hich means that the RN& uses
initiall3 an open loop calculation. 7hen the U* acJuires s3nchronization on the do1nlin9, then the inner
loop po1er control can start.
The do1nlin9 transmit po1er on a radio lin9 is bounded b3 t1o parameters RLM"n)!P/r and
RLMa.)!P/r that can be defined at the ,M& on a per service basis. These parameters are relative to
the &).&5 po1er.
Note. The selection of the maAimum /0 radio lin9 po1er should be done considering the coverage and
capacit3 issues. 'ecause it is a 7&/MA s3stem, both coverage and capacit3 have to be considered at
the same time, i.e. it is reall3 part of the net1or9 planning phase.
Also note that these maAimum /0 code po1er values are important for the operation of the d3namic
channel configuration control algorithm B/&&&C 1hich can be triggered 1hen a radio lin9 is li9el3 to
run out of po1er Bfor 'est *ffort trafficC.
The Node ' starts transmission using the initial /0 transmitted po1er on each /0 /)&&5 until
s3nchronization is achieved and then inner"loop po1er control starts operating.
The Node ' starts to tr3 and acJuire uplin9 s3nchronization on the Uu interface upon reception of the
Radio 0in9 %etup ReJuest message from the RN&. The successful acJuisition of uplin9 s3nchronization
on the Uu interface is ac9no1ledged b3 sending to the RN& a Radio Restore .ndication message. .f the
uplin9 s3nchronization process fails, the Node ' initiates the Radio 0in9 -ailure procedure.
!.3.!.! Inner -oop &o=er #ontro
At ph3sical channel establishment, the U* sets an initial do1nlin9 target %.R value based on the
received .*s U/&5 Jualit3 targetU " '0*R. The .* U/&5 Jualit3 targetU for a given /&5 is used b3
the U* to set the target %.R for the do1nlin9 po1er control.
The U* measures the %.R on a slot"b3"slot basis and compares that measured %.R 1ith the target %.R.
.f the measured %.R is greater than the target %.R, the U* transmits a po1er up command other1ise the
U* sends a po1er do1n command. %uch commands are transmitted to the Node ' using the T)& bits in
the uplin9 /)&&5.
The Node ' decodes the T)& bits and increases or decreases its do1nlin9 transmit po1er accordingl3
b3 a given step size in the neAt time slot. The po1er step size is defined b3 the ,M& parameter
,%%T2c)!Ste2S"8e. Note that since the T)& bits are not coded Bagainst errors over the radio channelC,
the3 are subOect to errors hence it is possible for the Node ' to change its transmit po1er in the 1rong
direction. 5o1ever the error rate on the T)& bits should be 9ept reasonabl3 small for the s3stem to
operate efficientl3, sa3 around =_. This is achieved b3 setting correctl3 the po1er ratio bet1een the
/)&&5 and the /)/&5 BbetaGc and betaGd gains, respectivel3C.
Motorola &onfidential )roprietar3 4++
The freJuenc3 of po1er adOustments depends on the /)& mode selection, 1hich is defined b3 the value
of ,M& configurable parameter value )2cM&%e. The /0 po1er control mode operates according to
the follo1ing schemeL
.f the /)& mode flag is set to ?%.NG0*GT)&@ then the transmitted po1er change occurs
at the beginning of ever3 neAt time slot after reception of a ne1 T)& command, hence the
maAimum po1er control rate is 4$ 5z.
.f the /)& mode flag is set to ?T)&GTR.)0*TG.NG%,-T@ then the transmitted po1er
change occurs at the beginning of neAt time slot after the reception of 3 consecutive T)&
commands, hence the maAimum po1er control rate is $5z.
7hen the U* is in soft handover B1ith different Node 'sC, each Node ' in the active set adOusts its
transmit po1er according to the procedure described in T% !$.!4= section $.!.4.!.! and do1nlin9
po1er balancing. %ince each Node ' might decode the T)& command sent b3 the U* either correctl3 or
incorrectl3, the radio lin9 transmit po1er of the different Node 's in the active set can drift apart. This
issue is addressed b3 the do1nlin9 po1er balancing algorithm.
.n the case of softer handover, i.e. 1hen the U* is connected to more than one cell in the same Node ',
the radio lin9s associated 1ith the same connection are managed b3 the same Node ' 1hich combines
the T)& commands received from each lin9 and formulates a unified decision.
!.3.!.!.4 /atabase parameters
The table belo1 gives the main commands and parameters to configure the inner loop po1er control
operation.
&arameter Description #ommand
T2cP& )o1er offset bet1een T)& bits and /)/&5
3G))
%*T -R&
T(c"P& )o1er offset bet1een T-&. bits and /)/&5
3G))
%*T -R&
P"!&tP& )o1er offset bet1een pilot bits and /)/&5
3G))
%*T -R&
RLM"n)!P/r Minimum do1nlin9 radio lin9 po1er
Brelative to &).&5 po1erC N depends on &%
vs )% and maA bit rate
3G))
A//
&*00R0)7R
RLMa.)!P/r MaAimum do1nlin9 radio lin9 po1er
Brelative to &).&5 po1erC N depends on &%
vs )% and maA bit rate
3G))
A//
&*00R0)7R
,%%T2c)!Ste2S"8e The step size /0, T)& used in do1nlin9
inner loop po1er control.
3G))
A//
)RA&5'A%.&
)2cM&%e The rate of /0 po1er adOustments 4$5z
or $5z
3G))
A// RA&5
!.3.!.!.! Ee3 )erformance .ndicators
J&I Descriptions
Std 7SIRtarget 1 SIR
estimate8
%tandard deviation of difference bet1een target and measured %.RL
!
C B
4
4
N
i
te i te
$
N
,
1hereL
C B C B i S.R i S.R $
3 T i
,
4
N
i
i te
$
N
C Bi S.R
T
"is target %.R of the &&Tr&5 obtained from outer po1er control loop
for i"th timeslot in d' scale Bsee ,0)& sectionC
C Bi S.R
3
"is %.R estimate of the &&Tr&5 measured in inner po1er control loop
for i"th timeslot in d' scale Bsee ,0)& sectionC
N " is number of observed timeslots should not be less thenL
&onfidence
0evel
ReJuired %td. *rror
of
*stimator BVK"C
%ample %ize N
BTimeslot numberC
+$_ 4_ 3;,=4=
+_ 4_ !>,$$
;_ 4_ 4<,=!=
!.3.!.!.3 )arameters and recommendation
!.3.!.!.= *Apected E). values
T'/.
!.3.!.3 Outer -oop &o=er #ontro
According to the 3G)) specifications, the do1nlin9 outer loop po1er control is not the responsibilit3 of
the UTRAN and is proprietar3 to each U* vendor. 5o1ever the UTRAN provides the U* 1ith a '0*R
target for each transport channel and the U* uses that Jualit3 target to control the po1er reJuirements
in order to meet that target.
!.3.!.= &o=er 0aancing
The po1er balancing procedures aims at correcting the drift of transmit po1er bet1een the different
Node 's of a U*2s active set, these drifts being due to different errors on T)& commands on each radio
lin9. 7ith the /0 po1er control messages, the RN& ma3 provide the same reference po1er to each
Node ', or a different one if a permanent shift in transmit po1er is desired.
This drift ma3 cause either increase level of /0 interference or drops of radio lin9s. .n order to reduce
unfavourable drift of /0 transmitted po1er of different radio lin9s the po1er balancing adOustment
procedure is applied. This procedure is mostl3 defined in the 3G)) specifications !$.!4= and !$.=33. .t
is used in addition to the inner loop po1er control. .t estimates and provides to the Node 's do1nlin9
po1er correction P
bal
B9C according to 1hich radio lin9s transmission po1ers of the active set are
adOusted to1ards a common reference po1er level.
The Node ' adOusts the current do1nlin9 po1er PB9"4C to a ne1 po1er PB9C according to the follo1ing
formulaL
PB9C T PB9 " 4C V P
TPC
B9C V P
bal
B9C,
1hereL
P
TPC
B9C is the 9"th po1er adOustment due to the inner loop po1er control `T% !$.=33 section ;.3.>P
T%!$.!4= section $.!.4.!.!a
P
bal
B9C is the 9"th po1er correction result from the po1er balancing algorithm.
9 is the timeslot number.
The P
TPC
B9C is calculated according to the formula belo1 if the value of (imite$ Po#er .ncrease @se$
parameter is cNot usedcL
'
C B T)& if f
4 C B T)& if f
C B )
est T)&
est T)&
T)&
9
9
9 `d'a,
1here
T)&
f
is a po1er adOustments step size.
The Node ' activates the /0 po1er balancing upon reception from the RN& of the /0 )o1er &ontrol
ReJuest N'A) message. The )o1er AdOustment T3pe .* can be set to ?&ommon@ or ?.ndividual@,
1hich means that po1er adOustments are conducted for individual radio lin9 or commonl3 for all radio
lin9s in the active set. ,nl3 the ?&ommon@ mode is supported.
The po1er balancing adOustment ma3 be suspended if in the Node ' &ommunication &onteAt the )o1er
AdOustment T3pe .* is set to flag ?None@.
%uppose )maA is the maAimal do1nlin9 transmitted code po1er of a R0 in the active set and )min the
minimal do1nlin9 transmitted code po1er of another R0 in the active set. The do1nlin9 po1er
balancing procedure is activated 1hen the follo1ing condition is satisfiedL
Start/P-Th P P
min maA
1here
Start/P-Th
is a threshold 1hich activates the do1nlin9 po1er balancing procedure.
The do1nlin9 po1er balancing procedure is deactivated 1hen the follo1ing condition is satisfiedL
Sto</P-Th P P
min maA
1here
Sto</P-Th
is a threshold 1hich deactivates the do1nlin9 po1er balancing procedure.
Upon activating the do1nlin9 po1er balancing procedure, the /( Reference Po#er )ref is obtained b3
the eJuationL
C B C 4 B C B
CP.C)'min min CP.C)'max max ref
P P a P P a P +
1here
CP.C)'max
P
is the po1er of the &).&5 1hich corresponds to
max
P
,
CP.C)'min
P
is the po1er of the &).&5 1hich corresponds to
min
P
the coefficient a is an ,M&"configurable parameter that is eJual to the 0MT parameter
Rat"&,&rMa.P&/er divided b3 4.
The parameter a controls the setting of the reference ref
P
1ith respect to a &).&5 po1er, bet1een the
minimum and the maAimum transmitted code po1er of the cells in the active set.
Note that in all the eJuations above the po1ers are eApressed in d'm.
The po1er adOustment is a periodic process repeated 1ith the period given b3 parameter A%0ustPer"&%
corresponding to the number of N radio frames of length 4 ms. *ntire c3cle is restarted 1hen &-NT
and it stops 1hen either ne1 /0 )o1er &ontrol ReJuest message is received or the Node '
&ommunication &onteAt ends.
!.3.!.=.4 /atabase parameters
The database parameters are set b3 the command %*T /)'.
The shorter /)' periods, smaller maA adOustment step values and shorter adOustment periods results in
lo1ering the average imbalances among radio lin9s in active set. As a result parameter selection of
measurement report periods less than ! s, maAimal adOust step values less than 4 slots or adOustment
periods less than ; frames 1ill all result in improving /)' algorithm performance. 5o1ever this
impacts negativel3 Node ' processing capabilities and increase signalling load. .t is important to 9eep
in mind that the common measurement periodicit3 should not be less than 4 ms.
+:)3)3Upin<
The uplin9 po1er control procedure resides in the UTRAN.
!.3.3.4 Initiaization
The regulation process starts from calibration and adOusting of inner loop po1er control. 'efore
transmitting data on the /)/&5, the U* transmits on the /)&&5 for a given number of radio frames
specified b3 the parameter 2cPream!e. Moreover the data transmission on %R' to %R'= is further
dela3ed b3 a number of frames given b3 the Sr)e!a- parameter.
/uring this time period, the po1er control loop stabilizes the Node ' transmit po1er b3 reconciliation
of the measured %.R 1ith the initial %.R target.
The initial U* /)&&5 po1er level is calculated according to the follo1ing formula Bsee !$.334 section
;.$.3CL
/PCC)
.nitial&<o#er
K$-mL 1 /PCC)<o#er&offset K$-mL ? CP.C)&RSCPK$-mL
1hereL
/)&&5
po1erGoffset
`d'ma
T
&cpic"&o=er `d'ma

V U0 interference V De$aut#onstantVaue`d'a,
and
)e(au!tC&nstant3a!ue is the configuration parameter provided on a per cell basis,
CP.C)&RSCP is the &).&5 received signal code po1er measured b3 the U*.
7hen U0 inner loop po1er control is stabilized, the relative transmit po1er offset bet1een /)&&5 and
/)/&5 is determined b3 the parameters BetaC and Beta).
The processing at the U* of the T)& commands received from the UTRAN depends on the selection
from t1o standardized po1er control algorithms as specified b3 the parameter P/rCtr!A!# Bpo1er
control algorithm number 4 or number !, see T% !$.!4=C. This choice of po1er control algorithm affects
for eAample the 1a3 the T)& commands received from different cells should be combined 1hen the U*
is in soft handover.
The uplin9 po1er adOustment step size is defined b3 the parameter '!T2cSte2S"8e. .f the po1er control
algorithm s1itch is set to ?A0G,R.T5M4@ then the uplin9 po1er adOustment step size is either 4 d' or
! d'. .f the s1itch is set to ?A0G,R.T5M!@ then the uplin9 po1er adOustment step size is al1a3s 4
d'.
The RN& provides all Node 's in a U*2s active set 1ith an initial %.R target.
The RN& can also specif3 the U* maAimum allo1ed transmit po1er depending on the traffic class. This
maAimum po1er is defined b3 the parametersL
Ma.'!T.P&/er(&rC&n$ for &onversational traffic,
Ma.'!T.P&/er(&rStr for %treaming traffic,
Ma.'!T.P&/er(&rInt for .nteractive traffic,
Ma.'!T.P&/er(&rBac for 'ac9ground traffic.
!.3.3.! Inner -oop &o=er #ontro
The inner loop po1er control is virtuall3 defined in the 3G)) specifications and consists of comparing
the measured %.R on a /)&&5 1ith the %.R target set b3 the outer"loop po1er control algorithm. %uch
comparison is made ever3 time slot b3 the Node ' and a T)& command is then sent to the U* to po1er
up or do1nL
if measured %.R X target %.R then T)& command T Bpo1er step do1nC
if measured %.R W target %.R then T)& command T 4 Bpo1er step upC
The po1er control command is sent to the U* in the feedbac9 loop in the neAt available /)&&5 time
slot. The maAimum po1er control command rate is therefore 4$5z.
-or each radio lin9, the Node ' performs basic inner loop po1er control procedure b3 comparing the
measured %.R to the %.R target value and communicating T)& command to the U*.
!.3.3.!.4 /atabase parameters
operation.
2cPream!e Timeslot number of uplin9 /)&&5
transmission prior to the start of the uplin9
/)/&5 transmission
3G))
A// &*00&A&
Sr)e!a- /ata transmission dela3 on %R' to %R'=
3G))
A// &*00&A&
)e(au!tC&nstant3a!ue Threshold, 1hich U* uses to compute the U0
/)&&5G)o1erGoffset and further the U0
/)&&5 initial TA po1er during the open loop
po1er control process.
Motorola
%*T -R&
BetaC U0 /)&&5 gain set up
3G))
A//
T()RA''A%.&P
A//
T()%R''A%.&
Beta) U0 /)/&5 gain set up
3G))
A//
T()RA''A%.&P
A//
T()%R''A%.&
P/rCtr!A!# %election of U0 po1er control algorithm
number Z4 or number Z!
3G))
%*T -R&
'!T2cSte2S"8e The step size of the closed inner loop po1er
control performed on U0 /)/&5
3G))
%*T -R&
Ma.'!T.P&/er(&rC&n
$
Upper limit of U0 transmitted po1er for
conversational service in a specific cell.
Motorola
A// &*00&A&
Ma.'!T.P&/er(&rStr Upper limit of U0 transmitted po1er for
streaming service in a specific cell.
Motorola
A// &*00&A&
Ma.'!T.P&/er(&rInt Upper limit of U0 transmitted po1er for
interactive service in a specific cell.
A// &*00&A&
Motorola
Ma.'!T.P&/er(&rBac Upper limit of U0 transmitted po1er for
bac9ground service in a specific cell.
Motorola
A// &*00&A&
!.3.3.3 Outer -oop &o=er #ontro
!.3.3.3.4 ,vervie1
The purpose of the outer"loop po1er control algorithm is to update the %.R target of a dedicated
ph3sical channel in order to meet the Jualit3 of service eApected b3 the services carried over that
channel. There is no change in the U%R3 ,0)& algorithm 1ith respect to that in U%R!. -or eAample, it
still includes the main follo1ing characteristicsL
update the %.R target based on the bloc9"error rate B'0*RC measurements 1henever
available and update the %.R target based on the bit"error rate B'*RC measurements 1hen
no data is transmitted,
most ,0)& parameters can be specified on a per service basis, 1hich allo1s for great
fleAibilit3 in parameter settings,
the '*R target can be updated during the data transmission Binstead of being fiAed for the
duration of the callC, 1hich means that it can trac9 the variations of the radio channel,
multi"RA' operation BmuA of Tr&5sC is full3 supported b3 the ,0)& algorithm.
The U%R! ,0)& algorithm full3 supports the multipleAing of transport channels BTr&5sC at the
ph3sical la3er. 7hen a Tr&5 carries data from a Radio 'earer, that Tr&5 is used b3 the ,0)& to
adOust the &&Tr&5 %.R target. 5o1ever, if a Tr&5 carries a %ignalling Radio 'earer, there is a s1itch
that enables or disables the contribution of that Tr&5 to the ,0)&, i.e. the use of %R's is optional for
the ,0)& algorithm.
7hen multiple Tr&5s contribute to the ,0)&, an %.R target is maintained for each of them. Then the
algorithm combines these Tr&5s %.R targets to update the &&Tr&5 %.R target. This is illustrated in
-igure ! "!4 1here one 3! 9bitKs radio bearer carr3ing a )% RA's, t1o signalling flo1s BRR& and
NA%C are multipleAed at the MA& la3er and one :oice radio bearer lead to three transport channels
being multipleAed at the 0a3er 4 on the same &&Tr&5. The ,0)& algorithm maintains three %.R
targets Bone per Tr&5C plus one %.R target for the &&Tr&5 1hich is the target given to the Node 's in
the active set for inner"loop po1er control. Note that not ever3 %.R target update is signalled to the
Node ' because of the Juantization of values over N'A), i.e. to save on the .ub signalling load, the %.R
target updates are onl3 sent to the Node 's 1hen needed.
Another aspect of the multiple Tr&5s operation is the determination of the parameters to be usedL each
Tr&5 has a set of parameters that 1ould be used if that Tr&5 1as operated on its o1nP 1hen
multipleAed 1ith other Tr&5s, a ne1 set of parameters is derived from the individual sets and used for
all the multipleAed Tr&5s %.R targets.
The ,0)& algorithm also includes the concept of ?abnormal conditions@ during 1hich the %.R target is
frozen Bnot updatedC.
-igure !"!4L *Aample of Tr&5s multipleAing for the ,0)& operation
!.3.3.3.! ,peration under normal conditions
The ,0)& algorithm is eAecuted periodicall3 ever3 %.R adOustment period. A high"level description of
the different steps of the algorithm is given in the figure belo1.
!ig"1e;e description o$ SIR target update
K[ Tr&5s %.R targets update [K
$or each Tr&5 muA on the &&Tr&5 and contributing to the ,0)& do
i$ Tr&5 is in /ata mode
update the Tr&5 %.R targetP the update is bounded b3 min K maA values BTr&5"specificC
ese
do not update the Tr&5 %.R target
done
K[ &&Tr&5s %.R target update [K
i$ all the Tr&5s are in /TA mode
update the &&Tr&5 %.R target using '*R measurements Breported b3 the Node 'sC
ese
update the &&Tr&5 %.R target using the maA of the Tr&5s %.R targets for Tr&5s in /ata mode
K[ N'A) signalling [K
i$ the ne1 &&Tr&5 %.R target rounded do1n to .4 d' resolution is different from the previous value,
signal the ne1 value to the Node 's in the active set.
The /ata mode is used 1hen at least one transport bloc9 has been received during the past %.R
adOustment period. The /TA mode is used other1ise.
.n /ata mode, the Tr&5 %.R target is updated as follo1s. The increment in the %.R target is
proportional toL
the parameter %irAdOust-actor, a global service"independent parameter,
the parameter %irAdOust%tep, a Tr&5"dependent parameter,
the difference bet1een the '0*R measured on that Tr&5 and the '0*R target.
Note that the parameter S"rA%0ustSte2 is particularl3 useful to adapt the %.R increment to a particular
t3pe of service, e.g. :oice and non real"time /ata, in order to control the amount of adOustments brought
to the %.R target. Also note that the difference bet1een the measured '0*R and the '0*R target is a
signed Juantit3, i.e. the incremental %.R is negative if the measured '0*R is lo1er than the target
'0*R and positive other1ise.
Then the &&Tr&5 %.R target is updated b3 the same amount.
A similar method is used 1hen multiple Tr&5s are multipleAed on the &&Tr&5.
.n /TA mode, the Tr&5 %.R target is not updated but the &&Tr&5 target ma3 be updated based on the
ph3sical channel '*R measurements using the eJuations belo1.
i$ B
-3Ravge
Q '*R
target
V '*Rtarget4C
-3R@<Ste< S.R S.R +
ese i$ B
-3Ravge
W '*R
target
N '*Rtarget!C
< -3R/o#nSte S.R S.R
ese
do not update S.R
Note that b3 setting the parameters BERtar#et1 and BERtar#et< appropriatel3, it is possible to disable
an3 %.R target update based on '*R measurements.
The parameters BER'2Ste2 and BER)&/nSte2 define a fiAed change in the %.R target update.
.n all cases, the &&Tr&5 %.R target is bounded b3 t1o parameters M"nSIRtar#et and Ma.SIRtar#et
1hich can be set per service.
-inall3, note that all R's contribute to the ,0)& 1hereas the contribution of the %R's is optional
B0MT parameterC.
!.3.3.3.3 /efinition of abnormal conditions
.f the ,0)& algorithm detects a state of ?abnormal conditions@, the Tr&5s %.R targets and the
&&Tr&5 %.R target are frozen Bnot updatedC.
Abnormal conditions are detected 1hen the difference bet1een the &&Tr&5 %.R target and the actual
&&Tr&5 %.R Bmeasured b3 each Node ' in the active setC becomes too large for a certain period of
time. .n that case, the algorithm decides that it is safer to stop updating the target and 1aits for the
abnormal conditions to come to an end.
The Node ' is configured to trigger an event * or an event - dedicated measurement report B!$.=33C,
using the %.R error measurement `!$.!4$a. 7hen such events occur, the Node ' sends a measurement
report to the RN&, containing the measured %.R error. The event triggers are configured b3 the
follo1ing parameters `!$.=33aL
Measurement Threshold 4,
Measurement 53steresis.
Motorola &onfidential )roprietar3 !+
The parameters Measurement Threshold ! and Reporting )eriod are not specified, 1hich means thatL
B4C the Node ' uses for Measurement Threshold ! the same value as Measurement Threshold 4,
B!C the Node ' 1ill not report periodicall3 the %.R error after triggering an event.
The %.R error is measured over an ; ms period `!$.433a. The trigger of measurement report for e;ent
E is pictured in -igure ! "!!. 7hen the %.R error becomes greater than Measurement Threshold 4 and
sta3s above for a duration Measurement 53steresis Time, an event * measurement report is sent to the
RN& BReport AC. There is no periodic report after that. ,nl3 1hen the %.R error becomes lo1er than
Measurement Threshold 4 and sta3s belo1 for a duration Measurement 53steresis Time is another event
* measurement report sent to the RN& BReport 'C. The parameters are set as follo1s for event *L
Measurement Threshold 4 T %ir&onvergeTh,
Measurement 53steresis Time T %irReport53st.
E;ent / is configured in a similar manner and 1or9s as follo1s. 7hen the %.R error becomes lo1er
than Measurement Threshold 4 and sta3s belo1 for a duration Measurement 53steresis Time, an event
- measurement report is sent to the RN& BReport AC. There is no periodic report after that. ,nl3 1hen
the %.R error becomes greater than Measurement Threshold 4 and sta3s above for a duration
Measurement 53steresis Time is another event - measurement report sent to the RN& BReport 'C. The
parameters are set as follo1s for event *L
Measurement Threshold 4 T " %ir&onvergeTh,
Measurement 53steresis Time T %irReport53st.
-igure !"!!L *vent * triggered Measurement Reports
The ,0)& algorithm uses flags for each event B* and -C and each cell in the active set. Upon reception
of an event B* or -C Report A from a cell, the corresponding flag is set to true and upon reception of an
event B* or -C Report ', the corresponding flag is set to false. The * and - flags are initialised to false
1hen a cell is added to the active set.
These flags are chec9ed to detect an abnormal state in the follo1ing mannerL
if at least one cell in the active set has its flag for event * set to true, the ,0)& is in an
abnormal state,
if all the cells in the active set have their event - flags set to true, the ,0)& is in an
abnormal state,
if none of the conditions above is satisfied, the ,0)& is in a normal state.
The follo1ing points are 1orth notingL
There is no difference in operation 1hen more than one service is multipleAed.
.t is possible to virtuall3 eliminate the possibilit3 of entering a state of abnormal conditions
b3 setting the %ir&onvergeTh parameter to a ver3 large value.
7hen in compressed mode, the average %.R target Baveraged over an ; ms periodC is not
computed over the transmission gap.
.f a ne1 RA' is added 1hile the ,0)& is in a state of abnormal conditions, the abnormal conditions
state is cleared and the algorithm returns to the normal mode of operation.
Normal operations are resumed upon leaving the state of abnormal conditions.
!.3.3.3.= /atabase parameters
operation.
&arameter 'eaning E>panations B De$initions #ommand
SIRMEAS,ILTERCOE, Measured %.R
error filtering
coefficient
.t is the service independent la3er 3 filter
parameter that is used to filter the %.R
error before it is reported to the RN&.
3G))
%*T ,0)&
SIRCON3ERGETH) %.R error
chec9ing
threshold value
This is the service independent threshold
against 1hich the size of the %.Rerror
measurement is chec9ed to see 1hether
an event triggered report should be sent
to the RN&. These event triggered reports
are used to determine 1hether the ,0)&
is in a normal or abnormal state
3G))
%*T ,0)&
SIRERRREPORTH;ST %.R error
reported
h3steresis time
The service independent duration of time
for 1hich the %ir *rror must be above or
belo1 the %ir&onvergeThd before an
event triggered measurement report is
sent to RN&.
3G))
%*T ,0)&
SIRA)G'ST,ACTOR %.R adOusting
factor
The service independent parameter used
in /ata mode to fine tune an update to
the %.R target. .t is a multiplier used to
scale the /ata mode %.R target
adOustment. %ee /ata mode.
Motorola
%*T ,0)&
INITSIRTARGET .nitial %.R
Target
The initial %.R target of that service.
3G))
M,/
T()RA',0)&
BLER>'ALIT; '0*R Target '0*R target used for that service.
3G))
M,/
T()RA',0)&
MA@SIRTARGET MaAimum %.R
target
The service"dependent maAimum %.R
target applicable to that service
Motorola
M,/
T()RA',0)&
MINSIRTARGET Minimum %.R
target
The service"dependent minimum %.R
target applicable to that service
Motorola
M,/
T()RA',0)&
SIRA)G'STPERIO) %ir AdOustment
)eriod
%ervice"dependent parameter giving
duration over 1hich the '0*R and '*R
is estimated. .t is also the %.R target
update freJuenc3 Bthe maAimum value is
selected 1hen services are multipleAedC.
'0*RK'*R estimated over non"over
lapping time periods.
Motorola
M,/
T()RA',0)&
MA@SIRSTEP'P MaAimum %.R
step up size
%ervice dependent parameter used in
/ata mode to place an upper limit to a
%.R target increment Bstep upC during an
adOustment. %ee /ata mode.
Motorola
M,/
T()RA',0)&
MA@SIRSTEP)OBN MaAimum %.R
step do1n size
/ata mode to place a lo1er limit on a
decrement Bstep do1nC to the %.R target
during an adOustment. %ee /ata mode.
Motorola
M,/
T()RA',0)&
SIRA)G'STSTEP ,uter loop
po1er control
adOusting step
size
/ata mode to scale the adOustment made
to the %.R target. %ee /ata modeK
Motorola
M,/
T()RA',0)&
T;PICALBER)PCCH '*R Target '*R target corresponding to that service.
A Jualit3 target used in /TA mode
against 1hich '*R measurements from
across the A% are compared in order to
ma9e decision on %.R target adOustment.
Motorola
M,/
T()RA',0)&
Motorola &onfidential )roprietar3 !4!
BERTARGET1 Upper h3steresis
limit on the
'*R target
A service dependent upper limit used to
place a h3steresis around the '*R target.
,nl3 relevant to %.R target updates made
during /TA mode of operation.
MaAimum value chosen 1hen services
multipleAed. The %ee /TA mode.
Motorola
M,/
T()RA',0)&
BERTARGET< 0o1er
h3steresis limit
on the '*R
target
A service dependent lo1er limit used to
place a h3steresis around the '*R target.
,nl3 relevant to %.R target updates made
during /TA mode of operation.
multipleAed. %ee /TA mode.
Motorola
M,/
T()RA',0)&
SIRSTEP'PONBER '*R
measurement
based %.R target
step up
A service dependent %.R target step up
BincrementC used in /TA mode.
Motorola
M,/
T()RA',0)&
SIRSTEP)OBNONBER '*R
measurement
based %.R target
step do1n
A service dependent %.R target step do1n
BdecrementC used in /TA mode.
Minimum value chosen 1hen services
Motorola
M,/
T()RA',0)&
NONE)T@BERTAR,IL
TERCOE,
/ata mode '*R
target filter
coefficient
A service dependent ..R filter coefficient
used to filter the minimum '*R
measurement from across the Node '
active set and update the '*R target
during /ata mode. %ee /TA mode.
Motorola
M,/
T()RA',0)&
)T@BERTAR,ILTERC
OE,
/ata mode '*R
target filter
coefficient
A service dependent ..R filter coefficient
used to filter the minimum '*R
measurement from across the Node '
active set and update the '*R target
during /TA mode. %ee /TA mode.
Motorola
M,/
T()RA',0)&
SIG_)CH_OLPC_SBIT
CH
%R'
contribution to
,0)&
%ervice independent parameter used to
turn onKoff the facilit3 of %R contributing
to ,0)&. 7hen turned on the ,0)&
treats the %R' as 3et another Tr&5
contributing to ,0)&.
Motorola
%*T
&,RRMA0G,
%7.T&5
!.3.3.3.$ Ee3 )erformance .ndicators
J&I Descriptions
Std de;) o$ 0-ER The normalized transmission Jualit3 estimator standard deviation estimator
defined b3 the follo1ing formulaL
,
_
!
G
C B
C B C B
4
4
M
+ trg
trg est
N5RM -(3R
+ er
+ er + er
M
,
1hereL
C B + er
est
" is either current value of the bloc9 error rate '0*R estimate,
1hich is used for po1er control purpose at the current moment if a ne1 transport
bloc9 is received, or current value of the bit error rate '*R estimate if at the
current moment none transport bloc9 1as received i.e. due to /T8 mode.
+ " is consecutive number of observation period, 1hich is eJual to the
time interval of the one transport bloc9 TT. for the observed RA'.
C B + er
trg
" is specific for each service traffic class the target '0*R if at
the observation moment + the transport bloc9 1as received, or specific for each
service traffic class target '*R value used b3 the po1er control algorithm if at the
observation moment + , 1as not received an3 transport bloc9.
M " is statisticall3 significant number of observations to dra1 the
conclusion at certain level of confidence.
-or multi RA' configuration E). supposed to be evaluated for each RA'
separatel3.
RA'cs estimated '0*R B'loc9 *rror RateC is defined as ratio of received in U0
transport bloc9s to the total number of bloc9s that fail &R&.
Algorithm2s performance increases 1hen E). value decreases.
Target
'0*RK'*R
&onfidence
0evel
ReJuired %td. *rror
of *stimator BVK"C
,bserved number
'0*R
measurements M
BNumber of
AdOusting
)eriodsC
4_ >$_ 4_ 4,3!3,3=
!_ +_ 4_ <><,3;$
$_ +$_ $_ <4=,<3!
4_ +$_ !_ +<,3<!
Motorola &onfidential )roprietar3 !4=
+%-oad #ongestion #ontro
+%)% Agorit"m o;er;ie=
Note that this algorithm is covere$ in the 7R>:MN: ((oa$ Resh"ffling). The feat"re 7R>:MN: #as
originally to be im<lemente$ in @SR 6.D b"t #as $elaye$ to @SR 6.DO. At the same time' some
feat"res closely relate$ to the 7R>:MN:' s"ch as the 7R>:POD an$ the 7R>6O=M' are im<lemente$ in
@SR 6.D. /"e to the $elay of the 7R>:MN:' the 7R>:POD an$ the 7R>6O=M co"l$ not be a$e0"ately
teste$ in @SR6.D. Therefore it #as finally $eci$e$ that most of the re0"irements of the 7R>:MN: #o"l$
be im<lemente$ in @SR6.D. Accor$ing to the H=.O im<lementation matrix' the entire (/R algorithm
an$ the 5(C algorithm exce<t the fast T7 control action are in @SR 6.D. The fast T7 control action in
the 5(C algorithm #ill be im<lemente$ in @SR 6.DO.
+%)%)%Description
.n order to guarantee s3stem stabilit3 and to meet different service and Jualit3 reJuirements, the load
congestion control algorithm can be used to reduce the data rate and if necessar3 release some services
until the s3stem becomes stable. 0&& include t1o stagesL 0oad Reduction and ,verload &ontrol. 0oad
Reduction B0/RC can graduall3 reduce s3stem load and ma9e room for admission control. 0oad
Reduction is triggered once basic congestion occurs. ,verload &ontrol B,0&C is triggered 1hen
overload congestion occurs can Juic9l3 reduce s3stem load and restore stabilit3.
0oad Reduction operates independentl3 in both, uplin9 and do1nlin9, 1hich can be configured b3 the
setting of algorithm s1itch NBMS/"tch for uplin9 and do1nlin9 respectivel3. The parameter
NBMS/"tch is cell algorithm s1itch, 1hich include the s1itch for /0 0/R and U0 0/R, and defined
in the 0MT command A// &*00A0G,%7.T&5. BNBMS/"tch has multiple purposes related to
algorithm operationC. The trigger is eAcessive cell load in an3 direction, 1hich is measured b3
monitoring the RT7) BReceived Total 7ideband )o1erC and T&) BTransmitted &arrier )o1erC or T&)
for non"5%/)A for U0 and /0 respectivel3. 0/R is triggered based on a periodic chec9 of the basic
congestion and the actual actions start once the do1nlin9 basic congestion threshold is eAceeded. There
are five actions 1hich can be configured to ta9e place in an3 specified order through an action JueueL
.nter"carrier load balancing B.&0'CL .&0' can onl3 be activated through 0/R and is used to
handover a U* from a heavil3 loaded cell to a co"located cell on a different carrier.
'* rate reductionL can reduce the data rate of '* services directl3 to the minimum data rate using
the RR& Radio 'earer reconfiguration procedure. The minimum data rate is determined b3 the
/&&& algorithm.
.u 6o% renegotiationL can be activated onl3 b3 0/R. .n this action, The MaA 'it rate of )% domain
real time services Bconversational and streamingC non"5%/)A RA's B&allsC can be renegotiated
over the .u using the RANA) RA' Modification ReJuest procedure.
.nter"RAT load balancing Bcircuit s1itched domainC B.RAT"0'"&%CL can attempt to handover users
Motorola &onfidential )roprietar3 !4$
to G%MKG)R%K*/G* depending on their RA's. .t is applicable to &%"domain Real"Time services
B&onversational and %treamingC and specific RA's eligible to be handed over to !G can be
configured through a 3G to !G mapping table. This action is applicable onl3 to U*s 1ith a single
RA'.
.nter"RAT load balancing Bpac9et s1itched domainC B.RAT"0'")%CL can attempt to handover users
to G%MKG)R%K*/G* depending on their RA's. .t is applicable to )%"domain services B%treaming
and '*C and specific RA's eligible to be handed over to !G can be configured through a 3G to !G
mapping table. This action is applicable onl3 to U*s 1ith a single RA'.
The follo1ing parameters are provided for the configuration of 0/R action Jueues in the MM0
command A// &*000/RL
/o1nlin9 0/R first actionL )!L%r,"rstAct"&n
/o1nlin9 0/R second actionL )!L%rSec&n%Act"&n
/o1nlin9 0/R third actionL )!L%rTh"r%Act"&n
/o1nlin9 0/R fourth actionL )!L%r,&urthAct"&n
/o1nlin9 0/R fifth actionL )!L%r,"$thAct"&n
Uplin9 0/R first actionL '!L%r,"rstAct"&n
Uplin9 0/R second actionL '!L%rSec&n%Act"&n
Uplin9 0/R third actionL '!L%rTh"r%Act"&n
Uplin9 0/R fourth actionL '!L%r,&urthAct"&n
Uplin9 0/R fifth actionL '!L%r,"$thAct"&n
,verload &ontrol operates independentl3 in both, uplin9 and do1nlin9, 1hich can be configured b3 the
setting of algorithm s1itch NBMS/"tch for uplin9 and do1nlin9 respectivel3. The parameter
NBMS/"tch is cell algorithm s1itch, 1hich include the s1itch for /0 0/R and U0 0/R, and defined
in the 0MT command A// &*00A0G,%7.T&5. . BNBMS/"tch has multiple purposes related to
algorithm operationC The trigger is eAcessive cell load in an3 direction, 1hich is measured b3 monitoring
the RT7) and T&) or T&) for non"5%/)A for U0 and /0 respectivel3. The ,0& can be configured to
trigger either based on a periodic chec9 of the overload congestion or based on an overload congestion
event. 7hen a cell is detected to be overloaded, t1o actions can be ta9en in order to reduce load, fast
'* service control and dropped calls. -ast '* Binteractive and bac9ground services onl3C control is
used to reduce the throughput of '* services and is achieved b3 the MA& la3er. /ropped call action
can release U*s 1hich have lo1 priorit3 as defined b3 a metric 1hich has operator configurable
1eightings. The functionalit3 of ,0& supported in U%R 3. is the dropped call action. -ast '* control
1ill be supported in U%R 3.$ and is not addressed in this document.
!4.4.4.4 -## 'easurement #ontro
-or the purpose of load congestion control, the RN& configures the Node ' to perform either event * or
Motorola &onfidential )roprietar3 !4<
periodic common measurements on cell transmit carrier po1er BT&)C in the do1nlin9 and received total
1ideband po1er BRT7)C in the uplin9. %election of the measurement reporting method for ,0& is
performed b3 setting the attribute NBMS/"tch. .f ,0&G*:*NTM*A% in NBMS/"tch is selected,
then the ,0& 1ill be triggered based on an overload congestion event. ,r else the ,0& 1ill be triggered
based on a periodic chec9. -or the do1nlin9, the measurement entit3 can be either Transmitted &arrier
)o1er BR++ T&)C or Transmitted &arrier )o1er of all codes not used for 5%")/%&5 or 5%"%&&5
transmission Bnon"5%/)A T&)C. .f 5%/)A is supported and enabled in a cell, the RN& 1ill trigger
non"5%/)A T&) measurement reporting. .f 5%/)A is not supported or disabled in a cell, RN& 1ill
trigger Rel"++ T&) measurement reporting. ,nl3 periodic reporting is applicable to 0/R. 'oth event
reporting and periodic reporting are applicable to ,0&.
!4.4.4.4.4 Node ' )eriodic Measurement Reporting
.f periodic reporting is selected, measurement reports for T&) BR++ or 5%/)AC on do1nlin9 and
RT7) on uplin9 are generated periodicall3 at the Node ' and sent to the RN&. The measurements
reported b3 the Node ' are the output of the 0a3er 3 filter for such measurements. The measurement
reporting periodicit3 and 0a3er 3 filter are set as part of the :4.$ 0/M 1hich controls the common
Measurement Reports BMRCP through the command %*T 0/M, the periodicit3 and 0a3er 3 filter for
basic congestion and overload congestion can be configured. 7hen 0/M gets the MRs from Node ', it
1ill use the algorithm"dependent interval and filtering 1indo1 length to process the MRs for each
relevant algorithm Bsuch as &A&, )U&, 0/R and ,0&C.
.n the 0/R case, the MRs are further averaged at the RN& using a sliding 1indo1 approach. The
sliding 1indo1 sizes for 0/R are 'LL%rA$#,"!terLen and )LL%rA$#,"!terLen in %*T 0/M for
uplin9 and do1nlin9 measurements respectivel3. The RN&"averaged value is compared 1ith the 0/R
trigger threshold and release threshold ever3 L)RPer"&%T"merLen period to decide the 0/R state.
.n the ,0& case, the sliding 1indo1 sizes are 'LO!cA$#,"!terLen and )LO!cA$#,"!terLen in %*T
0/M for uplin9 and do1nlin9 measurements respectivel3.
!4.4.4.4.! Node ' *vent"triggered Measurement Reporting
7hen event * triggered reporting is configured, t1o different thresholds are defined, ?Trigger
Threshold@ and ?Release Threshold@, 1hich result in the initiation of Measurement Reporting
)rocedures ?Report A@ and ?Report '@ respectivel3. Reception of an event * Breport AC triggers actions
to control overload congestion, 1hereas reception of an event * Breport 'C means that the cell leaves
overload congestion state.
Motorola &onfidential )roprietar3 !4>

T1
T1
Meas%re&
'a$%e
Time
Trigger
T"res"o$&
Re$ease
T"res"o$&

T1 ( Meas%rement )*steresis Time
T1
Report A Report B
Periodic
Reports
Report A Periodic
Report
Meas%rement Reports
-igure !4"!3L *vent * reporting 1ith 53steresis Time and )eriodic Reporting
.n the figure it can be seen that event * measurement reporting procedure BReport AC is initiated 1hen
the measured value rises above the YTrigger Threshold2 and sta3s there for the YMeasurement 53steresis
Time2 BT4C. 'ased on the Report )eriodicit3 the Node ' initiates the Measurement Reporting procedure
periodicall3. The periodic reporting continues even if the measured value falls belo1 the YTrigger
Threshold2 and is terminated b3 the reception of Report '.
7hen the Report A conditions have been met and the measured entit3 falls belo1 the YRelease Threshold
2 and sta3s there for the YMeasurement 53steresis Time2 BT4C the measurement reporting procedure
BReport 'C is initiated and periodic reporting is terminated.
The follo1ing parameters are provided in RN& :4.$ for the configuration of event * reporting
associated 1ith the congestion control algorithm.
Trigger ThresholdL )LOLCTr"#Th% for do1nlin9, 'LOLCTr"#Th% for uplin9
Release ThresholdL )LOLCRe!Th% for do1nlin9, 'LOLCRe!Th% for uplin9
53steresis TimeL )LOLCH-stT"me for do1nlin9, 'LOLCH-stT"me for uplin9
Report )eriodicit3L .n the do1nlin9, TenMsec,&r)!O!cMeas or M"n,&r)!O!cMeas according to
the setting of Ch&"ceR2rt'n"t,&r)!O!cMeas. .f T*NGM%*& is selected in
Ch&"ceR2rt'n"t,&r)!O!cMeas, then the value of do1nlin9 report periodicit3 is decided b3 the
setting of TenMsec,&r)!O!cMeas. .f M.N is selected in Ch&"ceR2rt'n"t,&r)!O!cMeas, then the
value of do1nlin9 report periodicit3 is decided b3 the setting of M"n,&r)!O!cMeasP in the
do1nlin9, TenMsec,&r'!O!cMeas or M"n,&r'!O!cMeas according to the setting of
Ch&"ceR2rt'n"t,&r'!O!cMeas. .f T*NGM%*& is selected in Ch&"ceR2rt'n"t,&r'!O!cMeas,
then the value of uplin9 report periodicit3 is decided b3 the setting of TenMsec,&r'!O!cMeas. .f
M.N is selected in Ch&"ceR2rt'n"t,&r'!O!cMeas, then the value of uplin9 report periodicit3 is
decided b3 the setting of M"n,&r'!O!cMeasP
Motorola &onfidential )roprietar3 !4;
!4.4.4.! UE Seection &rocess
There are t1o methods to select candidates used b3 0&&L P
RAB
and *NU, 1hich are metrics used to
ran9 U*s to decide in 1hich order the3 are targeted b3 0&& triggered actions. 'ased on P
RAB
, 0/R 1ill
sort the U*s and produce a general list of Jualified U*s for further consideration b3 all 0/R actions
eAcept .&0'. *NU is specific to the .&0' action and is used to select one U* for .&0'.
The P
RAB
is a 1eighted sum of RA' parameters defined asL
).TS ).TS RAT3 RAT3 C(ASS C(ASS R A R A RA-
8 , 8 , 8 , 8 , P + +
K K
E
AKR
stands for the .* ?AllocationKRetention priorit3@ BrangeL g4=C
E
&0A%%
stands for the .* ?%ervice &lass@ BrangeL g3C
E
RAT*
stands for a mapped value based on the RA'2s data rate BrangeL g3;=C,
E
5.T%
stands for the number of times a RA' is selected to be degraded. Note this parameter
is applicable to the U* listing of the follo1ing mechanismsP '* rate reduction, .u 6o%
renegotiation and -ast '* controlP other1ise E
).TS
T .
7
AKR
is the 1eight for E
AKR
L rang g4$3<, default =[3;=T4$3<
7
&0A%%
is the 1eight for E
&0A%%
L range g<4==, default 3;=,
7
RAT*
is the 1eight for E
RAT*
L range g<=, default 4,
7
5.T%
is the 1eight for E
5.T%
L range g<4==, default !.
The lists of U*s per 0/R action BeAcept for .&0'C are constructed based on P
RAB
. The maAimum
numbers of candidates N
$o#nlin9
and N
"<lin9
chosen for each do1nlin9 and uplin9 0/R action BeAcept
.&0'C are 0MT configurable parameters. These parameters determine the maAimum size of the U* list.
-or the case 1here multiple RA's are supported for a U*, P
RAB
is calculated independentl3 for each
RA'. 5o1ever the ran9ing is based on using the highest P
RAB
value of all RA's for a U*. N
$o#nlin9
and
N
"<lin9
are different for each 0/R action. These are defined in the MM0 command A// &*000/RL
'* rate reduction Bdo1nlin9CL )!L%rBERateRe%uct"&nTra((Num
.u 6o% Renegotiation Bdo1nlin9CL )!L%rPsRT>&sRene#Tra((Num
.RAT"0'"&% Bdo1nlin9CL )!L%rCSInterRatHOTra((Num
.RAT"0'")% Bdo1nlin9CL )!L%rPSInterRatHOTra((Num
'* rate reduction Buplin9CL '!L%rBERateRe%uct"&nTra((Num
.u 6o% Renegotiation Buplin9CL '!L%rPsRT>&sRene#Tra((Num
.RAT"0'"&% Buplin9CL '!L%rCSInterRatHOTra((Num
Motorola &onfidential )roprietar3 !4+
.RAT"0'")% Buplin9CL '!L%rPSInterRatHOTra((Num
The *NU metric is differentl3 defined in the do1nlin9 and uplin9 direction. .n the do1nlin9L
( )
( ) ( ) ( )
rerGRate %tdG/0G'ea G/0G*bNo %td or ivit3G-act %tdG/0GAct
Rate /0G'earerG G/0G*bNo ReJuired 3G-actor /0GActivit
*NUG/0

n n n
n
/0GActivit3G-actorBnC is the /0 activit3 factor of the nth user.
ReJuiredG/0G*bNoBnC is the BlinearC /0 *bNo value of the nth userP
/0G'earerGRateBnC is the /0 bearer rate B9bitKsC of the nth userP
%tdG/0GActivit3G-actor is the /0 activit3 factor of the referenced service Bdefault 4.,
corresponding to 4_ in the 0MT command %*T A/M&TR0CP
%tdG/0G*bNo is the BlinearC /0 *bNo value of the referenced serviceL the *bKNo of the
referenced service 1ill be read b3 RN& automaticall3 from the curves of '0*R vs. *bKNo
according to the cell t3pe selected. The referenced mode of selection 4!.!9 AMR voice, 4_
'0*R, 4K3 &&. *bKNo is the corresponding point in the /0 curves set b3 the `%*T
TRA-*'Na command.
%tdG/0G'earerGRate is the /0 bearer rate B9bitKsC of the referenced service Bdefault 4!.!,
corresponding to 4!.! 9bitKsC.
.n uplin9L
( )
( ) ( ) ( ) n n n
8
@( n
Rate U0G'earerG GU0G*bNo ReJuired 3G-actor U0GActivit
7
4
rerGRate %tdGU0G'ea GU0G*bNo %td or ivit3G-act %tdGU0GAct
4
G *NU

+

+
n is the n"th user,

( ) m N n , , ! , 4
,
U0GActivit3G-actorBnC is the U0 activit3 factor of the n"th user,
ReJuiredGU0G*bNoBnC is the BlinearC U0 *bNo value of the n"th userP
U0G'earerGRateBnC is the U0 bearer rate B9bitKsC of the n"th userP
%tdGU0GActivit3G-actor is the U0 activit3 factor of the referenced serviceP Bdefault 4.,
corresponding to 4_CP
%tdGU0G*bNo is the BlinearC U0 *bNo value of the referenced service. the *bKNo of the
default service 1ill be read b3 RN& automaticall3 from the curves of '0*R vs. *bKNo
according to the cell t3pe selected. The referenced mode of selection is 4!.!9 AMR voice,
4_ '0*R, 4K3&&. *bKNo is the corresponding point in the U0 curves set b3 the `%*T
TRA-*'Na command.
%tdGU0G'earerGRate is the U0 bearer rate B9bitKsC of the referenced service. Bdefault 4!.!,
corresponding to 4!.! 9bitKsC.
7 is the chip rateL 3;= 9bitKs
The 0MT configurable parameter Inter,re?HOE?u'srNum2, provide the upper limit of the
candidate2s *NU, are used to select a user 1ho has the maAimum *NU and its *NU is less than
YInter,re?HOE?u'srNum2 to handover.
!4.4.4.3 Agorit"m Impementation
!4.4.4.3.4 0/R algorithm
RN& processing for the 0oad Reduction algorithm can be summarised in the follo1ing steps. The
do1nlin9 0/R and uplin9 0/R are independent of each other but have similar implementations.
.f the do1nlin9 0/R algorithm is enabled in the cell, the RN& reJuests the initiation of periodic
Transmitted &arrier )o1er measurements or Transmitted &arrier )o1er of all codes not used for
5%")/%&5 or 5%"%&&5 transmission in the Node ', via N'A) signalling in the Node '. .n the
uplin9, if the uplin9 0/R is enabled, the RN& reJuests the initiation of periodic Received Total
7ideband )o1er measurements via N'A) signalling.
.n the do1nlin9 1hen the T&) BR++ or 5%/)AC measurement from the Node ' eAceeds the
threshold given b3 )LL)RTr"#Th%, basic congestion control is then entered and the first action is
called as configured in the do1nlin9 action Jueue. .n the uplin9 1hen the RT7) measurement from
the Node ' eAceeds the threshold given b3 'LL)RTr"#Th%, basic congestion control is then
entered and the first action is called as configured in the uplin9 action Jueue. )eriodic reports 1ill
indicate the Transmit &arrier )o1er BR++ or 5%/)AC 0evel Bdo1nlin9 cell loadC and RT7) level
Buplin9 cell loadC, according to the setting of the L)RPer"&%T"merLen attribute in the %*T
0/&)*R.,/ 0MT command.
A general list of Jualified U*s is constructed for the action called in the do1nlin9 or BandC uplin9.
0/R assumes the success of an action if at least one U* is listed in the respective U* lists. Apart
from .&0' in 1hich there is no further filtering process of a U* selected b3 0/R, other actions2
filtering processes ma3 leave no U* to be considered in the action itself. 5o1ever, the failure of an
action to select a U* is not fed bac9 to 0/R.
,nce an action is assumed successful b3 0/R, no further action is called and 0/R 1aits for the
neAt periodic call. .f no candidate user can be identified for an action, then 0/R proceeds to the
neAt action.
7hen 0/R is called at the neAt periodic call, congestion is chec9ed if it is not triggered based on
)LL)RTr"#Th% or BandC 'LL)RTr"#Th%, or the relieve congestion is chec9ed B)LL)RRe!Th%
orKand 'LL)RRe!Th%C. .f the relieve congestion is not satisfied, 0/R enters Action 0oop again
and steps ! to = above are eAecuted again.
7hen basic congestion is relieved, all the 0/R variables are reset and steps ! to $ above are
eAecuted again, if applicable. Also, there are no specific restoration actions for 0/R i.e., '*
service rates 1ill not be restored. The decision to increase data rates is left 1ith the /&&&
algorithm based on user transmission needs and radio lin9 Jualit3. .n addition, if an action,
e.g. .RAT"0'"&%, is running due to a previous periodic call, it 1ill not be terminated.
Motorola &onfidential )roprietar3 !!4
0/R operation is terminated at an3 time if ,0& is triggered. 5o1ever, this does not mean that
0/R variables are resetP the3 are reset onl3 1hen basic congestion is relieved.
!4.4.4.3.4.4 .&0'
7hen .&0' is called b3 0/R, its operation is as follo1sL
.&0' is activated onl3 through 0/R. 'ased on *NU one U* is selected, 1hich has the maAimum
*NU and its *NU is less than YInter,re?HOE?u'srNum2. The onl3 parameter that 0/R is
concerned 1ith is the successful selection of at least one U* and if this occurs, 0/R assumes
?%uccess@ of this action.
Use the RN& filtered T&) BR++ or 5%/)AC in the do1nlin9 and RN& filtered RT7) in the uplin9
for each available carrier having the same coverage area Bco"located carriersC to ran9 their load
level from Minimum to MaAimum.
&ompare the difference bet1een the load level of the cell that 0/R is triggered in and the load level
of the other carriers. .f the difference is greater than InterCarr"erL&a%)"((Th%, 1hich can be
configured in the MM0 command A// &*000/R, for at least one carrier go to the neAt step,
other1ise go to %tep $.
&onduct inter"freJuenc3 handover to target cells for the U* selected Bonl3 one U* 1ill be handed
overC.
7ait for the neAt 0/R call.
!4.4.4.3.4.! '* Rate Reduction
'* Rate Reduction 1ill be enabled onl3 if it is configured in the 0/R action Jueue and /&&& is
enabled. 7hen '*RR is called b3 0/R, its operation is as follo1sL
The list of P
RAB
derived U*s for this action is constructed b3 0/R. The '*RR algorithm is
applicable to 'est *ffort B'*C services onl3. This list 1ill be further modified b3 de"listing those
U*s 1hose bit rates are less than the ?/0 reduction target bit rate@ in the do1nlin9 or ?U0
reduction target bit rate@ in the uplin9, 1hich are configured through the 0MT configurable
parameter ?rate control threshold@ that is one of the /&&&"specific configurable parameters.
Reduce the rates of all selected U*s directl3 to the lo1est level B/&&& ?rate control threshold@C
using the RR& Radio 'earer reconfiguration procedure BU*s are processed in parallelC.
!4.4.4.3.4.3 .u 6o% Renegotiation
The .u 6o% Renegotiation algorithm is invo9ed onl3 b3 0/R and is not an independent feature.
Motorola &onfidential )roprietar3 !!!
Renegotiation is carried out for maAimum bit rates onl3 Bi.e. not for guaranteed bit ratesC. 7hen .u 6o%
Renegotiation is called b3 0/R, its operation is as follo1sL
The list of P
RAB
derived U*s for this action is constructed b3 0/R. The .u 6o% Renegotiation
algorithm is applicable to )%"domain Real"Time services onl3 B&onversational and %treamingC. The
list is further modified b3 de"listing those U*s 1hose current maAimum bit rate is not higher than
the guaranteed bit rate.
-or all selected U*s reduce their maAimum bit rates through RANA) RA' Modification ReJuest
procedures BU*s are processed in parallelCP The operation for a given RA' is as follo1sL
NoteL The &N can include RA' parameters that can be negotiated in the RANA) RA' Assignment
ReJuest message or RANA) Relocation ReJuest message 1ithin the .* ?Alternative RA'
)arameter :alues@.
.f the .* ?Alternative RA' )arameter :alues@ 1as not received previousl3 from the &NL
the RN& reJuests the ReJuested MaAimum 'it Rate to be the Guaranteed 'it Rate using
the RANA) RA' M,/.-( R*6U*%T message 1ithin its ?ReJuested RA' )arameter
:alues@ .*. The RN& also sets the Guaranteed 'it Rate to the previousl3 received value.
.f the .* ?Alternative RA' )arameter :alues@ 1as received previousl3 from the &NL
The RN& reJuests the ReJuested MaAimum 'it Rate to be the Alternative MaAimum 'it Rate
through the RANA) RA' M,/.-( R*6U*%T message 1ithin its ?ReJuested RA' )arameter
:alues@ .*. The RN& also sets the Guaranteed 'it Rate to the previousl3 received value.
The admission control module ma9es the final decision on accepting the RA' modifications for the
concerned )%"domain RA'. This includes 1hen MaA 'it Rate is being reJuested through setting of
RANA) RA' M,/.-( R*6U*%T and follo1ing the response from the &N BRANA) RA'
A%%.GNM*NT R*6U*%TC. .f the Admission &ontrol module reOects the admission reJuest, the
RN& can trigger &all )re"emption andKor &all 6ueuing Bif the function s1itch is enabledC
!4.4.4.3.4.= .RAT"0'"&%
The .RAT"0'"&% algorithm is invo9ed onl3 b3 0/R and is not an independent feature. 7hen .RAT"0'"
&% is called b3 0/R, its operation is as follo1sL
The list of P
RAB
derived U*s for this action is constructed b3 0/R. The .RAT"0'"&% algorithm is
applicable to &%"domain Real"Time services B&onversational and %treamingC and specific RA's
eligible to be handed over to !G can be configured through a 3G to !G mapping table. Multi"RA'
U*s are not applicable for this algorithm.
.nter"RAT handover is carried out in parallel for all selected U*s. B%ee the section for .nter"RAT
load based handoverC
Motorola &onfidential )roprietar3 !!3
-urther details on the .RAT"0' algorithm are given in section <.
!4.4.4.3.4.$ .RAT"0'")%
The .RAT"0'")% algorithm is invo9ed onl3 b3 0/R and is not an independent feature. 7hen .RAT"0'"
)% is called b3 0/R, its operation is as follo1sL
The list of P
RAB
derived U*s for this action is constructed b3 0/R. The .RAT"0'")% algorithm is
applicable to )%"domain services B%treaming and '*C and specific RA's eligible to be handed over
to !G can be configured through a 3G to !G mapping table. Multi"RA' U*s are not applicable for
this algorithm.
.nter"RAT handover is carried out in parallel for all selected U*s. B%ee the section for .nter"RAT
load based handoverC
-urther details on the .RAT"0' algorithm are given in section <.
!4.4.4.3.! ,0& algorithm
RN& processing for the overload congestion control algorithm can be summarised in the follo1ing
steps.
.f the do1nlin9 0/R algorithm is enabled in the cell, the RN& reJuests the initiation of event"
triggered or periodic Transmitted &arrier )o1er measurements or Transmitted &arrier )o1er of all
codes not used for 5%")/%&5 or 5%"%&&5 transmission measurements in the Node ' via N'A)
signalling. .n the uplin9, if the uplin9 0/R is enabled, the RN& reJuests the initiation of event"
triggered or periodic Received Total 7ideband )o1er measurements in the Node ' via N'A)
signalling.
.n the case of periodic reporting, in the do1nlin9 1hen the T&) BR++ or 5%/)AC measurement
from the Node ' eAceeds the threshold given b3 )LOLCTr"#Th%, overload congestion control is
then entered and call dropping is performedP in the uplin9 1hen RT7) measurement from the Node
' eAceeds the threshold given b3 'LOLCTr"#Th%, overload congestion control is then entered and
call dropping is performed.
.n the case of event triggered reporting, in the do1nlin9 the Measurement Reporting procedure
BReport AC is initiated 1hen the T&) BR++ or 5%/)AC rises above the )LOLCTr"#Th% and sta3s
above the threshold for at least the )LOLCTr"#H-st"defined t"me. Upon reception of Report A,
do1nlin9 ,0& is triggered. .n the uplin9 the Measurement Reporting procedure BReport AC is
initiated 1hen RT7) measurement from the Node ' rises above the 'LOLCTr"#Th% and sta3s
above the threshold for at least the 'LOLCTr"#H-st"defined time. Upon reception of Report A,
uplin9 ,0& is triggered.
/uring the selective dropping stage, the RN& selects U*s to be dropped based on P
RAB
. The
Motorola &onfidential )roprietar3 !!=
maAimum number of U*s selected to drop is )!O!cTra((Re!'serNum in the do1nlin9 and
'!O!cTra((Re!'serNum in the uplin9. .n the uplin9 users in %oft handover state are not dropped. .f
the cell is overloaded in the do1nlin9 and not overloaded in the uplin9, the RN& 1ill drop the calls
selected b3 do1nlin9 ,0&. 5o1ever, if the cell is overloaded both in the uplin9 and in the
do1nlin9, RN& 1ill drop the call selected b3 the uplin9 ,0& and 1ill not drop the calls selected b3
do1nlin9 ,0&.
,0& actions ma3 be ta9en ever3 OLCAct"&nT"merLen#th unless the cell is not in overload state.
There is onl3 one ,0& action timer OLCAct"&nT"merLen#th for both do1nlin9 and uplin9
.n the case of periodic reporting, 1hen the cell load level falls belo1 the threshold levels given b3
)LOLCRe!Th% and 'LOLCRe!Th%, do1nlin9 and uplin9 congestion control is disabled
respectivel3.
.n the case of event triggered reporting, in the do1nlin9 1hen Report A has been triggered and the
po1er per cell falls belo1 the )LOLCRe!Th% and sta3s there for at least the )LOLCTr"#H-st"
defined time, the measurement reporting procedure BReport 'C is initiated. Upon reception of Report
', the do1nlin9 ,0& status is releasedP in the uplin9 1hen Report A has been triggered and the
po1er per cell falls belo1 'LOLCRe!Th% and sta3s there for at least the 'LOLCTr"#H-st"defined
time, the measurement reporting procedure BReport 'C is initiated. Upon reception of Report ', the
uplin9 ,0& status is released.
+%)%)+Dependencies
Note that the 0&& algorithm onl3 applies to services mapped on /&5 channels. .t is not applicable to
services mapped on 5%/)A.
This algorithm is closel3 related to the admission control algorithm B&A&C. 0oad Reduction aims to
graduall3 reduce s3stem load and ma9e room for admission control admitting ne1 reJuests. %o the
thresholds of 0/R should be set belo1 the thresholds of admission control. ,verload &ontrol is used to
reduce Juic9l3 the load to maintain s3stem stabilit3 Be.g. 1ith respect to po1er controlC. The thresholds
for overload state should be set above the thresholds of admission control.
The 0/R '* Rate Reduction action cannot be invo9ed if /&&& is disabled and this action decreases
data rates through performing the /&&& algorithm.
-ast '* service control B,0& actionC is performed b3 the MA& la3er and is not directl3 related to the
/&&& algorithm.
.f a cell is in basic congestion status or overload congestion status, /&&& 1on2t perform up"
reconfiguration.
,nce ,0& is triggered, the 0/R operation 1ill be suspended until ,0& is released.
Motorola &onfidential )roprietar3 !!$
+%)+ Reated -'T commands
The algorithm can be configured and optimized 1ith the follo1ing commandsL
%*T 0/M
A// &*000/R
A// &*000/M
A// &*00A0G,%7.T&5
%*T 0/&)*R.,/
%*T 0/&7*.G5T
A// &*00,0&
The detailed information on these commands can be found in the ?Reference parameters spreadsheet@.
+%)3 Jey per$ormance indicators
J&I Description
.&0' action times
BU0K/0C
Average number of times this action is triggered b3 0/R.
'*RR action times
BU0K/0C
Average number of times this action is triggered b3 0/R
.u"renegotiation action
times BU0K/0C
.RAT"0'"&% action times
BU0K/0C
Average number of times this action is triggered b3 0/R
.RAT"0'"&% action times
BU0K/0C
0/R *fficienc3
BU0K/0C
Average time reJuired to eAit cell ?basic congestion@ state after triggering basic
congestion.
,0& &all /rop &oefficient
BU0K/0C
)ercentage of calls that are dropped b3 ,0& actions compared to the total in the
cell. This is computed separatel3 for voice and data calls.
,0& *fficienc3
BU0K/0C
Average time reJuired to eAit cell ?congestion@ state after triggering overload
congestion.
,0& *ffectiveness
BU0K/0C
Average impact of overload control actions on the cell load, measured as the
reduction achieved in T&)KRT7) per action ta9en.
+%)2 Optimization guideines
+%)2)%&arameters and recommendation
Motorola &onfidential )roprietar3 !!<
+%)2)+E>pected J&I ;aues
T'/.
+%)2)3Sensiti;ity anaysis
-DR period
The 0/R period should not be set too short. .f the 0/R period is set too short, it is possible that 0/R
is called 1hilst a previous action is still running. .n this case it ma3 result in too man3 U*s being
impacted and too much radio load being reduced. ,n the other hand, if the 0/R period is set too long, it
is possible to decrease the opportunit3 to underta9e necessar3 or useful 0/R actions and increase the
opportunit3 to trigger the ,0& algorithm. .n addition once the ,0& algorithm is triggered the 0/R
algorithm 1ill be suspended and the 0/R actions 1ill no be ta9en. %o under the condition of the too
long 0/R period the 0/R algorithm ma3 have no effect on the radio load.
The inter"RAT handover load based 0/R action ma3 ta9e a long time Beven 4sC to successfull3
handover a U* from 3G to !G, so to support the use of this action the 0/R algorithm should not be
called more freJuentl3 than once per 4s. .f the inter"RAT handover action is not included in 0/R
action Jueues, the 0/R period can be set belo1 the recommended value B4sC. .n contrast, the inter"
carrier load balancing B.&0'C algorithm B1hich is also one of the possible 0/R actionsC is a blind
handover so it 1ill not ta9e so long B4g!sC for this algorithm to complete a handover. .f the inter"RAT
handover action not included in the 0/R action Jueue, the recommended value of the 0/R period is 3s.
Motorola &onfidential )roprietar3 !!>
++Directed Retry Decision
++)% Agorit"m o;er;ie=
++)%)%Description
The /irected Retr3 /ecision B/R/C algorithm includes three componentsL
RR& Retr3 /ecision algorithm,
Redirection algorithm,
RA' Retr3 /ecision algorithm.
7ithin the UTRAN, a U* can ta9e on one of t1o connection modesL namel3, RR& connected mode and
idle mode. 7hen a U* 1ants to establish an RR& connection it must first send an RR&
&,NN*&T.,N %*TU) R*6U*%T message to the UTRAN BRN&C. At this stage of the call set"up
process, the obOective of the RR& &,NN*&T.,N R*6U*%T is to establish an %R' on a /&5. To
invo9e the /R/ algorithm, the U* should include a RA&5 measurement report Bcontaining the &).&5
*cNo measurements of several neighbourKcandidate cellsC. This list of candidate cells is then ran9ed in
descending order, based on the *cNo measurements. .f the U* cannot establish an RR& connection 1ith
its preferred cell, the candidate list is then seJuentiall3 eAamined in a to<2$o#n manner until a suitable
cell is obtained. .f none of the cells in the list satisf3 the criteria of the RR# Retry Decision agorit"m,
the U* fails in its attempt to establish an RR& connection and the Redirection agorit"m is invo9ed. .f
on the other hand the U* is successful in its attempt to establish the reJuested RR& connection, the &N
then initiates the RA' assignment procedure. .f the assignment procedure is not successful, the RA0
Retry Decision agorit"m is invo9ed. The /R/ algorithm can be triggered b3 both U* originating and
terminating calls. -igure !! "!= illustrates the RR& and RA' establishment procedures incorporating
the three components of the /R/ algorithm.
Motorola &onfidential )roprietar3 !!;
U* RN&
RR& &,NN*&T.,N R*6U*%T
B&ontaining RA&5 Measurement ReportC
RR& &,NN*&T.,N %*TU)
B&ontaining BNe1C &ell .nformationC
RR& &,NN*&T.,N %*TU) &,M)0*T*
&N
RR& /.R*&T TRAN%-*R
RANA) /.R*&T TRAN%-*R
RANA) RA' A%%.GNM*NT R*6U*%T
RANA) RA' A%%.GNM*NT R*%),N%*
RR& Retr3
/ecision Algorithm
RA' Retr3
/ecision Algorithm
Redirection Algorithm
U* RN&
RR& &,NN*&T.,N R*6U*%T
B&ontaining RA&5 Measurement ReportC
RR& &,NN*&T.,N %*TU)
B&ontaining BNe1C &ell .nformationC
RR& &,NN*&T.,N %*TU) &,M)0*T*
&N
RR& /.R*&T TRAN%-*R
RANA) /.R*&T TRAN%-*R
RANA) RA' A%%.GNM*NT R*6U*%T
RANA) RA' A%%.GNM*NT R*%),N%*
RR& Retr3
/ecision Algorithm
RR& Retr3
/ecision Algorithm
RA' Retr3
/ecision Algorithm
RA' Retr3
/ecision Algorithm
Redirection Algorithm
-igure !!"!= RR& and RA' establishment procedures incorporating the /R/ algorithm
The three components of the /R/ algorithm ma9e use of an .nformation *lement in the RR&
&onnection ReJuest message sent b3 the U* to the RN&, 1hen available. 7hen configured to do so
through %.'4 and %.'44, the U* includes a set of ?measured results on RA&5@, i.e. a list of *cNo
measurements made on a number of intra"freJuenc3 cells. %ubOect to a number of conditions detailed
belo1, these measurements are used b3 the /R/ algorithm to build a list of candidate cells for the retr3
decision, the RR& &andidate %et.
7hen an RR& &onnection ReJuest message including ?RA&5 measurement results@ is received from a
particular U*, the RN& maintains a list of cells for 1hich the reported *cNo is above a threshold
MINSIGNALRE>'IRE) together 1ith a time stamp eJual to the %3stem cloc9 Ban RN&"internal
timeC at the time the message is processed. The cells 1ith an *cNo belo1 the threshold
MINSIGNALRE>'IRE) are discarded. The threshold is configurable.
Note that it is possible that a U* sends other measured results on RA&5, hence the time stamps ma3
var3 bet1een cells 1ithin the RR& &andidate %et maintained b3 the RN& for that particular U*.
The RR& &andidate %et L
is made of triplets Bcell id, *cNo, time stampC,
onl3 includes cells 1hose &RN&s are co"located in the same RN&,
has a maAimum size 1hich is configurableP the maAimum size of RR& &andidate %et is
eJual to INTRA,)RMA@N'M V )RMA@'MTSN'M, i.e. there are at most
)RMA@'MTSN'M inter"freJuenc3 cells in the RR& &andidate %et and at most
INTRA,)RMA@N'M intra"freJuenc3 cells in the RR& &andidate %et.
is maintained until a RA' is successfull3 established for that U*, after 1hich it can be
discarded.
Motorola &onfidential )roprietar3 !!+
!!.4.4.4 RR# Retry Decision Agorit"m
7hen the initial RR& &,NN*&T.,N R*6U*%T fails, the follo1ing RR& Retr3 /ecision algorithm is
invo9edL
4. .f an RR& &andidate %et is available for that U*, go to %tep !P other1ise send an RR&
&,NN*&T.,N R*#*&T message to U* and eAit the RR& Retr3 /ecision algorithm.
!. %ort the RR& &andidate %et in decreasing order of *cNo values, eAcluding the cell for 1hich
the initial RR& &onnection ReJuest has failed. 5o1ever, if this cell supports multiple carriers
Bhaving the same coverage areaC, these concentric inter"freJuenc3 neighbour cells are given
priorit3 and placed at the top of the RR& &andidate %et, even though measurements are not
available for these cells.
3. %elect the first cell in the RR& &andidate %et as the target cell.
=. .f the target cell has sufficient resources Bradio admission control, ,:%- codes, etc MC to
support the %R', send an RR& &,NN*&T.,N %*TU) message to the U* 1ith the ne1 target
cell information and eAit the RR& Retr3 /ecision algorithmP other1ise, go to %tep $.
$. .f all cells in the RR& &andidate %et have been eAamined, invo9e the Redirection algorithmP
other1ise select the neAt cell in the RR& &andidate %et as the target cell and go to %tep =.
<. %end RR& &,NN*&T.,N R*#*&T to U* and eAit the RR& Retr3 /ecision algorithm.
!!.4.4.! Redirection Agorit"m
The Redirection algorithm is invo9ed if the initial RR& &onnection ReJuest fails and no suitable UMT%
cell is identified b3 the RR& Retr3 /ecision algorithm. Under these circumstances, the RN& responds
to the U* 1ith an RR& &,NN*&T.,N R*#*&T message. 7ithin this message, the Redirection .* is
used to redirect the U* to another UMT% freJuenc3 or other s3stem Be.g. G%MC. The Redirection .*
does not contain specific cell information. .nstead, the RN& need onl3 indicate that the inter"freJuenc3
or inter"RAT cell reselection procedure should be invo9ed at the U*. The Redirection algorithm applies
the follo1ing stepsL
4. .dentif3 an3 available UMT% freJuencies that have not alread3 been eAamined in the RR&
Retr3 /ecision algorithm. Note: if the @MTS cell for #hich the initial RRC connection faile$
s"<<orts m"lti<le carriers (having the same coverage area)' only these available
fre0"enciesCinter2fre0"ency cells #o"l$ have been examine$ as <art of the RRC Retry
/ecision algorithm.
!. .f N alternative UMT% freJuencies are available B1hich have not alread3 been eAamined in the
RR& Retr3 /ecision algorithmC, select one of the follo1ing three casesL
3. .f NT, the RN& redirects the U* to G%M via the Redirection .* 1ithin the RR&
&,NN*&T.,N R*#*&T message. Go to %tep <.
=. .f NT4, the RN& redirects the U* to the alternative UMT% freJuenc3 via the Redirection .*
1ithin the RR& &,NN*&T.,N R*#*&T message. Go to %tep <.
$. .f NQ4, one of the alternative freJuencies is chosen arbitraril3 and the RN& redirects the U* to
the selected UMT% freJuenc3 via the Redirection .* 1ithin the RR& &,NN*&T.,N R*#*&T
message. Go to %tep <. Note: if one or more @MTS cells incl"$e$ #ithin the RAC)
meas"rement re<ort has a concentric inter2fre0"ency neighbo"r #hose carrier fre0"ency is
i$entical to one of those i$entifie$ #ithin the Re$irection algorithm' these fre0"encies are
given <riority in the Re$irection algorithmQs (arbitrary) fre0"ency selection <rocess.
<. *Ait the Redirection algorithm.
!!.4.4.3 RA0 Retry Decision Agorit"m
!!.4.4.3.4 /&5 RA' Retr3 /ecision Algorithm
.f the U* is successful in its attempt to establish an RR& connection, an %R' is set"up bet1een the U*
and RN& Bvia the target UMT% cellC and the U* responds 1ith an RR& &,NN*&T.,N R*6U*%T
%*TU) &,M)0*T* message. ,n completion of the RR& connection setup, the U* delivers the call
control Bfor &% connectionC or session management Bi.e. )/) conteAt reJuest for )% connectionC
information to the &N via RR&KRANA) direct transfer messages. The &N then responds b3 sending a
RA' A%%.GNM*NT R*6U*%T to the RN& B1hich, in turn, invo9es the radio bearer and .u &%K)%
bearer establishment procedures bet1een RN&"U* and RN&"&N, respectivel3C. The radio bearer
establishment procedure involves the RN& invo9ing both the Radio Admission &ontrol and ,:%- &ode
Allocation Algorithms to eAamine, respectivel3, the U0K/0 cell loading and /0 code availabilit3 at the
target UMT% cell for supporting the RA' reJuest.
Moreover, the U* should be in either the &ellG/&5 or &ellG-A&5 RR& state and, at this point, no
radio bearer has been established.
The RA' Retr3 /ecision algorithm comprises the follo1ing stepsL
4. -ormulate an initial RA' &andidate %et using the UMT% cell for 1hich the RR& connection
has been established, and the remaining UMT% cells that are ran9ed belo1 this cell 1ithin the
RR& &andidate %et.
!. -or each UMT% cell 1ithin the RA' &andidate %et, compute the time difference BTC bet1een
the s3stem cloc9 and the time stamp assigned to its &).&5 *cNo value contained 1ithin the
U*s RA&5 measurement report.
3. /iscard UMT% cells from the RA' &andidate %et 1hose T eAceeds the maAimum allo1able
time period 1hich is configurable.
=. &ompute the RA' Retr3 Metric for each UMT% cell 1ithin the RA' &andidate %et
( ) ( ) ( ) ( ) n T (7 n MR n M
,
, , , 4 , N n
1here
o MBnC is the RA' Retr3 Metric for the n
th
cell in the RA' &andidate %et,
o MRBnC is the &).&5 *cNo measurement for n
th
cell in the RA' &andidate %et,
o (7 is a 1eighting factor 1hich is configurable,
o T is the time difference bet1een the s3stem cloc9 and the time stamp of the n
th
cells
measurement reportP
N is the number of cells in the RA' &andidate %et.
$. Given the RA' &andidate %et, a Reference &andidate %et BR&%C is then formulated in
accordance 1ith the RR& state of the U*L
o .f the U* is in the &ellG-A&5 RR& state, the current camping cell is placed at the top of
the R&%. All remaining UMT% cells 1ithin the RA' &andidate %et are then ran9ed Bin
descending orderC in accordance 1ith their RA' Retr3 Metric.
o .f the U* is in the &ellG/&5 RR& state, the best cell is placed at the top of the R&%,
follo1ed b3 the other active set cells, then the remaining cells in the R&% are added
according to their ran9ing Bin descending orderC of all UMT% cells in the RA' &andidate
%et in accordance 1ith their RA' Retr3 Metric.
Note: the siIe of RCS is less than a maxim"m value RE,CSMA@N'M 1hich is configurable.
<. -or an R&% size of M, a candidate set of inter"freJuenc3Kinter"RAT cells for the U* is
formulated in the follo1ing mannerL
i. .f MT4, the blin$ han$over target inter2fre0"encyCinter2RAT cell for 1hich a
handover attempt 1ill be made is the inter"freJuenc3Kinter"RAT neighbour cell associated
1ith the UMT% cell in the R&%. A 5andover &andidate %et B5&%C of cells for blind
handover contains the blind handover neighbour cells of this cell. -or inter"freJuenc3
handover, the target cell must be in the same RN&.
ii. .f MQ4, retrieve the inter"freJuenc3Kinter"RAT neighbours for each UMT%
cell 1ithin the R&%. A 5andover &andidate %et B5&%C of cells for blind handover is then
formulated as follo1sL
Note: the inter2fre0"encyCinter2RAT neighbo"r of a given @MTS cell can be either co2
locate$ or non co2locate$. Moreover' it is <ossible that an inter2fre0"encyCinter2RAT
neighbo"r can be associate$ #ith more than one @MTS cell in the RCS. 7or exam<le' an
inter2fre0"encyCinter2RAT cell co"l$ be a co2locate$ neighbo"r to a given @MTS cell.
)o#ever' this same inter2fre0"encyCinter2RAT cell co"l$ also be $efine$ as a non co2
locate$ neighbo"r to other @MTS cells. .f on ins<ecting the list of inter2fre0"encyCinter2
RAT neighbo"rs it is fo"n$ that one of these inter2fre0"encyCinter2RAT cells is associate$
#ith t#o or more @MTS cells then' by $efinition' this inter2fre0"encyCinter2RAT cell can
be a co2locate$ neighbo"r (at most) #ith one @MTS cell an$ a non co2locate$ neighbo"r
#ith the remaining associate$ @MTS cells. .nter2fre0"encyCinter2RAT cells of this nat"re
#ill be referre$ to as common inter2fre0"encyCinter2RAT cells from hereon' #hilst inter2
Motorola &onfidential )roprietar3 !3!
fre0"encyCinter2RAT neighbo"rs that are associate$ #ith only a single @MTS cell #ithin
the RCS #ill be referre$ to as non2common inter2fre0"encyCinter2RAT cells. .t sho"l$ also
be note$ that no $istinction is ma$e as to #hether an inter2fre0"encyCinter2RAT cell is co2
locate$ (or not) #ith a <artic"lar @MTS cell "n$er the KA//
.NT3R7R3!NC3((CFSMNC3((L comman$. The maxim"m siIe of )CS is e0"al to
/RMA;FSMN@M 4 /RMA;@MTSN@M' i.e there are at most /RMA;@MTSN@M
inter2fre0"ency cells in the )CS an$ at most /RMA;FSMN@M FSM cells in the )CS.
aC The blin$ han$over target inter2fre0"encyCinter2RAT cells of the first
UMT% cell 1ithin the R&% is given priorit3 and placed at the top of the 5&%. These
cells are placed in the 5&% 1ith the order based on the blind handover priorit3.
bC The non2common blin$ han$over target inter2fre0"encyCinter2RAT
cells are then ran9ed in the 5&% in accordance 1ith their position 1ithin the R&%.
-or each cell in R&%, its non"common blind handover target inter"freJuenc3Kinter"
RAT cells are placed in the 5&% 1ith the order based on the blind handover priorit3.
cC The ordered list is then finalised b3 placing the common blin$
han$over target inter2fre0"encyCinter2RAT cells in an arbitrar3 order at the bottom
of the 5&%.
>. %elect the first inter"freJuenc3 cell 1ithin the 5&% as the target cellP if there is no inter"
freJuenc3 cell, select the first inter"RAT neighbour cell 1ithin the 5&% as the target cell.
;. .f the selected cell is a G%M cellL
Return RA' A%%.GNM*NT R*%),N%* to &N 1ith the cause /irected Retr3
Bnote 4 C.
%tart the Relocation )rocedure 1ith cause /irected Retr3 for the target cell.
.f the RN& receives a 5AN/,:*R -R,M UTRAN -A.0UR* message from the
U* the RN& responds b3 sending a R*0,&AT.,N &AN&*0 message to the &N.
,nce the RN& has received the R*0,&AT.,N &AN&*0 A&EN,70*/G*, go
to step +. ,ther1ise, if the relocation procedure is successful the RN& responds b3
sending a R*0,&AT.,N &,M)0*T* to the &N, and proceed to %tep 4.
.f the selected cell is an inter"freJuenc3 cellL
)erform inter"freJuenc3 handover and RA' assignment procedure.
.f succeeds, go to step 4, other1ise, go to step +.
+. .f all inter"freJuenc3Kinter"RAT neighbour cells in the 5&% have been eAamined, go to %tep 4.
,ther1ise, select the neAt cell in the 5&% and go to %tep >.
4. *Ait RA' Retr3 /ecision algorithm.
Note %. .n the case 1here the RN& has no RA' configuration for a particular U* in the &% domain,
and the RN& receives a RA' A%%.GNM*NT R*6U*%T message for that U* reJuesting the
establishment of one RA' onl3, a directed retr3 to perform inter"s3stem handover to G%M ma3 be
initiated. .n this case the RN& ma3 interrupt the ongoing RA' assignment procedure and initiate the
Relocation )reparation procedure as follo1sL
the RN& shall terminate the RA' assignment procedure indicating unsuccessful RA' configuration
modification of that RA' 1ith the cause /irecte$ retry.
the RN& shall report this outcome of the procedure in one RA' A%%.GNM*NT R*%),N%*
message.
the RN& shall invo9e relocation b3 sending the R*0,&AT.,N R*6U.R*/ message to the active
&N node, 1ith the cause /irecte$ Retry.
the &N shall terminate the RA' Assignment procedure at reception of the RA' A%%.GNM*NT
R*%),N%* message.
Note +. .n U%R3, there are t1o t3pes of blind handoverL urgent and non"urgent. Urgent blind handover
is onl3 triggered b3 4- event of the best cell and can use all the blind handover target cells 1ith priorit3
g3, through setting a lo1est threshold of 4- event, this urgent blind handover function can be
disabled. Non"urgent blind handover can onl3 use the blind handover target cell 1ith priorit3 g4$. The
blind handover priorit3 is configured for each neighbour cell. *ver3 priorit3 number corresponds to onl3
4 neighbour cell eAcept priorit3 34 1hich means non"blind handover cell. )riorit3 of ?@ means highest
priorit3, i.e. the first cell to consider as handover target. Non"urgent blind handover corresponds to the
blind handover mechanism that 1as alread3 present in U%R! and can be used b3 the .nter"carrier 0oad
'alancing algorithm also. .n U%R3, RA' /R/ algorithm should use non"urgent blind handover.
.n U%R3, 5%/)A RA' Retr3 is introduced and ma3 happen in the follo1ing scenariosL
.nitial %ervice *stablishment
Traffic :olume Triggered
Initia Ser;ice Estabis"ment
.n this scenario, U* reJuests to establish a 5%/)A RA' from &*00"-A&5 state or &*00"/&5 state.
.f the current cell is not 5%/)A capable or it is 5%/)A capable but there are not enough resources,
5%/)A RA' retr3 is triggered.
Tra$$ic Voume Triggered
U* has alread3 established service in &*00"-A&5 state, and 5%/)A capable cell covers the current
cell, i.e. one neighbour cell 1ith 5%/)A capabilit3 eAists in the non"urgent blind handover cells list.
7hen &ellG-A&5"Q&ellG/&5 s1itching is triggered for U* in &*00"-A&5 state due to high traffic
Motorola &onfidential )roprietar3 !3=
volume, if the traffic should be s1itched to the 5%/)A channel, but the current cell is not 5%/)A
capable or it2s 5%/)A capable but there2s no enough resource, 5%/)A RA' retr3 is triggered. )lease
note that the 5%/)A RA' can onl3 be retried to an inter freJuenc3 cell the target cell must be in the
same RN&.
.f the 5%/)A RA' Retr3 procedure fails, i.e. there is no Jualified cell to provide the 5%/)A
connection, a 5%/)A RA' Retr3 failure shall be indicated. 'ased on the failure indication, a /&5
RA' 1ith the closest 6o% reJuirement to that 5%/)A RA' 1ill be retried instead. Refer to the RA'"
R' mapping document for detailed information on ho1 /&5 RA' is configured.
++)%)+Dependencies
There are some dependencies bet1een the /R/ feature and the follo1ing algorithmsL
/&&&
o 7hen &ellG-A&5"Q&ellG/&5 s1itching is triggered based on /&&& traffic volume
measurement for a U*, if the traffic should be s1itched to the 5%/)A channel, but the
current cell is not 5%/)A capable or it2s 5%/)A capable but there are not enough
resources, 5%/)A /R/ is triggered.
RA'"to"R' Mapping
o The interaction 1ith RA'!R' mapping algorithm is indirect, if 5%/)A /R/ is failed at
last, /&5 R' shall be admitted to best satisf3 6o% reJuirements.
&A&
o ,nce an alternative"serving cell is selected for the direct retr3, a ne1 call reJuest is sent to
the &A&, 1hich manages the cell. The &A& for the ne1l3 selected serving cell 1ill conduct
a call admission control follo1ing the procedure of a ne1 call reJuest and send the result to
the RR module in the RN& for the final admission decision.
++)+ Database parameters
The follo1ing MM0 commands are used in the /R/ algorithmL
%*T /R/,
A//KM,/ &*00/R/,
A//KM,/ .NT*R-R*6N&*00,
A//KM,/ .NT*RRATN&*00.
Motorola &onfidential )roprietar3 !3$
The %*T /R/ command is used to setup default values for the /R/ parameters for all the cells
controlled b3 the RN&. The commands A//KM,/ &*00/R/ can be used to setup cell"specific value
for the /R/ parameters. Therefore all the /R/ parameters are in effect cell"oriented.
The commands A//KM,/ .NT*RRATN&*00 are used to set the blind handover flag of G%M
neighbour cells. The commands A//KM,/ .NT*R-R*6N&*00 are used to set the blind handover
flag of inter"freJuenc3 neighbour cells.
++)3 Jey per$ormance indicators
J&I Descriptions
RR# #onnection Setup Success
Ratio Due to DRD
Ratio bet1een the number of RR& &,NN*&T.,N %*TU)
&,M)0*T* messages received b3 the UTRAN on a given cell
and the number of RR& &,NN*&T.,N R*6U*%T messages
sent b3 the U* over the measurement period 1hich 1ere on a
different source cell. This measures effectiveness of the RR&
Retr3 /ecision procedure.
RR# #onnection ReOuestB
ReVect Ratio
Ratio bet1een the number of RR& &,NN*&T.,N R*6U*%T
messages received b3 the UTRAN and the number of RR&
&,NN*&T.,N R*#*&T messages sent to the U* b3 UTRAN
over the measurement period 1ith the end result being subseJuent
successful RR& &onnection setup. This measures effectiveness of
the RR& Redirection )rocedure. NoteL This E). ma3 not be
entirel3 accurate as the RR& &,NN*&T.,N R*6U*%T% do not
have an .* that indicates that the RR& &,NN*&T.,N
R*6U*%T 1as due to an RR& &,NN*&T.,N R*#*&T 1ith
Redirection .*, ho1ever it is eApected that 1ith /R/ there 1ould
be higher ratio of RR& &,NN*&T.,N R*6U*%T% to RR&
&,NN*&T.,N R*#*&T and subseJuent successful RR&
&onnection setups than 1ithout /R/.
RA0 Assignment Success Ratio
Due to DRD
Ratio bet1een the number of R*0,&AT.,N &,M)0*T*
messages sent b3 the RN& and the number of R*0,&AT.,N
R*6U.R*/ messages sent b3 the RN& 1ith the cause /irecte$
Retry. This measures the effectiveness of the RA' Retr3 /ecision
Algorithm in case the /R/ target cell is G%M cell.
Motorola &onfidential )roprietar3 !3<
++)2 Optimization guideines
++)2)%&arameters and recommendation
++)2)+E>pected J&I ;aues
RR# #onnection Setup Success Ratio Due to
DRD
T'/
RR# #onnection ReOuestBReVect Ratio T'/
RA0 Assignment Success Ratio Due to DRD Q +;_
++)2)3Sensiti;ity anaysis
&urrentl3 there is no available lab testKsimulation result could be used to identif3 1hich 0MT
parameters can significantl3 impact the defined E).s.
Motorola &onfidential )roprietar3 !3>
+3-ayered #e Tra$$ic Absorption
The la3ered cell traffic absorption functionalit3 is based on the 3G)) concept of hierarchical cell
structure B5&%C described in T%!$.+!! and T%!$.3=, but applied to U*s in &*00G/&5 state.
+3)% Agorit"m O;er;ie=
+3)%)%Description
The 0a3ered &ell Traffic Absorption algorithm B0&TAC is an eAtension of the inter"freJuenc3 55,
algorithm that ma9es use of different cell t3pes Bmicro"cells and macro"cellsC to define a t1o"tier multi"
carrier cellular structure. Mobilit3 is then achieved bet1een the la3ers b3 appl3ing different triggering
conditions for the inter"freJuenc3 handover depending on the source and target cell t3pe. /ifferent la3ers
need to use different carrier freJuencies in the overlapping areas, but each la3er Beither micro"cell or
macro"cellC supports up to t1o separate carrier freJuencies.
0a3ered cells are those deplo3ed in a tiered structured, and can be classified as micro"cells or macro"
cells. A macro"cell is defined as a cell in 1hich there is at least one smaller cell Ba micro"cellC overlapped
1ithin its coverage areaP and a micro"cell is defined as a cell 1hose coverage area is 1ithin or
overlapped b3 a macro"cell. &onversel3, a non"la3ered cell is defined as a cell 1ith a coverage area that
is not 1holl3 contained 1ithin another cell and that does not 1holl3 contain another cell, i.e. it is neither
a macrocell or a microcell. 5o1ever, non"la3ered cells ma3 be partiall3 overlapped b3 other non"la3ered
cells.
.n order to use 0&TA in a particular cell Bas opposed to the normal inter"freJuenc3 handover algorithmC,
the attribute Inter,re?H&S/"tch in A// &*005,&,MM must be set to the value Inter_,re?_TA. .f
this is the case, configuration of the cell t3pe is carried out b3 setting the TACe!!T-2e attribute in the
A// &*00.NT*R-R*65,TA command, on a per cell basis. 7ithin the same command, the attribute
Inter,re?Meas>uant"t- sets 1hether &).&5 R%&) or &).&5 *c.o must be used as the measurement
Juantit3 for 0&TA"driven inter"freJuenc3 hard handovers in that cell. Note that the measurement
Juantit3 is a function of the source cell t3pe onl3, and that the same Juantit3 is used for an3 target cell
t3pe.
!3.4.4.4 Inter1$reOuency 'easurement Reporting $or -#TA
The operation of 0&TA is eAtremel3 similar to that of the standard inter"freJuenc3 55, algorithm, i.e.
events !/K!- configuration and periodic measurements of inter"freJuenc3 neighbour cells Bcurrentl3,
event triggered reporting is not supported for 0&TAC. The main differences bet1een the operation of the
t1o algorithms are that each has its o1n set of parameters to control the !/K!- events as 1ell as
parameters for the handover decisionP and in addition the 0&TA has separate handover decision
parameters for macro and microcells.
'elo1 is a summar3 of the operation for 0&TA.
Motorola &onfidential )roprietar3 !3;
.f the current serving cell Bor best cell in the active setC has inter"freJuenc3 neighbours defined, and
if 0&TA is activated in that cell Bvia the A// &*005,&,MM commandC, the U* is reJuested to
evaluate inter"freJuenc3 events !/ and !-. &onfiguration of the event"triggering criteria is carried
out 1ith the command A// &*00.NT*R-R*65,TA 1ith the follo1ing attributes.
o 53st-or!/, 53st-or!-
o TrigTime!/, TrigTime!-
o 7eight-orUsed-reJ
o .nter-reJAThd-or!/*cNo, .nter-reJAThd-or!/R%&)
o .nter-reJAThd-or!-*cNo, .nter-reJAThd-or!-R%&)
1here A is either &% or )%, enabling different triggering thresholds to be set for the t1o
domains.
,nce an event !/ is received, the U* is commanded to perform periodic inter"freJuenc3
measurements 1ith a given periodicit3 and filter coefficient.
o .nter-reJ-ilter&oef
o )eriodReport.nterval
.f an event !- is received, periodic measurement of inter"freJuenc3 neighbours stops.
!3.4.4.! Triggering o$ inter1$reOuency -#TA !ard !ando;er
/uring inter"freJuenc3 periodic reporting, the RN& receives Jualit3 estimates of all monitored carrier
freJuencies 1ithin the M*A%UR*M*NT &,NTR,0 message. Then, if the estimated Jualit3 of the
active set is 1orse than the reported Jualit3 of another carrier and the time to trigger and minimum
threshold level conditions are fulfilled, inter"freJuenc3 hard handover is performed.
The minimum threshold level for la3ered cell inter"freJuenc3 handover can be set differentl3 for each
target cell t3pe, through the attributesL Inter,re?.Th%T&Macr&-, and Inter,re?.Th%T&M"cr&-, 1here
A T &% or )%, and 3 T *cNo or R%&). .n addition, there are the h3steresis BH-st,&rHHOC and time to
trigger attributes BTr"#T"meHHOC, 1hich are common to all cell t3pes.
.n general, apart from having different thresholds for different cell la3ers, the handover decision
processing is similar to that of normal inter"freJuenc3 handover eAcept that all measurement reporting
of inter"freJuenc3 cells is performed on a periodic basis. The triggering condition for a la3ered cell inter"
freJuenc3 handover Bafter a !/ event has been triggeredC is that the estimated Jualit3 of the active set
freJuenc3 is belo1 the reported Jualit3 of another carrier, and the Jualit3 of the target freJuenc3 is
above a minimum threshold level plus a h3steresis value, during a time to trigger period,
Tr"#T"meHHO.
5ence, 1hen the eJuation belo1 is satisfied, the time to trigger counter starts.
! K ) ! !
th$ 0"al
+ >
Motorola &onfidential )roprietar3 !3+
1here
0"al
!
is the reported Jualit3 BR%&) or *cNoC of the target carrier freJuenc3,
th$
!
is the minimum threshold level for the target carrier freJuenc3 Bbased on domain,
la3er and Jualit3 t3peC,
) is the h3steresis value used in the 55, evaluation, H-st,&rHHO.
The counter 1ill be reset to zero if the eJuation belo1 is satisfiedL
! K ) ! !
th$ 0"al
<
.
,ther1ise, 55, is performed if the counter reaches the configured time to trigger period.
+3)+ Reated -'T commands
The commands for configuring the 0&TA algorithm parameters are as follo1s. The related database
parameters are documented in a separate spreadsheet, the ?Reference )arameters %preadsheet@.
A// &*00.NT*R-R*65,TA Add cell"oriented traffic"based inter"freJuenc3 handover
measurement algorithm parameters.
A// &*005,&,MM &ontrols Bthrough .nter-reJ5o%1itchC 1hether 0&TA
parameters are used as opposed to normal inter"freJuenc3
handover operation
+3)3 Jey per$ormance indicators
J&I Description
-#TA Depoyment E$$iciency Average percentage of inter"freJuenc3 55, that target a
micro"cell over the total amount Bmacro"cell V non"la3ered cell
V micro"cellC, as a measure of ho1 much traffic Bnumber of
callsC is being biased to1ards micro"cells than9s to 0&TA
algorithm. A lo1 value indicates that there is lo1 transference
of calls bet1een the macro"cell and the micro"cell, 1hich
defeats the aim of 0&TA deplo3ment.
'icro1ce !!O Gain Reduction in U0 U* Transmit )o1er Bor /0 N' TA )1rC
after 0&TA hand"off to a micro"cell, compared to that reJuired
in a macro"cell. This represents the capacit3 and Jualit3 gain
due to handling calls in the microcellular la3er.
Motorola &onfidential )roprietar3 !=4
+2#e 0reat"ing
+2)% Agorit"m O;er;ie=
+2)%)%Description
7hen the loads of intra"freJuenc3 cells are not even, the distribution of cell load is balanced b3
automatic adOusting the cell coverage B&).&5 po1erC to improve the utilization of s3stem resource i.e.
cell breathing.
The cell breathing algorithm is aimed at balancing the loads 1ithin cells 1ith the same freJuenc3.
According to the load level in one cell, the module of the cell breathing decides 1hether the load balance
is needed. .f the output is (*%, the po1er of the pilot channel is changed. .f the load level eAceeds one
load threshold, the pilot po1er is decreased. As a result, the number of U*s is handed over to
lightl3Kheav3 loaded cell Bthe %5, area ma3 var3C. %ome U*s in this cell 1ith the high load ma3 leave
the current cell and go into the neighbour cell. .f the load level is belo1 one load threshold, the pilot
po1er is increased. %ome U*s in the neighbour high load cell ma3 go into this cell.
7hen the load of one cell is too heav3, it results in transmission loss and the Jualit3 of communications
is decreased for the users at the edge of the cell. At the same time, neighbour cells could still have man3
available resources. 7hen this happens, cell breathing can be used to avoid this situationL the cell size
1ill be reduced 1hen the cell is over"loaded and the cell size 1ill be increased 1hen the cell is lightl3
loaded b3 adOusting the transmitted po1er of the pilot channel. The U* at the edge of the cell 1ill be
s1itched to the neighbour cells 1hen the cell is over"loaded and the U* at the edge of neighbour cells
1ill be s1itched to the cell 1hen it is light"loaded. This results in a more efficient use of the radio
resources. .t should stressed ho1ever that there is no coordination bet1een cells for adOusting the pilot
po1erP the cell breathing algorithm acts on a individual cell, therefore coverage gaps can potentiall3 be
created due to uncoordinated adOustments.
The algorithm steps areL
4. ,btain the current D- Transmitted #arrier &o=er Bperiodic N'A) Transmitted &arrier
)o1er measurement report from the Node '8 for the cell and store it.
!. &ompare the transmitted po1er 1ith cell breathing thresholds. .f the transmitted po1er is
greater than the cell overloading threshold 9Ce!!O$errunTh%1, go to 3C. .f the transmitted po1er
is less than the cell underloading threshold BCe!!'n%errunTh%1, go to =C.
3. .f the transmitted po1er of pilot channel has alread3 reached the minimum value
7M"nPCPICHP&/er1, go to $C, other1ise reduce the transmitted po1er of do1nlin9 pilot
channel b3 one step 9PCPICHP&/erPace1 and go to $C.
=. .f the transmitted po1er of pilot channel has alread3 reached the maAimum value
Motorola &onfidential )roprietar3 !=!
9Ma.PCPICHP&/er1, go to <C, other1ise increase the transmitted po1er of do1nlin9 pilot
channel b3 one step 9)&).&5)o1er)aceC and go to <C.
$. *Aecute the N'A) &ell Reconfiguration procedure to set the ne1 )&).&5 po1er value in the
cell at the Node '.
<. 7ait for a given ?1aiting period@ BIntra_carr"er_L)B_2er"&%C and repeat above steps ! to <.
The cell load is defined in terms of /o1nlin9 total transmit po1er of the cell. The periodic N'A)
Transmitted &arrier )o1er is the onl3 measurement used b3 the intra"freJuenc3 load balance algorithm
Bcell breathingC. The measurement is reported from Node ' Bafter appl3ing the corresponding filtering,
Meas-ilter&oefC and averaged 1ithin RN& B0d'-ilter7in0enC. The report periodicit3 is set using the
parameter TenMsec-or/0KMin-or/0 according to the status of the flag &hoiceRptUnit-or/0.
The feature can be controlled b3 ,DM Bactivated or deactivatedC and it is configured on a per cell basis
BN'M%1itchT.NTRAG-R*6U*N&(G0/'C.
The pilot po1er is modified b3 a fiAed step size B)&).&5)o1er)aceC 1hich is also ,DM configurable.
'oth he maAimum and minimum pilot po1er BMin)&).&5)o1er, MaA)&).&5)o1erC should
guarantee the necessar3 coverage.
Upon changing &).&5 po1er, the Node ' 1ill re"compute all common channel po1ers B)%&5, %%&5,
)&&)&5, %&&)&5, A.&5, ).&5C and dedicated channel MaA )o1er )er &ode and Min )o1er )er
&ode values. -ollo1ing a pilot po1er change, the RN& also modif3 the information element containing
&).&5 po1er 1hich is broadcast on '&5.
The commands for configuring the &ell 'reathing algorithm parameters are as follo1s. The related
database parameters are documented in a separate spreadsheet, the ?Reference )arameters
%preadsheet@.
%*T &*000/' Add cell"oriented 0oad 'alance B0/'C algorithm parameters.
%*T 0/M %et the 0oad Monitor B0/MC algorithm parameters of RN&.
A// )&).&5 Add the )rimar3 &ommon )ilot &hannel B)&).&5C
information to a cell.
M,/ )&).&5)7R Modif3 the po1er information of a )&).&5.
%*T 0/&)*R.,/ %et RN&"oriented load control B0/&C algorithm c3cle length.
A// &*00A0G,%7.T&5 Add the algorithm s1itch to a cell.
M,/ &*00A0G,%7.T&5 Modif3 the algorithm s1itch to a cell.
Motorola &onfidential )roprietar3 !=3
J&I Description Units
E$enL&a%Ma#n"tu%e *ven load magnitude indicator
E$enL&a%Ma#n"tu%e A TCP_Ce!! H m"n
9TCP_ne"#h&urCe!!s_"1 each
L%cIntra,re?L%Per"&%T"merLe4
7hereL
TCP_Ce!! is the average of the T&)
measurements reports for the cell received over
L%cIntra,re?L%Per"&%T"merLe period. This
value is the _ of the maA transmit po1er for that
cell.
TCP_ne"#h&urCe!!s_" is the of the T&)
measurements reports for the same freJuenc3
neighboring cell ?i@ received over
value is the _ of the maA transmit po1er for
neighbor cell i.
None B_
of the
maA
transmit
po1erC
L&a%_Ba!ance_Metr"c *venl3 balanced amongst a given cell and its
neighbours indicator
0oadG'alanceGMetric T MaABT&)G&ell,
MaABT&)GT&)GNeighbour&ellsGiCC "
MinBT&)G&ell,
MinBT&)GT&)GNeighbour&ellsGiCC
each L%cIntra,re?L%Per"&%T"merLe4
7hereL
TCP_Ce!! is the average of the T&)
measurements reports for the cell received over
value is the _ of the maA transmit po1er for that
cell.
TCP_ne"#h&urCe!!s_" is the of the T&)
measurements reports for the same freJuenc3
neighboring cell ?i@ received over
value is the _ of the maA transmit po1er for
neighbor cell i.
None B_
of the
maA
transmit
po1erC
Motorola &onfidential )roprietar3 !==
O$errunL&a%A%0ust"n#Per"&% ,verrun load adOusting period indicatorL
O$errunL&a%A%0ust"n#Per"&% A
9TCP_re2&rt_I_(&r_N&_O$errunL&a% H
TCP_re2&rt_I_(&r_("rst_O$errrunL&a%1 [
TenMsec,&r)LKM"n,&r)L
7hereL
TCP_re2&rt_I_(&r_N&_O$errunL&a% is the Z of
the T&) measurements report indicating that the
cell load is no1 under the ,verrun0oad threshold.
TCP_re2&rt_I_(&r_("rst_O$errrunL&a% is the Z
of the T&) measurements report indicating that
the cell load is starting to be higher than the
,verrun0oad threshold B&ell 'reathing algo starts
to reduce the &).&5 po1erC
ms or
minutes
'n%errunL&a%A%0ust"n#Per"&% Underrun load adOusting period indicator
Underrun-oadAdVusting&eriod T
BT#&MreportMEM$orMNoMUnderrun-oad N
T#&MreportMEM$orM$irstMUnderrun-oadC [
Ten'sec/orD-B'in/orD-
7hereL
T#&MreportMEM$orMNoMUnderrun-oad is the Z
the cell load is no1 over the Underrun0oad
threshold.
T#&MreportMEM$orM$irstMUnderrun-oad is the Z
the cell load is starting to be lo1er than the
Underrun0oad threshold B&ell 'reathing algo
starts to increase the &).&5 po1erC.
ms or
minutes
Motorola &onfidential )roprietar3 !=$
+2)2 Optimization Guideines
+2)2)%E>pected J&I ;aues
J&I E>pected J&I
Vaues
#omments
E$enL&a%Ma#n"tu%e ! /ependant on 0oad thresholdsL
Ce!!O$errunTh%, Ce!!'n%errunTh%, &).&5
parametersL Ma.PCPICHP&/er,
M"nPCPICHP&/er, PCPICHP&/erPace
and on the number and load status of
neighbouring cells
Testing %cenario could consist ofL
! cells Bserving and neighbourC. &ells 1ith
different loads BQ!_C. &ell 'reathing enable in
serving &ell. &ell 'reathing settings as
recommended above Brecommended parameters
tableC
L&a%_Ba!ance_Metr"c ! /ependant on 0oad thresholdsL
Ce!!O$errunTh%, Ce!!'n%errunTh%, &).&5
parametersL Ma.PCPICHP&/er,
M"nPCPICHP&/er, PCPICHP&/erPace
and on the number and load status of
neighbouring cells
! cells Bserving and neighbourC. &ells 1ith
different loads BQ!_C. &ell 'reathing enable in
serving &ell. &ell 'reathing settings as
recommended above Brecommended parameters
tableC
O$errunL&a%A%0ust"n#Per"&% ! minutes /ependant on 0dc.ntra-reJ0db)eriodTimer0en
and )&).&5)o1er)ace.
! cells Bserving and neighbourC. %erving cell in
,verrun0oad and neighbour cell in
Underrun0oad. &ell 'reathing enable in serving
&ell. &ell 'reathing settings as recommended
Motorola &onfidential )roprietar3 !=<
above Brecommended parameters tableC
'n%errunL&a%A%0ust"n#Per"&
%
! minutes /ependent on )&).&5)o1er)ace and
0dc.ntra-reJ0db)eriodTimer0en.
! cells Bserving and neighbourC. %erving cell in
Underrun0oad and neighbour cell in
,verrun0oad. &ell 'reathing enable in serving
&ell. &ell 'reathing settings as recommended
above Brecommended parameters tableC
+2)2)+Sensiti;ity Anaysis
No simulation results available 3et.
Note that &).&5)o1er variation range BMa.PCPICHP&/er N M"nPCPICHP&/er1 is not ver3
significant Bonl3 3 d', similar to the %5, gainC so no great impact on evenl3 load distribution is reall3
eApected.
Motorola &onfidential )roprietar3 !=>
+4&otentia User #ontro
+4)% Agorit"m o;er;ie=
+4)%)%Description
!$.4.4.4 &U# Description in USR+
A cell 1ith lo1er load is selected b3 modif3ing the cell reselection information bet1een freJuencies in
the s3stem information bloc9s B%.'sC to ma9e users initiate calls in the cell 1ith lo1er load as far as
possible and the load distribution of cells more even.
The cell load is defined in terms of /o1nlin9 total transmit po1er of the cell Bthe N'A) Transmitted
&arrier )o1er is the onl3 measurement used b3 the )U& algorithm to estimate the cell load.C. The
measurement is periodicall3 reported from Node ' Bafter appl3ing the corresponding filtering,
Meas,"!terC&e(C and averaged 1ithin RN& BP'C,"!terB"nLenC. The report periodicit3 is set using the
parameter TenMsec-or/0KMin-or/0 according to the status of the flag &hoiceRptUnit-or/0.
An U* normall3 camps on the cell 1ith strongest pilot. 5o1ever this is al1a3s not desirable, for
eAample if the net1or9 load is not evenl3 distributed. .f a neighbour cell 1ith strongest pilot is heavil3
loaded, then )U& conducts the U* to either sta3 1ith the lightl3 loaded serving cell or perform
reselection to a neighbour cell Banother freJuenc3C that is lightl3 loaded. %imilarl3, if the serving cell is
offering good po1er but is heavil3 loaded, then under )U& an U* is addressed to perform reselection to
a neighbour cell 1ith lesser load.
An U* get ?cell reselection information@ from the ?s3stem information bloc9 messages@ B%.'3K%.'44C
broadcasted in the cell. The U* considers %intersearch value for deciding to start measuring ne1 cells
Bne1 freJuenciesC and it uses 6offset4 Bcorresponding to &).&5"R%&) Received %ignal &ode )o1erC
and 6offset! Bcorresponding to &).&5 *cKNo, &hip energ3Ktotal noise po1er densit3 levelC to ma9e
reselection decision. %intersearch is an optional parameter in %.'3. .ts values range from "3! to ! d'
in increments of !. All negative values are considered to be b3 the U*. 6offset4 and 6offset! are
mandator3 parameters in %.'44. The3 range from "$ to $ d'.
RN& upon determining the load level of cells Bserving and neighboursC updates %intersearch, 6offset4
and 6offset!. Then, these ?cell selection information@ is broadcasted in %.'3K%.'44 if there are changes
from the previous broadcast.
The U%R! algo provides more fleAibilit3 as no1 parameters are no1 configurable per cell instead of
RN&. /epending upon the environments cells are supposed to cover Burban, MC parameters to
configure for cell should be different. .t also tries to avoid the ping"pong effect including t1o load
thresholds BS2ucL"#ht and S2ucHea$-C instead of one. -inall3, it includes three states instead of t1o.
That allo1s classif3ing the cells better from load perspective.
Motorola &onfidential )roprietar3 !=;
RN& receives the current D- Transmitted #arrier &o=er for all the cells Bperiodic N'A)
Transmitted &arrier )o1er measurement report from the Node 'C and stores them.
RN& chec9s )U& load levels for serving Bcore cellC and neighbour cells. .t compares the cell
transmitted po1er 1ith )U& load level threshol$s and hysteresis to decide if the cell should be
mar9ed as 5*A:(, N,RMA0 or 0.G5T. The decision of cell load level is performed as described
belo1L
o .f the original cell load level is N,RMA0L
.f )Bcarrier transmit po1erC X %pucGheav3 V 5, assign load level to 5*A:(
.f ) \ %pucGlight " 5 , assign load level to 0.G5T
,ther conditions, leave load level unchanged
o .f the original cell load level is 5*A:(L
.f ) Q %pucGheav3 " 5, leave load level unchanged
.f ) \ %puc light N 5 assign load level to 0.G5T
,ther conditions, assign load level to N,RMA0
o .f the original cell load level is 0.G5TL
.f ) X %pucGheav3 V 5, assign load level to 5*A:(
.f ) W %puc light V 5, leave load level unchanged
,ther conditions, assign load level to N,RMA0.
This information is then used to compute the three parameters %2intersearch, 62offset4 and
62offset! using the values of %intersearch, 6offset4 and 6offset! provisioned in the database and
the offset values B,ff%inter0ight, ,ff%inter5eav3, ,ff6offset40ight, ,ff6offset!0ight,
,ff6offset45eav3, ,ff6offset!5eav3C. The follo1ing table sho1s ho1 these Juantities are
computed
Motorola &onfidential )roprietar3 !=+
-oad e;e 7Neig"bour ce8 -IG!T 7Neig"bour ce8
NOR'A-
7Neig"bour ce8 !EAV.
B&ore cellC
0.G5T
%cintersearch T %intersearch
V ,ff%interGlight
6coffset4 T 6offset4
6coffset! T 6offset!
V ,ff%interGlight
V ,ff%interGlight
6coffset4 T 6offset4 V
,ff6offset4Gheav3
6coffset! T 6offset! V
,ff6offset!Gheav3
B&ore cellC
N,RMA0
,ff6offset4Gheav3
,ff6offset!Gheav3
B&ore cellC
5*A:(
V ,ff%interGheav3
,ff6offset4Glight
,ff6offset4Glight
V,ff%interGheav3
,ff6offset4Glight
,ff6offset4Glight
V ,ff%interGheav3
.f some parameters have changed, update .* %.'3 D %.'44 1ith ne1 %intersearch, 6offset4 and
6offset! and schedule a ne1 %3stem .nfo 'roadcast message
7ait for a given ?1aiting period@ 9L%cPucPer"&%T"merLenC and repeat above steps B! to =C
The maAimum number of inter"freJuenc3 neighbour cells is 3!. The feature can be controlled b3 ,DM
Bactivated or deactivatedC and the s1itch is configured on a per cell basis BN'M%1itch T )U&C. MM0
commands for )U& algorithm areL A//KM,/ &*00)U&, A//KM,/ &*00A0G,%7.T&5, %*T
0/M, %*T 0/&)*R.,/.
.f )U& algorithm is s1itched off, parameters B%intersearch, 6offset4, 6offset!C in %.'3K%.'44 should
be restored to the values in database.
!$.4.4.! &U# Description in USR3
.n U%R3, the )U& is still used b3 RN& to manage traffic load amongst overlaid cells 1ith different
carrier freJuencies. 5ere the load can be either Transmitted &arrier )o1er BR++ T&)C or Transmitted
&arrier )o1er of all codes not used for 5%")/%&5 or 5%"%&&5 transmission B5%/)A T&)C.
Transmitted carrier po1er, denoted in percentage, represents the ratio bet1een the total transmitted
po1er on one /0 carrier from one UTRAN access point, compared to the maAimum po1er possible to
use on that /0 carrier. Transmitted carrier po1er of all codes not used for 5%")/%&5 or 5%"%&&5
transmission, denoted in percentage, is the ratio bet1een the total transmitted po1er of all codes not
used for 5%")/%&5 or 5%"%&&5 transmission on one /0 carrier from one UTRAN access point,
compared to the maAimum po1er not used for 5%")/%&5 and 5%"%&&5 on that /0 carrier. RN&
controls the selection bet1een 5%/)A T&) and Rel"++ T&) measurement reporting on a per cell basis
as follo1sL
.f the cell supports 5%/)A and it is enabled during cell setup, RN& triggers 5%/)A T&)
measurement reporting. .f the 5%/)A is later disabled during the cell operation, RN&
terminates an3 5%/)A T&) measurement reporting and triggers Rel"++ T&) measurement
reporting.
.f the cell does not support 5%/)A or it is disabled during cell setup, RN& triggers Rel"++ T&)
measurement reporting. .f the 5%/)A is later enabled during the cell operation, RN&
terminates an3 Rel"++ T&) measurement reporting and triggers 5%/)A T&) measurement
reporting.
'esides Node ' can support to measure either the R++ T&) or the 5%/)A T&) in U%R3, the )U&
algorithm almost have no changes compared 1ith U%R!. Note in U%R3, some parameters or command
use the ne1 names instead of the names in U%R!, but the meaning and the usage have no changes. The
changes includeL
The )U& timer period is set b3 the 0MT command %*T 0/&)*R.,/ instead of %*T
&*RRMT.M*R.
Sintersearch range from "! to ! d' in increments of !. !offset= and !offset> range from "!
to ! d'. B.n U%R!, Sintersearch range from "3! to ! d' in increments of !. !offset= and
!offset> range from "$ to $ d'.C
The latest 0MT commands and related parameters are listed in a separate spreadsheet, the ?Reference
)arameters %preadsheet@.
Note that the )U& parameters are normall3 for the U*s in .dle mode. 5o1ever, since %.'= and %.'4!
are not supported in Taurus :4.$, the U*s in &ellG-A&5 mode use the same parameters as those in .dle
mode for cell reselection. .f the )U& algorithm is s1itched off, the parameters %intersearch, 6offset4,
6offset! broadcast in %.'3 and %.'44 should be restored to the default values in database.
+4)%)+Dependencies
There are no 9no1n dependencies 1ith other algorithms.
The commands for configuration of the parameters involved the )otential User &ontrol algorithm are
follo1ing. The related database parameters are documented in a separate spreadsheet, the ?Reference
Motorola &onfidential )roprietar3 !$4
A// &*00)U& Add cell"oriented )otential User &ontrol B)U&C algorithm
parameters.
M,/ &*00)U& Modif3 cell"oriented )otential User &ontrol B)U&C algorithm
parameters.
A// &*00A0G,%7.T&5 Add &ell Algorithm %1itches Binc. )U&C
M,/ &*00A0G,%7.T&5 Modif3 &ell Algorithm %1itches Binc. )U&C
%*T 0/&)*R.,/ %et RN&"oriented load control B0/&C algorithm c3cle length.
%*T 0/M %et the 0oad Monitor B0/MC algorithm parameters of RN&
A// &*00%*0R*%*0 Add cell selection and reselection information Bconfigure the
initial default value for %intersearchC
A// .NTRA-R*6N&*00,
A// .NT*R-R*6N&*00,
A// G%MN&*00
/efine the cell reselection parameters of neighbour cells
Bintra"freJ, inter"freJ, inter"RAT neighboursC such as the
6offset parameters
J&I Descriptions Units
E$enL&a%Ma#n"tu%e *ven load magnitude indicator
E$enL&a%Ma#n"tu%e A TCP_ser$Ce!! H m"n
9TCP_ne"#h&urCe!!s_"1 each L%cPucPer"&%T"merLe4
7hereL
TCP_ser$Ce!! is the average of the T&) measurements
reports for the serving cell received over
L%cPucPer"&%T"merLe period. This value is the _ of the
maA transmit po1er for %erv&ell.
TCP_ne"#h&urCe!!s_" is the of the T&) measurements
reports for the neighboring cell ?i@ received over
L%cPucPer"&%T"merLe period. This value is the _ of the
maA transmit po1er for neighbour cell i.
None B_ of the
maA transmit
po1erC
E$enL&a%A%0ust"n#Per"&%
_,r&m_Hea$-
*ven load adOusting period time from 5eav3 status
indicator
E$enL&a%A%0ust"n#Per"&%_,r&m_Hea$- 1
ms or minutes
Motorola &onfidential )roprietar3 !$!
(TCP_ser$Ce!!_re2&rt_I_N&_Hea$- ?
TCP_ser$Ce!!_re2&rt_I_Hea$-_2r"&r_SIB_u2%ates ) R
TenMsec,&r)L*M"n,&r)L
7hereL
TCP_ser$Ce!!_re2&rt_I_N&_Hea$- is the T&) report
indicating that the serving cell is not in 5eav3 state
an3more Bne1 state could be N,RMA0 or 0.G5TC.
TCP_ser$Ce!!_re2&rt_I_Hea$-_2r"&r_SIB_u2%ates is
the T&) report indicating that the serving cell is in
5*A:( state prior to algo eAecution and %.' updates.
_,r&m_L"#ht
*ven load adOusting period time from 0ight status
indicator
E$enL&a%A%0ust"n#Per"&%_,r&m_L"#ht T
9TCP_ser$Ce!!_re2&rt_I_N&_L"#ht H
TCP_ser$Ce!!_re2&rt_I_L"#ht_2r"&r_t&_SIB_u2%ates1 [
TenMsec,&r)LKM"n,&r)L
7hereL
TCP_ser$Ce!!_re2&rt_I_N&_L"#ht is the T&) report
indicating that the serving cell is not in 0ight state
an3more Bne1 state should be N,RMA0 or 5*A:(C.
TCP_ser$Ce!!_re2&rt_I_L"#ht_2r"&r_SIB_u2%ates is
the T&) report indicating that the serving cell is in 0.G5T
state prior to algo eAecution and %.' updates
ms or minutes
_,r&m_N&rma!
E$enL&a%A%0ust"n#Per"&%_,r&m_N&rma! A
9TCP_ser$Ce!!_re2&rt_I_N&_N&rma! H
TCP_ser$Ce!!_re2&rt_I_N&rma!_2r"&r_t&_SIB_u2%ates
1 J TenMsec,&r)L*M"n,&r)L
7hereL
TCP_ser$Ce!!_re2&rt_I_N&_N&rma! is the T&) report
indicating that the serving cell is not in Normal state
an3more Bne1 could be 0.G5T or 5*A:(C.
TCP_ser$Ce!!_re2&rt_I_N&rma!_2r"&r_SIB_u2%ates is
the T&) report indicating that
ms or minutes
+4)2 Optimization guideines
Motorola &onfidential )roprietar3 !$3
+4)2)%&arameters and recommendation
The parameters and recommendation are documented in a separate spreadsheet, the ?Reference
+4)2)+E>pected J&I ;aues
J&I E>pected J&I
Vaues
#omments
E$enL&a%Ma#n"tu%e ! /ependant on %puc0ight, %puc5eav3,
%puc53st thresholds and on the number and
load status of neighbouring cells
3 cells Bserving and ! neighboursC. &ells in
different states BN,RMA0, 0.G5T,
5*A:(C. )U& enable onl3 in serving &ell.
)U& settings as recommended above
Brecommended parameters tableC
E$enL&a%A%0ust"n#Per"&%_
,r&m_Hea$-
! minutes /ependant on .ntersearch and 6offset4K!
offsets values.
! cells Bserving and neighboursC. &ells in
E$enL&a%A%0ust"n#Per"&%_
,r&m_L"#ht
! minutes /ependant on .ntersearch and 6offset4K!
offsets values.
E$enL&a%A%0ust"n#Per"&%_ ! minutes /ependant on .ntersearch and 6offset4K!
Motorola &onfidential )roprietar3 !$=
,r&m_N&rma! offsets values.
!$.=.!.4 Sensiti;ity anaysis
This section gives some results Bfrom anal3sis or simulation or lab testing or the fieldC on the sensitivit3
of the s3stem performance 1ith respect to the parameters of the algorithm. ,bviousl3 the main E).s
listed in section above can be used as the main metrics.
Motorola &onfidential )roprietar3 !$$
+6'isceaneous Topics
+6)% Introduction
This chapter of the optimization guide describes some miscellaneous topics 1hich do not particularl3 fit
1ell into the other chapters. The chapter consists of the follo1ing sectionsL
Random Access, in 1hich the RA&5 access procedure is describedP used 1henever a U*
needs to access net1or9 services and initiate uplin9 transmissionsP
0ocation %ervices, in 1hich the net1or9"assisted positioning services are describedP it
includes &ell ./ and Assisted G)% BA"G)%C positioning methodsP
ATM &onnection Admission &ontrol BATM &A&C, used 1hen deciding decide 1hether a
ne1 ATM or AA0! connection can be accepted meeting its 6o% reJuirements 1hilst still
maintaining the 6o% of the alread3 established connections and if so 1hat resources should
be allocatedP
RN& overload mechanisms, used to manage non"radio related congestion and overload of
the signalling and user plane in the RN& Bas per feature -R!<3<3C.
Motorola &onfidential )roprietar3 !$<
+5Random Access &rocedure
+5)% Random Access Agorit"m
7henever U* needs to access net1or9 service and initiate uplin9 transmission it must eAecute the
random access procedure using U0 common transport channel.
The random"access transmission is based on a %lotted A0,5A approach 1ith fast acJuisition indication
carried through A.&5 /0 channel. The procedure consists of transmission at randoml3 selected moment
of the time, one or more preambles in the available uplin9 access slots until net1or9 grants access to
channel for sending message part. The open po1er control loop is used for that message part
transmission.
The follo1ing subsections provide concept overvie1 of the ph3sical transport main and it describes the
most relevant aspects regarding the U* RA&5 access procedure.
The random access procedure ta9es place in R0&KMA& and )5( la3ers of the U* and is controlled b3
UTRAN through RR& signalling.
UTRAN can prioritise the )RA&5 usage b3 assigning the Access %ervice &lasses BA%&sC to U*s
reJuesting for service access. This is done through different )RA&5 resources allocation i.e. channel
and scrambling codes, U0 slots and random access probabilities assessment for each A%&.
There are ; possible Access %ervice &lasses numbered form to >. UTRAN selects the A%& 1ithin the
allo1ed A%& set based on ,M& provisioned AccessSer$"ceC!ass parameter value. .t is allo1ed that
more than one A%& is assigned to the same )RA&5 resource.
+5)%)%Agorit"m O;er;ie=
!>.4.4.4 &RA#! Transmission Resources
The )RA&5 transmission structure consists of one or several preambles and a message part. The
preamble channelization code of length 4< is generated based on the allocated preamble signature,
1hich also depends on Access %ervice &lasses " value assignment.
-or a given Access &lass the use of preamble signatures is limited b3 range given b3 provisionable
parameters A$a"!a!es"#natureStartIn%e. and A$a"!a!es"#natureEn%In%e.4
B.ssueL 7hat is algorithm preamble signature selection for given A%&^C
The )RA&5 resources consist of access timeslots and preamble signatures. Those resources are
classified into several access service classes BA%&C to ensure providing random access 1ith different
priorities.
,ne or all A%&s might be allocated to the same access timeslots or preamble signatures. The A%&
Motorola &onfidential )roprietar3 !$>
defines the partition of certain )RA&5 resources 1ith associated Baccess probabilit3C )
i
The A%& is numbered 1ithin the range from to >. The A%&T has highest priorit3 and A%&T>
indicated the lo1est priorit3.
The scrambling code selection for )RA&5 transmission is evaluated upon ,M& provisioned value of
ScramC&%eNum parameter.
.t is also 1orth to note that message part scrambling code is directl3 derived from the preamble
scrambling code `T% !$.!43a.
UTRAN sets random"access message part structure of radio frame based on provisioned from ,M&
number of available slot format for random access procedure T&ta!S!&t,&rmat and direct indication of
slot format given b3 S!&t,&rmat1 S!&t,&rmat<, S!&t,&rmat:, and S!&t,&rmat+ parameter value,
1hich specifies the follo1ing itemsL
&hannel bit and s3mbol rate
%preading factor of channelization code
Number of bits in the timeslot
Number of bits in radio frame
Number of user data in the slot

Z Z4 Z! Z3 Z= Z$ Z< Z> Z; Z+ Z4 Z44 Z4! Z43 Z4=
$4! chips
radio frameL 4 ms radio frameL 4 ms
Access slot
Random Access Transmission
Message part )reamble
4 ms or ! ms Bone or t1o radio frameC
)reamble )reamble
=+< chips
-igure !>"!$ Random Access Transmission
The U* transmits the preamble in the beginning of time intervals called access slot. There are 4$ access
slots per ever3 ! radio frames. *ach of them occupies a time interval of $4! chips. Access slots are
grouped into 4! sub"channels ho1ever consecutive slots belong to the different sub"channel.
Motorola &onfidential )roprietar3 !$;
The classification of access slots into sub"channels is calculated based on broadcasted selection of
RA&5 sub"channels numbers RACHSuChNum and available number of subchannels in Access
%ervices &lasses identified b3 parameter A$a"!a!eSuchanne!Numer `T% !$.!4=a.
B.ssueL 7hat is assignment algorithm of A%& 1ith RA&5 subchannel^C
An eAample of relationship bet1een A%& and subchannels is sho1 in the -igure !> "!<.
a;aiabe preambe signatures BmaA 4<C
a;aiabe
subc"annes
BmaA 4!C
&RA#! partitions
Bone partition per A%&,
maA. ; per )RA&5C
A%& A%& 4 A%& ! A%& A%& 4 A%& !
&RA#!
BmaA 4< per cellC
)RA&5 )RA&5 4
RA#!
BmaA 4< per cellC
RA&5 RA&5 4
&reambe scrambing code
BmaA 4< per cellC
)reamble
scrambling
code
)reamble
scrambling
code 4
:
%4
:
%%
:
%4
:
%%
A%& 3 A%& A%& 4 A%& !
)RA&5 !
RA&5 !
)reamble
scrambling
code !
:
9
:
%%
A%& A%& 4
)RA&5 3
RA&5 3
)reamble
scrambling
code !
%: %4
:
%%
)artition not available
on )RA&5 !
)artition not available
on )RA&5 3
&oding &oding &oding &oding
-igure !>"!< *Aample of RA&5K)RA&5 configuration
!>.4.4.! &ersistence
U* transmission of random"access information occurs 1ith certain probabilit3 characterized b3
persistence parameter )
i
.
*ach time the U* 1ants to transmit a transport bloc9 to the ph3sical la3er it generates a random
number bet1een and 4 of the uniform distribution. .f this number is lo1er then )
i
value, the U* ma3
start the random"access preamble transmission.
The persistence scaling factor provisioned b3 Pers"stSca!"n#,act&r onl3 Access %ervice &lass from
A%&! to A%&>.
-or A%&
the persistence value )
has al1a3s value of 4 regardless of persistence. The U* has al1a3s

granted permission to start random"access preamble transmission since this probabilit3 is eJual to 4.
-or A%&
4
the persistence scaling factor has al1a3s value of 4.
!>.4.4.3 AS# Seection
@3 in RRC .$le Mo$e
All U*s are members of one out of ten randoml3 allocated mobile populations, defined as Access
&lasses to +. The population number is stored in the %.MKU%.M. .n addition, mobiles ma3 be
members of one or more out of $ special categories BAccess &lasses 44 to 4$C, also held in the
%.MKU%.M. These are allocated to specific high priorit3 users as follo1s. BThe enumeration is not
meant as a priorit3 seJuenceCL
&lass 4$ )0MN %taffP
&lass 4= *mergenc3 %ervicesP
Motorola &onfidential )roprietar3 !$+
&lass 43 )ublic Utilities Be.g. 1aterKgas suppliersCP
&lass 4! %ecurit3 %ervicesP
&lass 44 -or )0MN Use.
.f the U* is a member of at least one Access &lass, 1hich corresponds to the permitted classes as
signalled over the air interface, and the Access &lass is applicable in the serving net1or9, access
attempts are allo1ed. ,ther1ise access attempts are not allo1ed.
Access &lasses are applicable as follo1sL
&lasses " + 5ome and :isited )0MNsP
&lasses 44 and 4$ 5ome )0MN onl3P
&lasses 4!, 43, 4= 5ome )0MN and visited )0MNs of home countr3 onl3.
An3 number of these classes ma3 be barred at an3 one time.
An additional control bit 9no1n as UAccess &lass 4U is also signalled over the air interface to the U*.
This indicates 1hether or not net1or9 access for *mergenc3 &alls is allo1ed for U*s 1ith access
classes to + or 1ithout an .M%.. -or U*s 1ith access classes 44 to 4$, *mergenc3 &alls are not
allo1ed if both UAccess class 4U and the relevant Access &lass B44 to 4$C are barred. ,ther1ise,
*mergenc3 &alls are allo1ed. `T% !!.44, =.!a.

All *mergenc3 &alls use A%&
, and all A&s being in the range from to + are mapped to A%&
4
.
B)arameter AcFKT&Asc is set to 4C.

The A&4 to A&4$ are in turn mapped to A%&
i
, 1here iT!,M,> respectivel3.
Mapping function is specified b3 fiAed assignment A& to A%& based on ,M& provisionable parameters
encoded b3 AcFKT&Asc, Ac1FT&Asc, Ac11T&Asc, Ac1<T&Asc, Ac1:T&Asc, Ac1+T&Asc, and
Ac15T&Asc tag.
Access &lasses are onl3 be applied at initial access, i.e. 1hen sending an RR& &,NN*&T.,N
R*6U*%T message. A mapping bet1een Access &lass BA&C and Access %ervice &lass BA%&C is
indicated b3 the information element UA&"to"A%& mappingU in %3stem .nformation 'loc9 t3pe $. The
correspondence bet1een A& and A%& is indicated as follo1sL
A& " + 4 44 4! 43 4= 4$
A%& 4
st
.* !
nd
.* 3
rd
.* =
th
.* $
th
.* <
th
.* >
th
.*
.n the table, Un
th
.*U designates an A%& number i in the range " > to A&.
-or the random access, the parameters implied b3 the respective A%& must be emplo3ed. .n case the U*
is member of several A&s it should select the A%& for the highest A& number.
@3 in Connecte$ Mo$e
At radio bearer setupKreconfiguration each involved logical channel is assigned a MA& 0ogical channel
)riorit3 BM0)C in the range form 4 to ;. 7hen the MA& subla3er is configured for RA&5 transmission
in the U*, these M0) levels shall be emplo3ed for A%& selection on MA&.
The follo1ing A%& selection scheme shall be applied, 1here NumA%& is the highest available A%&
number and MinM0) the highest logical channel priorit3 assigned to one logical channelL
1hen all Transport 'loc9s in the T' set have the same M0), select A%& T minBNumA%&, M0)CP
1hen all Transport 'loc9s in the T' set have different priorit3, determine the highest priorit3 level
MinM0) and select A%& T minBNumA%&, MinM0)C.
7hen an RR& &,NN*&T.,N R*6U*%T message is sent RR& determines A%& b3 means of the
access class. `T% !$.3!4, T% !$. 334a
B.ssueL 5o1 does RN& assign M0)^C
!>.4.4.= UE 'A# Random Access &rocedure
This procedure is eAecuted 1hen the U* MA& entit3 has some data to transmit.
'asicall3 the procedure initiates the random"access preamble transmission based on the result of
)ersistence estimation described above. The algorithm bac9s off for interval of 4ms until preamble
transmission is granted again. The successful result of persistence algorithm triggers transmission of
preamble.
.f U* receives positive A. in A.&5, the MA& la3er instructs the ph3sical la3er to transmit the random"
access message part.
.f U* does not receive an3 acJuisition indicator A. the entire procedure is repeated ever3 4 ms but no
more then a certain maAimum number of times indicated b3 ,M& provisionable value of the
Pream!eRetransMa. parameter.
.f U* receives negative acJuisition indicator A. in A.&5, the MA& la3er procedure is time lagged for
sum of 4 ms and some additional number of 4ms"intervals. This additional time interval is randoml3
selected form the range confined b3 t1o ,M& provisionable parametersL
NBF1M"n
NBF1Ma.
This sub"routine is repeated no more then number of times given b3 value of Pream!eRetransMa.
parameter.
.f U*2s MA& 0a3er algorithm cannot initiate the preamble transmission, it reports the failure to the
Motorola &onfidential )roprietar3 !<4
0a3er 3 and procedure ends `T% !$.3!4a.
!>.4.4.$ UE &"ysica Random Access &rocedure
This procedure allocates and configures parameters related 1ith radio transmission of preamble and
message part of random"access information.
The transmission process begins from selection access slot and signature.
The U* chooses randoml3 the U0 access slot among the available RA&5 sub"channels and given A%&
i
,
1here iT,M,> based on values encoded into AccessSer$"ceC!ass parameters.
Then the signature selection is carried out based on available signature pool assigned to given A%& and
provisioned b3 ,M& configurable parameter values encoded into Pream!eS"#natures tags.
`T%!$.!4=a
U* estimates the initial preamble transmission po1er level assuming identical value of path loss in both
U0 and /0 direction.
)reamble transmission initial po1er setting is eAplained in )o1er &ontrol &hapter.
.f Node ' detects and successfull3 decodes preamble transmission it sends an AcJuisition .ndicator
using A.&5.
.f U* neither receives nor decodes AcJuisition .ndicator in the follo1ing preamble transmission /0 slot
on A.&5, it repeats preamble retransmission up to certain, maAimum number of times defined b3 ,M&
provisionable parameter Pream!eRetransMa..
The preamble transition po1er level is incremented for ever3 neAt retransmission b3 ramp step value
specified b3 ,M& provisionable parameter P&/erRam2Ste2.
.f U* preamble transmission po1er eAceeds the maAimum allo1ed po1er b3 < d' the U* eAits ph3sical
random access procedure `T% !$.!4=a Bsee the ?Uplin9 ,pen )o1er &ontrol 0oop@ sectionC.
.f no AcJuisition .ndicator is decoded after maAimum number of preamble retransmissions, U* repeats
entire procedure no more than Mma. times and then it eAits procedure passing a 0a3er 4 status ?no
A&E on A.&5@ to MA& sub"la3er if no ac9no1ledgement is received during that time.
.f U* decodes negative AcJuisition .ndicator it eAits ph3sical random access procedure, passing a 0a3er
4 status ?Nac9 on A.&5 received@ to MA& sub la3er.
.f U* decodes positive AcJuisition .ndicator then it initiates transmission of the message part. The
transmission of random access massage starts after the defined number of uplin9 access slots of the last
transmitted preamble. The deferral number of access slots is specified b3 ,M& provisionable parameter
AICHT.T"m"n# according to the follo1ing ruleL
.f AICHT.T"m"n# T then message transmission starts after 3 access slots,
.f AICHT.T"m"n# T 4 then message transmission starts after = access slots.
Motorola &onfidential )roprietar3 !<!
+5)%)+Database parameters
Tag ?3G))@ stand for ?%tandard 3G)) parameter@ and label Motorola stands for ?Motorola
implementation specific parameter@.
Ph-ChI%
UniJue ph3sical channel identifier in
the cell.
Motorola
A// )RA&5A%&
AccessSer$"ceC!ass
A%& identifier
3G))
A// )RA&5A%&
A$a"!a!es"#natureStartIn%e.
.dentifies the available signature
starting indeA of an A%&
Motorola
A// )RA&5A%&
A$a"!a!es"#natureEn%In%e.
.dentifies the available signature
ending indeA of an A%&
Motorola
A// )RA&5A%&
ScramC&%eNum
)reamble scrambling code used b3
this )RA&5 preamble part
3G))
A//
)RA&5'A%.&
PrachS!&t,&rmatNum
The number of )RA&5 slot formats
available
3G))
A//
)RA&5%0,T-,R
MAT
S!&t,&rmat9"1 )RA&5 timeslot formats available,
1here iT4,M,=
3G))
A//
)RA&5%0,T-,R
MAT
RACHSuChNum %eJuence number of the available
sub"channels. The multiple choice is
all the 4! sub channels Bfrom sub"
channel to 44C
3G))
A//
)RA&5'A%.&
A$a"!a!eSuchanne!Numer
The available number of A%&
subchannels.
Motorola
A// )RA&5A%&
Pers"stSca!"n#,act&r
-actor used to calculate the
corresponding d3namic persist value
for A%&!"A%&>
Motorola
A// )RA&5A%&
AcFKT&Asc
/efines the mapping relation
bet1een A& g+ and the A%&
Motorola
A//
)RA&5A&T,A%&
MA)
Ac1FT&Asc
bet1een A& 4 and the A%&
Motorola
A//
)RA&5A&T,A%&
MA)
Motorola &onfidential )roprietar3 !<3
Ac11T&Asc
Motorola
A//
)RA&5A&T,A%&
MA)
Ac1<T&Asc
bet1een A& 4! and the A%&
Motorola
A//
)RA&5A&T,A%&
MA)
Ac1:T&Asc,
Motorola
A//
)RA&5A&T,A%&
MA)
Ac1+T&Asc
bet1een A& 4= and the A%&
Motorola
A//
)RA&5A&T,A%&
MA)
Ac15T&Asc
bet1een A& 4$ and the A%&
Motorola
A//
)RA&5A&T,A%&
MA)
Pream!eRetransMa.
MaAimum number of preambles
transmitted in a preamble ramping
c3cle.
3G))
A//
)RA&5'A%.&
NBF1M"n
0o1er limit of the random bac9"off
dela3
3G))
A// RA&5
NBF1Ma.
Upper limit of the random bac9"off
dela3
3G))
A// RA&5
Pream!eS"#natures
%eJuence number of the available
preamble signatures.
The ?multiple choice@ indicates that
all the 4< signatures are available.
Motorola
A//
)RA&5'A%.&
Mma.
MaAimum number of random access
preamble ramping c3cles
3G))
A// RA&5
AICHT.T"m"n#
The timeslot offset bet1een the
access preamble of the )RA&5 and
A.&5
3G))
A// A.&5
P&/erO((setP2m
)o1er offset bet1een the preamble
and the message part of the )RA&5
3G))
A// )RA&5T-&
Ma.A!!&/e%'!T.P&/er
MaAimum allo1ed po1er U*
transmitted on RA&5.
3G))
A//
&*00%*0R*%*0
Motorola &onfidential )roprietar3 !<=
Ga"n,act&rBetaC U0 /)&&5 gain set up
3G))
A// )RA&5T-&
Ga"n,act&rBeta) U0 /)/&5 gain set up
3G))
A// )RA&5T-&
+5)%)3Jey &er$ormance Indicators
J&I Description
&RA#! 'essage
Detection Success Ratio
)ercentage of successfull3 detected )RA&5 messages to the total number of
transmitted )RA&5 messages b3 the U*.
&RA#! 'essage
transmission Deay
Average and +$_ percentile of time dela3 samples measured from the time
the first )RA&5 preamble is sent until the RA&5 message part is
successfull3 transmitted b3 the U* B.ndicator of dela3 introduced b3 the 04
)RA&5 po1er ramping procedureC.
&reambe Detection
Success Ratio
)ercentage of the successfull3 detected )RA&5 preambles and the total
number of transmitted )RA&5 preambles.
RA#! 'essage T>
&o=er
Average po1er level for the RA&5 messages transmission measured at the
output of the U* T8 antenna.
+5)%)2Optimization Guideines
!>.4.=.4 &arameters and Recommendation
-or the latest parameters recommendation, see the Reference )arameters %preadsheet. Material from
earl3 investigation of parameter settings can be found at httpLKKcompass.mot.comKdocK4!<!$3+3K
!>.4.=.! E>pected J&I Vaue
The random access procedure 1as validated in the A5 lab testing for lo1 W4_ s3stem load, voice
AMR 4!.! 9bitKs and s3mmetric <= 9bit Ks interactiveKbac9ground services.
&RA#! 'essage Detection Success Ratio
4_
&RA#! 'essage transmission Deay
W3ms
&reambe Detection Success Ratio
4_
Note. -or further information on the po1er"related parameters of the random access procedure, see the
section on )o1er &ontrol.
Motorola &onfidential )roprietar3 !<$
+*-ocation Ser;ices
+*)% Introduction
0ocation %ervices are considered as a net1or9 provided standardized services and capabilities used for
U* positioning, that enable the provision of location"based applications in the UMT% net1or9s. The
mobile station identification together 1ith its most li9el3 positioning information ma3 be available to the
user, net1or9 operator, service provider, value added service providers and for )0MN internal
operations and applicable for i.e. emergenc3 calls, charging, monitoring and optimisation of s3stem
performance, innovative 1a3s of mobilit3 and traffic management, la1ful interception, enhanced call
routing and man3 others BT% !!.>4C.
-orm s3stem architecture perspective location services ma3 be regarded as UMT% overla3 structure,
1hich provides *!* location capabilities b3 enabling access to specific standardized services span over
both net1or9 elements " &N and UTRAN, so 0&% involves interaction amongst Uu BT% !$.334C, .ub
BT% !$.=33C, .u BT% !$.=43C, and .ur BT% !3.=!3C interfaces procedures.
Unless mobile station is full3 capable to Autonomous %elf 0ocation " needs no interaction 1ith net1or9
to estimate its position, then al1a3s net#or92assistant (CS <ositioning is concern. )articularl3,
UTRAN facilitates determination of the location of a mobile station BT% !$.3$C b3 providing to
mobiles different assistance information, 1hich either enables mobiles to calculate their o1n location in
case of @32base$ <ositioning metho$ ty<e or aid mobile station to estimate the appropriate radio
ranging measurements in case of @32assiste$ <ositioning metho$ ty<e.
The difference in positioning method t3pes classification ma3 be eAplained b3 identification of the
net1or9 element, 1hich is responsible for estimation of the U* location fiA N so called )osition
&alculation -unction B)&-C. .f )&- is implemented at the mobile and is it used to calculate the U*
position Bgeographical coordinates 1ith timestampC then s3stem provides U*"based positioning method
t3pe. ,n the other side if )&- is located at the UTRAN then U*"assisted positioning t3pe is considered.
The Motorola UTRAN supports the basic &*00 ./ and U*"based AG)% positioning methods 1ithout
specific 0&% signalling on the .ur interface.
+*)+ #e Id ocation met"od
+*)+)%Description
&ell ./ is the cell coverage based positioning method providing coarse U* location in UMT% mobile
net1or9. )articular U* location estimation is conducted b3 indication of &ell .dentit3 B&*00 ./C
mapped directl3 to geographical coordinates BT% !3.3!C associated 1ith Node ' serving cell or
assigned %ervice Area .dentifier %A. Bsee T% !$.3$ section ;C. The %ervice Area .dentifier ma3 include
Motorola &onfidential )roprietar3 !<<
one or several cells.
Unfortunatel3, in practice this positioning method is ver3 inaccurate since U* location uncertaint3 is
eApanded b3 cell R- coverage area 1hat is illustrated in the follo1ing figure.
C+LL ,D
-L.T/ L0N1
C+LL ,D
-L.T/ L0N1
C+LL ,D
-L.T/ L0N1
C+LL ,D
-L.T/ L0N1
No&e 2
No&e 2
.
.
.
-igure !;"!>L Uncertaint3 area for &ell ./ for omni and 3"sector cell site configuration
.n case of omni"directional cell site configuration, U* positioning report indicates location of the cell
site electrical centre of the site antenna s3stem. -or sectorized cell site antenna configuration, U*
positioning reports should indicate the location of the geographical centre point of the cell coverage
area. The difference bet1een assignments of cells identifiers to the different ph3sical locations 1ith
regards to Node ' antenna configuration statisticall3 minimizes positioning error bet1een real U*
position and its fiAed reported location.
7henever &ore Net1or9 &N reJuests U* location the co"located 1ith %RN& %ervice Mobile 0ocation
&enter %M0& reports %A. or geographical coordinates of serving cell depending on reJuired from &N
location report format configuration. The &N ma3 reJuest the geographical coordinates or the %A., or
both for the target U*. The 0ocation Response message includes also 0&% Jualit3 estimate regarding
achieved accurac3 Bsee T% !$.=43C.
7hen the 0ocation ReJuest is received from the &N the %M0& chec9s the state of the target U*. .f the
U* is in a state 1here the cell ./ is available the target cell ./ is chosen as the basis for the U*
)ositioning. The simplified message flo1 is sho1n in the follo1ing figure.
Motorola &onfidential )roprietar3 !<>
CN
RNC
SMLC
3+
L0C.T,0N R+P0RT
4TS 2554136
L0C.T,0N
R+P0RT,NG
C0NTR0L
4TS 2554136
Paging i7 3+ is in ,&$e or
3R.8PC) state
-igure !;"!;L 'asic message flo1 for &ell ./ 'ased Method
.n .dle Mode or URAG)&5, state 1here the cell ./ is not available, the U* is paged, so that %RN& can
establish the cell 1ith 1hich the target U* is associated.
The &N ma3 reJuest the direct or event triggered U* positioning reporting. .n the direct method a single
U* 0ocation Report follo1s the location reJuest signaled in the 0ocation Reporting &ontrol message.
The event triggered U* location report occurs 1hen &N reJuires from %RN&K%M0& reporting of U*
positioning upon so called &hange of %ervice Area B&,%AC result from moving U* among defined
%ervice Areas.
+*)+)+Database parameters
implementation specific parameter@. The graphical representation of RN& $ 0&% configuration
parameters are illustrated in the follo1ing figureL
N
Se!tor Co'erage .rea
ANTENNAORIENTATION
ANTENNAOPENING
MAXANTENNARANGE
E
90
o
S
180
o
W
270
o
-igure !;"!+L 0&% )arameters &ell &onfiguration
Motorola &onfidential )roprietar3 !<;
Ce!!I) &ell identifier.
3G))
A// %M0&&*00KM,/
%M0&&*00
Lat"tu%e)e#ree &ell geographical latitude
coordinate
Motorola
A// %M0&&*00KM,/
%M0&&*00
L&n#"tu%e)e#ree
&ell geographical longitude
coordinate BNegative number
indicates 7est 0ongitude and
positive *ast 0ongitude
Motorola
A// %M0&&*00KM,/
%M0&&*00
ALTIT')EMETER &ell antenna height. A// %M0&&*00KM,/
%M0&&*00
MA@ANTENNARANGE &ell coverage area distance.
Motorola
A// %M0&&*00KM,/
%M0&&*00
ANTENNAORIENTATION Antenna main"lobe azimuth
Motorola
A// %M0&&*00KM,/
%M0&&*00
ANTENNAOPENING Antenna main lobe 1idth
Motorola@
A// %M0&&*00KM,/
%M0&&*00
CELLA3ERAGEHEIGHT Average height of cell coverage
area.
Motorola@
A// %M0&&*00KM,/
%M0&&*00
CELLHEIGHTST)
%tandard deviation of the cell
coverage area height.
Motorola@
A// %M0&&*00KM,/
%M0&&*00
CELLEN3IRONMENT .ndicator of the most probable cell
propagation environment non"line of
sight, BTU, 5TC, line"of"sight RAC,
miAed.
Motorola
A// %M0&&*00KM,/
%M0&&*00
T@CHAN)ELA;
,T/,A related parameter N &ell
transmission channel dela3, defined
as transmission latenc3 introduced
b3 the 7'8 board of the Node '
B%ee UTRAN %-RA% 0&%C
Motorola
A// %M0&&*00KM,/
%M0&&*00
R@T@CHAN)ELA;
,T/,A related parameter N cell
transceiver channel dela3, defined as
sum of transmission and reception
latenc3 introduced b3 7'8 board
of the Node ' B%ee UTRAN
%-RA% 0&%C
Motorola
A// %M0&&*00KM,/
%M0&&*00
MASKREPEATE@IST %1itch of Node ' remote head A// %M0&&*00KM,/
%M0&&*00
Motorola &onfidential )roprietar3 !<+
Motorola
OT)OAACTI3ATE,LAG ,T/,A positioning method s1itch
Motorola
A// %M0&&*00KM,/
%M0&&*00
AGPSACTI3ATE,LAG A"G)% BU*"assisted and U*"basedC
positioning method s1itch
Motorola
A// %M0&&*00KM,/
%M0&&*00
RE,CELLI)
0&% reference cell identification
used for ,T/,A and /G)%^^
Motorola
A// %M0&N&*00
NCELLI) Neighbour 0&% cell reference
identification used for ,T/,A and
/G)%^^
3G))
A// %M0&N&*00
+*)3 Assisted G&S ocation met"od
+*)3)%Description
The Assisted"G)% is a 3G))"standardized t3pe U* positioning mechanism utilizes assistance
navigation information of G)% " Global %atellite )ositioning %3stem.
The G)% is satellite navigation s3stem consisting of the constellation of != active and ; spare satellites
orbit around the *arth in < circular planes at an altitude of approAimatel3 !,! 9m B4!,< milesC
and 4!"hour revolution period.
*ach satellite constantl3 broadcasts the precise time signal according to their o1n atomic cloc9, along
1ith information including the orbital elements BG)% ephemerisC of their o1n motion, and approAimates
ephemerides information for up to 3! other satellites BG)% almanacC as determined b3 $ G)% s3stem
ground control stations. All these data are used to aid in determination of the G)% receiver location and
provide accurate time reference cloc9 source.
All satellites transmit their signal simultaneousl3 on t1o different carrier freJuencies of 4$>$.=! M5z
Bband 04C and 4!!>.< M5z Bband 0!C using &/MA medium access 1ith slo1 $ bKs data
transmission rate. The G)% receiver distinguishes signals from different satellites b3 appl3ing in
demodulation the different seJuences of pseudo random spreading seJuences assigned to the particular
satellites. The 04 freJuenc3 band contains a composite of t1o signals. The3 both are spread 1ith
respectivel3 a short seJuence of 4.!3 Mcps rate 1ith the short 4 ms period B&oarseKAcJuisition &odeC
and long seJuence of 4.!3 Mcps rate 1ith the long period of one 1ee9 B)recious &odeC. .t is 1orth to
mention that pseudo random seJuence periods are called in code epochs. The freJuenc3 of 0! band is
modulated onl3 1ith )recious &ode signal. The G)% s3stem uses t1o separate bands 04 and 0! in
order to reduce ionosphere transmission dela3 result from radio 1aves refraction.
The satellites transmit G)% s3stem navigation data structure in the form of repeated in 4!.$"minute
c3cle superframe, 1hich consists of !$ logical frames. *ach frame contains 4$ bits of data divided
into $ subframes BpagesC transmitting 3 bits during < seconds. The pages transmission timing is
preciousl3 correlated 1ith UT& time so frame s3nchronization process conducted b3 the G)% receiver
provides sufficient amount of data to estimate satellite time at the moment of transmission. Additionall3,
subframe 4 data provides satellites cloc9 corrections and satellite positioning usefulness Jualit3 called
G)% health.
%ubframes ! and 3 contain satellite ephemeris data that let to calculate a precise satellite position at
time of the transmission. %ubframe = and $ contain ! out of !$ pages of s3stem almanac that provides
approAimate ephemerides, cloc9 corrections, and health all satellite, ionosphere and UT& time data.
Almanac allo1s the G)% receiver to select the best set of satellites and estimate their health.
The G)% receiver uses satellites as the reference navigational points. .t decodes simultaneousl3 signals
transmissions from multiple, visible in the s93 satellites, estimates distance to them called pseudo"ranges
and finall3, based on 9no1n triangulation process, G)% receiver calculates its 3/ position.
BNoteL )osition is a vector of = elements, 1hich contains G)% receiver latitude, longitude, altitude and
time of the fiAC.
The G)% receiver calculates the distance to each of at least four satellites b3 the estimating the
difference bet1een G)% receiver local time and the satellite transmission time and finall3, based on
acJuired ephemeris G)% receiver is capable to fiA its position 1ith average accurac3 of fe1 metersKfeet.
Naturall3, G)% s3stem ma3 be used to provide high accurac3 positioning services in mobile cellular
s3stems. To accomplish this U* has to be eJuipped 1ith embedded G)% engines capable receive
satellite signals. Ta9ing into account of high mobilit3 of end"users and freJuent changes of indoor and
outdoor propagation environment it is ver3 difficult and to ensure that U* 1ill al1a3s have a clear s93
G)% satellite visibilit3 and it can permanentl3 9eep trac9 of G)% signal transition to provide immediate
position fiA. .n realit3 if U* lost trac9ing of G)% signals in indoor environment, navigational G)% data
becomes obsolete and in conseJuence after regaining satellites visibilit3 U*2s G)% receiver 1ould have
reJuired in the 1orst case up 4!.$ minutes to acJuire all G)% s3stem information before positioning
calculation. ,bviousl3 such a solution is not practical therefore to shorten, so called, time"to"first"fiA
BTT--C period, net1or9 infrastructure assists U* providing needed G)% navigation data. The U*2s
G)% engine instead of receiving data at the slo1 rate directl3 from satellite ma3 receive them much
faster from the net1or9.
To ma9e this solution possible the RN& or rather %M0& B%ervice Mobile 0ocation &entreC integrated
1ith RN&, is eJuipped 1ith reference G)% receiver, 1hich permanentl3 trac9s all visible satellites
signals, receives and updates G)% navigational data, 9eep them read3 to transmit to the G)% capable
U*s in the service area.
%tandards distinguish U*"based and U*"assisted t3pes of the A"G)% positioning method. .n case of U*"
based method U* after receiving from the UTRAN G)% assistance data estimates pseudo"ranges,
calculates U* position and reports to the RN&K%M0& its geographical position. The position
calculation function is located in the U*.
&ontrar3, in the U*"assisted t3pe of A"G)% positioning method, U* after acJuiring G)% assistance data
from the net1or9, measures pseudo"ranges to the visible satellites and reports them to the RN&K%M0&
Motorola &onfidential )roprietar3 !>4
1ithout solving U* geographical position. The position calculation function is in this case located at the
RN&K%M0&, 1hich is responsible for U* geographical position estimation.
The Motorola UTRAN supports U*"based A"G)% position method. The positioning method and its t3pe
is determined b3 U* capabilities, positioning method licence configuration, SET SMLC positioning
method configuration selection command and it also ma3 depend on RN&K%M0& location services
processing load.
'asic implementation diagram is illustrated in the follo1ing figure.
CN
RNC
SMLC
3+
L0C.T,0N R+P0RT
4TS 2554136
L0C.T,0N
R+P0RT,NG
C0NTR0L
4TS 2554136
GPS re7eren!e
re!ei'er
M+.S3R+M+NT
C0NTR0L
3+ positioning meas%rement
TS 255331
M+.S3R+M+NT
R+P0RT
3+ positioning Position +stimate
,n7o
TS 255331
3+9s GPS
engine
-igure !;"3L 'asic message flo1 for U*"based A"G)% )ositioning Method
The RN&K%M0% reference G)% receiver provides G)% assistance data to the U* using RR&
Measurement &ontrol mechanism described in T% !$.334.
The A"G)% positioning method effectiveness highl3 depends on mobile2s vendor " particularl3 its G)%
engine design and Jualit3 of assistance data provided to the U*.
Time"To"-irst"-iA decreases significantl3 from about several minutes, assuming discarding an3
internall3 stored in the U* G)% reference data 1hich help in previous position fiA, do1n to !"3
seconds if provided to the U* assistance data have highl3 accurate estimates of the U* positioning G)%
reference time is 1ithin VK" ! seconds measured at the U* antenna port and U* positioning G)%
reference position, 1hich shouldn2t differs more than 4"3 9m form the ph3sical, real U* location.
The minimal net1or9 assistance information for U* AG)% positioning location method depend on U*
vendor solution but in general it should at least include the follo1ing dataL
>. U* positioning FPS reference time described in the ?U* positioning G)% reference time .*@
defined in section 4.3.>.+< of T% !$.334 Reference time should be accurate to VK" ! seconds.
The net1or9 should send time reference in a short message to 9eep small transmission latenc3.
Motorola &onfidential )roprietar3 !>!
;. U* positioning FPS Reference <osition as it is described in the ?U* positioning G)% reference
U* position .*@ is defined in section 4.3.;.=c of T% !$.334 described as ellipsoid point 1ith
altitude and uncertaint3 ellipsoid according to the Universal Geographical Area /escription
recommendation in the T%!3.3!. .t is important to set reference position confidence to non"
zero value. Uncertaint3 should be large enough to cover the area in 1hich RN& provides
assistance data.
+. %atellite navigation model described in the ?U* positioning G)% navigation model .*@ defined
in section 4.3.>.+= of T% !$.334. This information element provides precise navigation data N
e<hemeri$es and cloc9 corrections. Net1or9 should provide G)% navigation model for at least
all satellites in the visible s93 at given time and area. 5o1ever Motorola U*s can effectivel3
use data for all 3! satellites if available. .t is also recommended to brea9 information on G)%
navigation model into multiple messages. 0arge massage of !"3 second latenc3, 1hat is t3pical
for navigation model of 4! satellites 1ill cause dropped calls or handover failures. )erfectl3 it
1ould be to send 3 messages each including ephemeris and cloc9 correction data of = satellites,
provide pause bet1een messages to allo1 for Juic9 active set updates procedure.
4. )ropagation .onos<here mo$el described in the ?U* positioning G)% ionospheric model .*@
defined in section 4.3.>.+! of T% !$.334. .t is enough to update these data ever3 4! hours.
44. %atellites2 Real time integrity described in the ?U* positioning G)% real"time integrit3 .*@
defined in the section 4.3.>.+$ of T% !$.334. Assistance data message should contain this
information element 1hen a satellite is deemed unhealth3.
The U* uses ?U* positioning )osition *stimate .nfo .*@ Bsee section 4.3.>.4+ of T% !$.334C of RR&
Measurement Report procedure to report to the RN&K%M0& U*2s geographical position according to
Universal Geographical Area /escription format described in the T%!3.3! out of the follo1ing
selectionL
*llipsoid )oint,
*llipsoid point 1ith uncertaint3,
&ircle,
*llipsoid point 1ith altitude,
*llipsoid Arc.
%ignalling, reporting and location triggering mechanisms bet1een the core net1or9 &N and the
RN&K%M0& remains as it is described for &*00 ./ positioning method.
Motorola &onfidential )roprietar3 !>3
+*)3)+Database parameters
implementation specific parameter@. The graphical representation of RN& $ 0&% configuration
parameters are illustrated in the follo1ing figureL
GPSI) The reference G)% receiver ./
Motorola
A// G)%KM,/ G)%
C,GT .ndication of either RN& or Node '
reference G)% receiver.
Motorola
A// G)%KM,/ G)%
GPSPERIO) Reference receiver G)% data reporting
period.
Motorola
A// G)%KM,/ G)%
)GPSPERIO) Reference receiver reporting period for
/ifferential G)% data
Motorola
A// G)%KM,/ G)%
LATIT')E The reference G)% receivers2 antenna
latitude
Motorola
A// G)%KM,/ G)%
LONGIT')E The reference G)% receivers2 antenna
longitude
Motorola
A// G)%KM,/ G)%
ALTIT')E The reference G)% receivers2 antenna
altitude.
Motorola
A// G)%KM,/ G)%
ACTT Activation of the .nformation *Achange
)rocedure. :alue URN& G)%U turns on
bothL G)% and /ifferential G)%.
Motorola
A&T G)%
)EAT /eactivation of the information eAchange
procedure. :alue URN& G)%U turns on
both G)% and /ifferential G)%.
Motorola
/*A G)%
)ELA; Reset the G)% receiver 1ith specified
dela3.
Motorola
R%T RN&G)%
T;PEBLM'I) 0MU t3pe ' identifier NKA
A// 0MU
LATIT')E)EGREE The reference 0MU antenna latitude, NKA
Motorola
A// 0MU
LONGIT')E)EGREE The reference 0MU antenna longitude,
NKA
A// 0MU
Motorola &onfidential )roprietar3 !>=
Motorola
ALTIT')EMETER The reference 0MU antenna altitude, NKA.
Motorola
A// 0MU
NO)EBNAME Node ' identifier of the collocated 0MU
t3pe ', NKA for Motorola UTRAN.
Motorola
A// 0MU
START,LAG UTRAN G)% frame timing measurement
s1itch
Motorola
A//
&*00G)%-RMT.M.N
G
Ce!!I) /eactivation of .)/0 for ,T/,A
3G))
/*A .)/0
SMLCA')ITTIMERL
EN
%M0& audit timer
Motorola
%*T %M0&
SHORT'PTIMERLEN %hort positioning procedure timer
Motorola
%*T %M0&
LONG'PTIMERLEN 0ong positioning procedure timer
Motorola
%*T %M0&
'ESTATTRANTIMER
LEN
U* status transition timer
Motorola
%*T %M0&
'PMEASRESEN)TIM
ERLEN
Measurement message sending repetition
timer
Motorola
%*T %M0&
CELLIN,O>'ER;TI
MERLEN
&ell information Juer3 timer
%*T %M0&
)ATARESPTIMERLE
N
Assistance data deliver3 response timer
Motorola
%*T %M0&
BAITMEASRSLTCON
S
7aiting measurement result timer offset
Motorola
%*T %M0&
MA@RESEN)N'M MaA times of resending measurement
control message
Motorola
%*T %M0&
RTTMEAS,ILTERCO
E,,
RTT measurement filtering coefficient
Motorola
%*T %M0&
NOIP)LT)OAMEASP
ERIO)
,T/,A measurement reporting period
1ithout .)/0 in U* assisted mode
Motorola
%*T %M0&
IP)LT)OAMEASSHO
RTPERIO)
%hort ,T/,A measurement reporting
period 1ith .)/0 in U* assisted mode.
Motorola
%*T %M0&
IP)LT)OAMEASLON
GPERIO)
0ong ,T/,A measurement reporting
%*T %M0&
Motorola &onfidential )roprietar3 !>$
period 1ith .)/0 in U* assisted mode.
Motorola
CELLI)MEASPERIO
)
&ell ./ measurement reporting period in
U* assisted mode.
Motorola
%*T %M0&
GPSMEASSHORTPER
IO)
%hort G)% measurement reporting period
in U* assisted mode.
Motorola
%*T %M0&
GPSMEASLONGPERI
O)
0ong A"G)% measurement reporting
period in U* assisted mode.
Motorola
%*T %M0&
'EBASE)MEASPERI
O)
A"G)% measurement reporting period in
U* based mode.
Motorola
%*T %M0&
EMPHERISSEN),LA
G
Activation of G)% ephemeris sending in
U* assisted mode
Motorola
%*T %M0&
ALMANACSEN),LA
G
Activation of G)% almanac sending in U*
assisted mode
Motorola
%*T %M0&
SMLCMETHO) U* positioning method t3pe selection
N,N* " No method,
&./ " 'asic &*00./,
A%%G*&./" *nhanced &*00./,
A%%G,T/,A " U* assisted ,T/,A,
A%%GAG)% " U* assisted AG)%,
'A%GAG)% "U* based AG)%,
A%%GAG)%G&./ " U* assisted AG)% and
basic &*00 ./,
'A%GAG)%G&./ " U* based AG)% and
basic &*00 ./
G*NGAG)%G&./ "Generic AG)% and
basic &*00 ./,
A%%G,T/,AG*&./"U* assisted
,T/,A and enhanced &*00 ./,
A%%GAG)%G*&./ " U* assisted AG)%
and enhanced &*00 ./,
A%%GAG)%G,T/,AG*&./ " U* assisted
AG)%, ,T/,A and enhanced &*00
./
Motorola
%*T %M0&
Motorola &onfidential )roprietar3 !><
+*)3)3Jey per$ormance indicators
J&I Description
TT,, Time to first fiA N defined as time dela3 bet1een location report control
message provided from the &N to the RN&K%M0& and the position fiA in the
location report message received from the RN&K%M0& for U*"based A"
G)% positioning method, 1hich includes the first, after U* po1ering"on
assuming discarding form U* memor3 all G)% assistance data used in
previous position fiA.
Motorola &onfidential )roprietar3 !>>
+9AT' #onnection Admission #ontro
+9)% Agorit"m o;er;ie=
The obOective of &onnection Admission &ontrol B&A&C is to decide 1hether a ne1 ATM or AA0!
connection can be accepted meeting its 6o% reJuirements and still maintaining the 6o% of the alread3
established connections and if so 1hat resources should be allocated.
The concept of *Juivalent 'and1idth B*'C is intuitivel3 simple and fleAible. .t estimates band1idth
reJuired for each connection in EbitKsec, e.g., a :) connection, a :& connection, or an AA0 t3pe !
connection. .t originates from traditional circuit"s1itched net1or9s. .t is used commonl3 in ATM
net1or9s. .t is to adapt this concept to AA0 t3pe !. The intention 1ith the eJuivalent band1idth is to be
able to sum"up and to partition band1idth as linear values in order to simplif3 the net1or9 management.
'asic principles are the follo1ingL
An UeJuivalent band1idthU needed to guarantee the 6o% is derived from a compleA traffic contract
at each connection set"up. This eJuivalent band1idth ma3 be different at each multipleAing point. .t
ma3 var3 for a given connection along its path.
Acceptance rules are linear of t3pe %ummation of *' W & B1here & is the multipleA capacit3 or the
eJuivalent band1idth of the connection in 1hich connections are multipleAedC.
&onnection Admission &ontrol function is called at ever3 AA0! and ATM connection reJuest and at
ever3 AA0! and ATM connection release. At ever3 connection reJuest a ne1 eJuivalent band1idth
is computed and summed up using the correct rule. At ever3 connection release, the eJuivalent
band1idth is subtracted using the correct rule.
&A& is performed for static t3pe ATM connections, i.e. connections set up for control plane
signaling connections li9e N'A), RN%A), RANA).
&A& is performed for d3namic ATM connections, i.e. connections set up for user plane traffic li9e
AA0! d3namic connections.
+9)%)%Agorit"m $or dynamic AT' connections
4!. RN& receives reJuest to establish an ATM connection. This could be in response to M%
initiated call setup via &N, e.g. RA' Assignment ReJuest.
43. RN& Juantifies the impact to transport band1idth from incoming reJuest according to the
formulaL
*' T 5eader &R&K-TV&-NVT-.VT'V6*V&R&.VspareV&R&VAA0! 5*A/C[;KTT..
Motorola &onfidential )roprietar3 !>;
.t is a total bit rate. RA' bit rate, R0& overhead and )/&) overhead is contained in T' bloc9. AA0!
5*A/ need considering the AA0! fragmentation. #ust normal mode is included in the calculation, it is
because the resource is reserved for the service 1hether the user transmits 1ith the full speed or not.
*Aample for 4!.! AMR :oiceL
4!.!E :oiceL 5eader &R&K-TW4 b3teQV&-NW4 b3teQVT-.W3
b3tesQVT'W44V43V;b3tesQV6*W4b3teQV&R&.W4b3teQV spareW!b3tesQV&R&W!b3tesQVAA0!
5*A/W3b3tesQK!ms T =<[;K.! T 4;=bitKsB/0KU0 throughputC.
*Aample for <= 9bitKs /0K ; 9bitKs U0 interactiveKbac9ground )%L
<=E )%L 5eader &R&K-TW4 b3teQV&-NW4 b3teQVT-.W4 b3tesQVT'W=[=!
b3tesQV6*W4b3teQV&R&.W4b3teQVspareW!b3tesQV&R&W!b3tesQVAA0!
5*A/W3[$b3tesQK!ms T 4+![;K.! T ><;bitKs B/0 throughputC
;E )%L 5eader &R&K-TW4 b3teQV&-NW4 b3teQVT-.W4 b3tesQVT'W4[=!
b3tesQV6*W4b3teQV&R&.W4b3teQVspareW!b3tesQV&R&W!b3tesQVAA0!
5*A/W3[$b3tesQK=ms T $>[;K.= T 44=bpBU0 throughputC.
The follo1ing table sho1s calculated values for different RA' t3pesL
RA0 type
7<bitBs8
#acuated Transport
T"roug"put $or RA0
7<bitBs8
4!.! 4;.=
4.! 4<.=
>.+$ 4=
>.= 4!.;
<.> 4!.=
$.+ 44.!
$.4$ 4.;
=.>$ 4.=
!;.; B&% transparentC 33
3! B&% transparentC 3+.!
$< B&% transparentC <3.3$
<= B&% transparentC >!.=
4=.= B&% non"transparentC 4>.=
!;.; B&% non"transparentC 33
$>.< B&% non"transparentC <3.<
Motorola &onfidential )roprietar3 !>+
<= B&% non"transparentC >!.=
; B)%C 44.=
4< B)%C !!.;
3! B)%C =.;
<= B)%C ><.;
4!; B)%C 4=>.<
4== B)%C 4<$.<
!$< B)%C !+4.<
3;= B)%C =3+.!
A ne1 statistical multipleAing gain parameter for AA0! related calls has been introduced into RN&
:4.!. The MM0 command to use is ?%et AA0 -A&T,R@. This parameter acts as a multiplier for the
calculated value resulting in a final value, i.e. *'AA0! T AA0-A&T,R [ &alculatedG'7. -or eAample, for
an AA0-A&T,R of .> and a 4!.! 9bitKs voice "Q *'AA0! T .> [ 4;.=E T 4!.;; 9bitKs of used transport
resources.
4=. The RN& chec9s 1hether the eJuivalent band1idth of all AA0! channels for that :& according
toL

channels AA0! all
! HC HC AA(
3- , 3-
%imilarl3 for AA0$ channelsL

channels AA0$ all
$ HC HC AA(
3- , 3-
-or the RN&, E:& is eJuivalent to 4. -or other implementations this acts as an additional operator
configurable 1eight on the entire :&.
-or each :&, the is determined according to ATM traffic contract parameters according to the follo1ing
table. The detail of ho1 these ATM traffic parameters are used is not documented 3et.
AT' V# Type Appicabe
Adaptation -ayers
7AA-8
AT' Tra$$ic &arameters
used in cacuation o$
E0
V#
E$$ect on E0
V#
&'R AA0!, AA0$ )&R Un9no1n
rt:'R, nrt:'R AA0!, AA0$ %&R, &/:T Un9no1n
U'R AA0$ )&R No effect, i.e. no
connection on a
U'R :& 1ill
ever be refused.
4$. .f the transport band1idth chec9 fails, e.g. for an AA0! :&, if
>
channels AA0! all
! HC HC AA(
3- , 3-
holds true, then indication of failure is returned to RRM and the call is failed.
+9)%)+Database parameters
&arameter Description #omments
RRC s"#na!
(act&r
AdOustable band1idth factor for
AA0! RR& connections.
This is ,AM configurable
per RN& MM0 commandL
%*T AA0-A&T,R
AMR s2eech
(act&r
AdOustable band1idth factor for
AA0! AMR :oice connections, i.e.
RA' Traffic &lass T &onversational
over .u&% interface.
%*T AA0-A&T,R
CS %ata (act&r AdOustable band1idth factor for
RA' Traffic &lass T %treaming
%*T AA0-A&T,R
PS %ata (act&r AdOustable band1idth factor for
RA' Traffic &lass T %treaming
%*T AA0-A&T,R
+9)%)3Jey &er$ormance Indicators
J&I Description
E0Success$uA'R#asAdmitted&V# This E). measures the number of successful
AMR calls set up successfull3. Using appropriate
tools N see attached, the number of AMR calls set
up using ?%*T AA0-A&T,R@ should
correspond closel3 1ith eApected.
E0Success$u#SData#asAdmitted&V# This E). measures the number of successful
tools N see attached, the number of &% /ata calls
set up using ?%*T AA0-A&T,R@ should
Motorola &onfidential )roprietar3 !;4
E0Success$u&SData#asAdmitted&V# This E). measures the number of successful
tools N see attached, the number of )% /ata calls
set up using ?%*T AA0-A&T,R@ should
U-BD- Radio Access 0earer T"roug"put
Ratio
This is the ratio of throughput in high values of
AA0 -actor to lo1 values of AA0 -actor for
same t3pe of calls, e.g. ratio for AMR %peech
-actor calls. A too optimistic usage of AA0
-actor 1ill result in man3 calls being admitted,
ho1ever the effective throughput 1ill be reduced
for a call 1ith high value of AA0 -actor
compared to same t3pe of call 1ith lo1 value of
AA0 -actor.
The follo1ing spreadsheet can be used to calculate capacit3 numbers of calls for different RA'
configurationsL
?UMT% &all &apacit3 &alculator@, Miguel &arames, 'ernhard Eoessler,
httpLKKcompass.mot.comKgoK44>$3>43$.
The actual number of calls observed can be compared to calculations given b3 this tool measuring the
effectiveness of the ATM &A& algorithm using the ?%*T AA0-A&T,R@ 0MT command.
+9)%)2Optimization Guideines
The parameters belo1 are set using the command %*T AA0-A&T,R.
RRC,ACTORL >_
This parameter is used for AA0! RR& signalling connections. >_ should be a reasonable multipleAing
gain for these d3namic signalling connections as for a large part of a call, the3 1ill not be used.
AMR,ACTORL >_
This parameter is used for voice calls. >_ is a de"facto standard for estimating voice activit3 for
1ireless calls.
CS)ATA,ACTORL 4_
This parameter is used for &% data activit3. 4_ is a safe factor but ma3 be optimized for less than
that for efficienc3. No meaningful simulations have been done to derive a more optimum value.
PS)ATA,ACTORL 4_
Motorola &onfidential )roprietar3 !;!
This parameter is for )% data activit3. 4_ is ver3 conservative. ,ther mechanisms li9e /&&& are in
place to get better efficienc3 for high speed pac9et ho1ever so the call ma3 end up not getting rated at
the initial reJuest Be.g. 3;=E bac9ground call 1ould end up getting /&&&2ed do1n to <=EC but in
absence of /&&&, a better factor can be applied.
Motorola &onfidential )roprietar3 !;3
3:RN# O;eroad Agorit"m
3:)% O;er;ie=
&ongestion in net1or9s and the RN& in particular, occur 1henever the demand for resources such as
lin9 band1idth, buffer space or &)U processing is eAceeded i.e. the s3stem is eAperiencing more traffic
than the engineered capacit3. &ongestion left uncontrolled leads to serious conseJuences such as long
transfer dela3s due to eAcessive Jueuing, high pac9et loss due to buffer overflo1s etc. %ince
uncontrolled overload results in lo1 performance, the RN& needs to emplo3 overload controls to
maintain throughput and dela3 at acceptable levels during periods of sustained high load. This note
concerns non"radio related measures for management K control of signalling and user plane congestion K
overload at the RN& level B-R!<3<3C.
Traditional approaches to congestion management include admission control algorithms, traffic
shapingKsmoothing functions, buffer management techniJues and processor control. T3picall3,
congestion control strategies are classified as either <reventative or reactive. )reventative approaches
reJuire end"to"end allocation of resources, 1hereas in reactive schemes, based on feedbac9 received, the
receiver is used to alterKadOust source transmission strateg3. There are also t1o basic t3pes of responses
to overload. -irst the RN& ma3 decide to invo9e remote congestion controls b3 signalling its neighbours
of its state. .t is not 9no1n if recommended procedures eAistKare defined for this t3pe of overload
response. The second approach relies on local protection of processing resources e.g.
selectiveKintelligent throttling of incoming initial service"reJuest t3pe of signalling messages, 1here
overload is reduced b3 eliminating future signalling messages. T3picall3, overload controls need to be in
place, to maAimise available throughput, during overloadKcongestion periods.
The mechanisms in place in U%R3., are based on a preventative approach that emplo3s static buffer D
&)U management i.e. thresholding and has a local scope. &ongestion t3picall3 relates to buffer
overflo1 Buser or control data tend to be lostC. The reaction to a congestion situation Bor protection
against itC t3picall3 reJuires some form of flo1 control. ,verload t3picall3 arises due to lac9 of
resources e.g. &)U processing, to handle the traffic.
.n U%R3., the follo1ing measures are supported b3 the RN& in response to congestionKoverload
scenarios, ho1ever, measures relating directl3 to -R!<3<3 have been highlightedL
/o= #ontro 1 RN# &at$orm
o /o= #ontro upon -oca Resource #ongestionBO;eroad
o /o= #ontro upon -oca bu$$er congestionBO;eroad
User Tra$$ic /o= #ontro 1 Iub inter$ace
User Tra$$ic /o= #ontro 1 Iur inter$ace
Signaing /o= #ontro 1 Iu inter$ace
Inter$aces C Transport ayer
Motorola &onfidential )roprietar3 !;=
Radio admission of ne1 call reJuest
Traffic monitoring
/irect Retr3
.u 6o% NegotiationKRenegotiation -eature
RA' do1nsizing
.ntelligent Admission &ontrol
&allKRA' 6ueuingK)re"emption function
Radio 0oad &ontrolL
o &ell 'reathing
o )otential User &ontrol B)U&C
o &ontrol the AMRKRate"controllable %treaming %ervices Mode B&ell"orientedC
o /3namic &hannel &onfiguration &ontrol B/&&&C
o 0oad &ongestion &ontrol
o .ntelligent 0oad &ontrol
o 0oad monitoring -unction
o 0oad Reshuffling -unction
o ,verload control of 5%/)A bearers
o ,verload control of /&5 bearers
3:)%)%Description
The RN& ma3 engage congestion handling functions andKor overload control mechanisms on both the
Uplin9 and /o1nlin9 directions, upon congestion detection andKor receiving overload indication. The
triggers used areL &)U or message Jueue utilization levels Bset via ,M&C. The RN& can also use
7%)Ub load as trigger for controlKsignalling"plane overload detection, 1hilst &A& is used to control
and react to user"plane overload.
Additionall3, RN& supports .ub, .ur, .u)%, .u&% transport la3er congestion thresholds, for user"plane.
The RN& ma3 engage one or more of the follo1ing measures in response to overloadKcongestion Bin no
particular orderCL
'ac9"off of randoml3 selected U*s from the s3stem 1ith the fiAed priorit3 order )% first and &%
second.
,:*R0,A/ procedure " as defined in T%!$.=43, to provide signalling flo1 control. At the
UTRAN side, U)rocessor ,verloadU and U,verload in the &apabilit3 to %end %ignalling Messages
to the U*U are catered for, and at the &N side, U)rocessor ,verloadU is catered for. N,T*L The
algorithm used is described in section ;.!$.4, T%!$.=43.
Motorola &onfidential )roprietar3 !;$
/o1nlin9 congestion control B.ub U) trafficC " via -lo1 &ontrol Bapplicable to do1nlin9 -A&5
channelsC, upon congestion detection. Refer to T%!$.=3$
&ongestion control B.ur U) trafficC " via -lo1 &ontrol Bapplicable to do1nlin9 -A&5 channelsC,
upon congestion detection. Refer to T%!$.=!$
-lo1"control N based on traffic eAceeding the flo1"control start threshold Bthere are per board t3pe
startKstop thresholds defined via ,M&, upon message Jueue andKor &)U utilization triggers.
Note on ?flo1"control@ " 1hen the s3stem load is too high, flo1 control is triggered i.e. the s3stem 1ill
stop the tas9s 1ith lo1er priorities and prohibits the operator from starting ne1 tas9s 1ith lo1er
priorities. Ne1 tas9s, even if started, 1ill be stopped immediatel3.
3:)%)+Dependencies
T'/.
3:)+ Reated -'T commands
The algorithm can be configured and optimized 1ith the follo1ing commandsL
%*T -&%7
%*T -&&)UT5/
%*T -&M%G6T5/
-urther information on these commands are given belo1, 1ith eAamples. The detailed parameters
description is in the Reference )arameters %preadsheet.
3:)+)%SET /#S3
3.!.4.4 Description
%et flo1 control s1itches. (ou can set all s1itches of a t3pe of board or Oust several of them at one time.
Notes that onl3 1hen `-lo1 control s1itcha and the s1itch controlling a single item both are ,N can the
corresponding flo1 control function be enabled
3.!.4.! &arameters
%ee the Reference )arameters %preadsheet.
Motorola &onfidential )roprietar3 !;<
3.!.4.3 E>ampe
4. %1itch on all flo1 control s1itches of the 7%)UK7%)UbL
%*T -&%7L 'TT7%)UK7%)U', -&%7T,N, )R.NT%7T,N, TRA&*%7T,N, ):&%7T,N,
)M%7T,N, R*%AU/.T%7T,N, )AG*%7T,N, RR&0NE%7T,N, 5AN/,:*R%7T,N,
.URU0%7T,N, .UR/0%7T,N, &'%%7T,N, 0,G%7T,NP
!. /isable the flo1 control function of the 7%)UK7%)Ub.
This command can be used to temporaril3 disable the function 1hile the specific s1itch settings are not
modified.
%*T -&%7L 'TT7%)UK7%)Ub, -&%7T,-- P
3:)+)+SET /##&UT!D
3.!.!.4 Description
%et &)U occupanc3 thresholds and associated parameters used for flo1 control.
Notes
7hen the U&)U occupanc3U reaches a specified threshold, flo1 control 1ill occur onl3 if the
corresponding flo1 control s1itch is ,N.
.n order to control the flo1 under the circumstance that the &)U occupanc3 becomes too high in a
short time, `-ast Oudgement 1indo1a is applied to the s3stem. That is, compare the &)U
occupancies occurring in a short time earlier than the current time 1ith the `&ritical thresholda.
,nce all the &)U occupancies in `-ast Oudgement 1indo1a reach or eAceed the threshold, all flo1
control functions that s1itches are ,N are eAecuted immediatel3.
To prevent flo1 control transient resulting from instantaneous overhigh &)U occupanc3, `-ilter
1indo1a is applied to the s3stem. That is, compare the mean of the &)U occupancies occurring in a
period before the current time 1ith the corresponding threshold. 7hen the mean of &)U
occupancies in `-ilter 1indo1a reaches or eAceeds the corresponding control threshold, the related
flo1 control mechanism comes into effect. 7hen the mean value is smaller than corresponding
recover threshold, the related flo1 control mechanism is disabled.
The &)U occupanc3 thresholds are subOect to the follo1ing ruleL 4X critical threshold X control
threshold of a flo1 control function X restoration threshold of this flo1 control function.
The priorit3 of the critical threshold is higher than the priorities of other special thresholds. That is,
1hen the &)U occupanc3 reaches the critical threshold, its control mechanism comes into effect
firstl3. ,nl3 1hen the &)U occupanc3 doesnct reach the critical threshold can other thresholds get
effective.
The flo1 control based on message Jueue occupanc3 and that based on &)U occupanc3 are
independent from each other, and the lesser allo1ed flo1 is the allo1ed flo1 of the s3stem.
Motorola &onfidential )roprietar3 !;>
3.!.!.! &arameters
3.!.!.3 E>ampe
%et &)U occupanc3 thresholds for 7-MRK7-MRb.
%*T -&&)UT5/L 'TT7-MRK7-MRb, %M7.N/,7T4, -/7.N/,7T=, &T5/T+$,
)R.NT&T5/T<, )R.NTRT5/T$, TRA&*&T5/T<, TRA&*RT5/T$, ):&&T5/T+,
):&RT5/T;$P
3:)+)3SET /#'SG,T!D
3.!.3.4 Description
%et message Jueue occupanc3 thresholds and associated parameters used for flo1 control.
Notes
7hen the Umessage Jueue occupanc3U reaches a specified threshold, flo1 control 1ill occur onl3 if
the corresponding flo1 control s1itch is ,N.
To prevent message Jueue overflo1 resulting from too high message Jueue occupanc3, once the
message Jueue occupanc3 reaches or eAceeds the `&ritical thresholda, all flo1 control functions that
,N are eAecuted immediatel3.
To prevent flo1 control transient resulting from instantaneous overhigh message Jueue occupanc3,
`-ilter 1indo1a is applied to the s3stem. That is, compare the mean of the message Jueue
occupancies occurring in a period before the current time 1ith the corresponding threshold. 7hen
the mean of message Jueue occupancies in `-ilter 1indo1a reaches or eAceeds the corresponding
control threshold, the related flo1 control mechanism comes into effect. 7hen the mean value is
smaller than the restore threshold, the related flo1 control mechanism is disabled.
The message Jueue occupanc3 threshold is subOect to the follo1ing ruleL 4X critical threshold X
control threshold of a flo1 control function X restore threshold of this flo1 control function.
The priorit3 of the critical threshold is higher than the priorities of other special thresholds. That is,
1hen the message occupanc3 reaches the critical threshold, its control mechanism comes into effect
firstl3. ,nl3 1hen the message occupanc3 doesnct reach the critical threshold can other thresholds
get effective.
The flo1 control based on message Jueue occupanc3 and that based on &)U occupanc3 are
independent from each other, and the lesser allo1ed flo1 is the allo1ed flo1 of the s3stem.
3.!.3.! &arameters
Motorola &onfidential )roprietar3 !;;
3.!.3.3 E>ampe
%et message Jueue occupanc3 thresholds for 7-MRK7-MRb.
%*T -&M%G6T5/L 'TT7-MRK7-MRb, %M7.N/,7T4, &T5/T;, )R.NT&T5/T<,
)R.NTRT5/T$, TRA&*&T5/T$, TRA&*RT5/T=, ):&&T5/T;, ):&RT5/T<P
3:)3 Jey per$ormance indicators
To be completed.
Motorola &onfidential )roprietar3 !;+

UTRAN Optimization Guide v3

Caricato da

Informazioni sul documento

Descrizione originale:

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

UTRAN Optimization Guide v3

Caricato da

Copyright:

Formati disponibili

UTRAN Optimization Guide USR3

UTRAN Optimization Guide

*Juation 3.>"!L &alculation of U0 /)&&5 )o1er ,ffsets Terms

" is norm operator

" is norm operator

1here the *bKNo is obtained based on the follo1ing stepsL

is the gain factor for /)/&5 and

is the gain factor for /)&&5.

is the gain factor for /)/&5 and

is the gain factor for /)&&5.

-or multi RA's

4+.4.!.4.<.! &alculation of /o1nlin9 Activit3 -actor

n is the n"th user,

the persistence value )

has al1a3s value of 4 regardless of persistence. The U* has al1a3s

Potrebbero piacerti anche