Basic Mobile Originating Call Diagram

Quality of Service
Network Services are considered end-to-end, this means from a Terminal
E!i"ment #TE$ to another TE% &n End-to-End Service ma' have a certain (!alit'
of Service #(oS$ which is "rovided for the !ser of a network service% )t is the !ser
that decides whether he is satisfied with the "rovided (oS or not%
To realise a certain network (oS a Bearer Service with clearl' defined
characteristics and f!nctionalit' is to be set !" from the so!rce to the destination of
a service%
& bearer service incl!des all as"ects to enable the "rovision of a contracted (oS%
These as"ects are among others the control signalling, !ser "lane trans"ort and (oS
management f!nctionalit'% & *MTS bearer service la'ered architect!re is de"icted
below, each bearer service on a s"ecific la'er offers it+s individ!al services !sing
services "rovided b' the la'ers below%
(oS &rchitect!re
There are four different QoS classes:
conversational class
streaming class
interactive class
backgro!nd class
Traffic class Conversational
class
Real Time
Streaming class
Real Time
Interactive class
Best Effort
Background class
Best Effort
Fundamental
characteristics
- ,reserve time
relation #variation$
between
information entities
of the stream
- Conversational
"attern #stringent
and low dela' $
- ,reserve time
relation
#variation$
between
information
entities of the
stream
- -e!est res"onse
"attern
-,reserve "a'load
content
-Destination is not
e."ecting the data
within a certain
time
-,reserve "a'load
content
Examle of the
alication
voice streaming video web browsing telemetr', emails
*MTS (oS classes
!ist of "#TS Bearer Service $ttri%utes:
Traffic class #+conversational+, +streaming+, +interactive+, +backgro!nd+$
Ma.im!m bit rate #kb"s$
/!aranteed bit rate #kb"s$
Deliver' order #'0n$
Ma.im!m SD* si1e #octets$
SD* format information #bits$
SD* error ratio
-esid!al bit error ratio
Deliver' of erroneo!s SD*s #'0n0-$
Transfer dela' #ms$
Traffic handling "riorit'
&llocation0-etention ,riorit'
So!rce statistics descri"tor #+s"eech+0+!nknown+$
SD* 2 Service Data *nit
Cell search rocedure
D!ring the cell search, the *E searches for a cell and determines the downlink
scrambling code and frame s'nchronisation of that cell% The cell search is t'"icall'
carried o!t in three ste"s3
Ste &: Slot synchronisation
D!ring the first ste" of the cell search "roced!re the *E !ses the SC4+s "rimar'
s'nchronisation code to ac!ire slot s'nchronisation to a cell% This is t'"icall' done
with a single matched filter #or an' similar device$ matched to the "rimar'
s'nchronisation code which is common to all cells% The slot timing of the cell can
be obtained b' detecting "eaks in the matched filter o!t"!t%
Ste ': Frame synchronisation and code(grou identification
D!ring the second ste" of the cell search "roced!re, the *E !ses the SC4+s
secondar' s'nchronisation code to find frame s'nchronisation and identif' the code
gro!" of the cell fo!nd in the first ste"% This is done b' correlating the received
signal with all "ossible secondar' s'nchronisation code se!ences, and identif'ing
the ma.im!m correlation val!e% Since the c'clic shifts of the se!ences are !ni!e
the code gro!" as well as the frame s'nchronisation is determined%
Ste ): Scram%ling(code identification
D!ring the third and last ste" of the cell search "roced!re, the *E determines the
e.act "rimar' scrambling code !sed b' the fo!nd cell% The "rimar' scrambling
code is t'"icall' identified thro!gh s'mbol-b'-s'mbol correlation over the C,)C4
with all codes within the code gro!" identified in the second ste"% &fter the "rimar'
scrambling code has been identified, the ,rimar' CC,C4 can be detected and the
s'stem- and cell s"ecific BC4 information can be read%
)f the *E has received information abo!t which scrambling codes to search for,
ste"s 5 and 6 above can be sim"lified
Str!ct!re of s'nchroni1ation channel
The Synchronisation Channel #SC4$ is a downlink signal !sed for cell search%
The SC4 consists of two s!b channels, the ,rimar' and Secondar' SC4% The 78
ms radio frames of the ,rimar' and Secondar' SC4 are divided into 79 slots, each
of length 59:8 chi"s% ,ict!re above ill!strates the str!ct!re of the SC4 radio frame%
The *rimary SC+ consists of a mod!lated code of length 59: chi"s, the "rimar'
s'nchroni1ation code #,SC$ is transmitted once ever' slot% The ,SC is the same for
ever' cell in the s'stem%
The Secondary SC+ consists of re"eatedl' transmitting a length 79 se!ence of
mod!lated codes of length 59: chi"s, the Secondar' S'nchronisation Codes #SSC$,
transmitted in "arallel with the ,rimar' SC4% The SSC is denoted c
s
i,k
in fig!re 58,
where i 2 8, 7, ;, :6 is the n!mber of the scrambling code gro!", and k 2 8, 7, ;,
7< is the slot n!mber% Each SSC is chosen from a set of 7: different codes of length
59:% This se!ence on the Secondar' SC4 indicates which of the code gro!"s the
cell+s downlink scrambling code belongs to%
Summary of the rocess:
Channel
Synchronisation
ac,uired
-ote
,rimar'
SC4
Chi", Slot, S'mbol
S'nchronisation
59: chi"s
The same in all cells
Secondar'
SC4
=rame S'nchronisation,
Code /ro!" #one of :<$
79-code se!ence of secondar' s'nchronisation
codes%
There are 7: secondar' s'nchronisation codes%
There are :< S-SC4 se!ences corres"onding to the
:< scrambling code gro!"s
59: chi"s, different for different cells and slot
intervals
Common ,ilot
C4
Scrambling code
#one of >$
To find the "rimar' scrambling code from common
"ilot C4
,CC,C4 ?$
S!"er =rame
S'nchronisation,
BCC4 info
=i.ed 68 kb"s channel
5@ kb"s rate
s"reading factor 59:
SCC,C4 ??$
Carries =&C4 and ,C4 channels
Aariable bit rate
?$ ,rimar' Common Control ,h'sical Channel
??$ Secondar' Common Control ,h'sical Channel