UMTS Material (LT)

1
UMTS Principles
Prepared by: Mohammed abdulkarim
Revised by : Abdulrahman Fady
Legend Technologies Co.
2
Course Outlines
Introduction to mobile communication
UMTS network architecture and interfaces
UMTS principles and advantages
UMTS air interface
UMTS Synchronization, accessing, handover and
power control.
3
Introduction to Mobile Communication
History of wireless communication.
Why wireless?
Wave properties
Analog to digital
Effects on Radio Communication
Multiple Access Techniques
Wireless Challenges
Cellular System Concepts

4
History of wireless communication
18381866 Telegraphy: Morse perfects his system; Stein hill finds that the earth
can be used for a current path; commercial service is initiated

1864 Maxwells equations predict electromagnetic radiation.

18871907 Wireless telegraphy :
Heinrich Hertz verifies Maxwells theory.
Demonstrations by Marconi and Popov; Marconi patents complete wireless telegraph
system (1897).
5
History of wireless communication (cont.)
19231938 Television: Mechanical image-formation system demonstrated;
DuMont and others perfect vacuum cathode-ray tubes; field tests and experimental
broadcasting begin.

1936 Armstrongs paper states the case of frequency modulation (FM) radio.

1937 Alec Reeves conceives pulse code modulation (PCM).

19381945 Radar and microwave systems developed during World War II; FM
used extensively for military communications.

1962 Satellite communication begins with Telstar I.

6
19681969 Digitalization of telephone network begins.

19701975 PCM standards developed by CCITT.

19751985 High-capacity optical systems developed; the
breakthrough of optical technology and fully integrated switching
systems.

19801985 The first generation of modern cellular mobile networks
put into service. But it was all based on analog system:
1981 NMT-450 in Northern Europe
1983 AMPS in the United States.
1985 TACS in Europe and China
7
1985 Standardization for second generation digital cellular systems is initialized.

1992 GSM900 in World Wide.

1993 GSM1800 in Europe.

1994 GSM1900 was firstly commercial.

Global System for Mobile (GSM) is a second-generation digital cellular
telephone system.

GSM became the world's leading and fastest growing mobile standard, spanning
over 174 countries, serving more than one in ten of the world's population.
8
GSM offers circuit-switched with good voice quality, but it is providing data rates
of 9.6 kbps which is too slow.
In 1999 General Packet Radio Service (GPRS) reuses the existing GSM
infrastructure to provide higher data rate
It was lunched to increase the data rate to 115 kbps by:
Dsing the packet-switched in data transmission
Defining new coding scheme.
In 2001 Evolved Data rate for GSM Evolution (EDGE) offers data rate of 384
kbps by using new modulation scheme(8psk)

9
On other hand, In America there was another evolution for mobile
communication:
Advance Mobile Phone Service (AMPS) is a first-generation analogue
cellular telephone system standard that was developed in the late 1970s in N&S
American.
In 1983 (Digital AMPS) D-AMPS was lunched
Cellular Digital Packet Data (CDPD) is a packet-switched data service.
CDPD uses the existing AMPS network to transmit data at a rate of 19.2
kbps.

10
In 1993 Code Division Multiple Access (CDMA) is a second-generation digital
cellular telephone system that was first deployed.
CDMAOne describes a complete wireless system based on the TIA/EIA IS-95
CDMA standard, including IS-95A and IS-95B revisions.
IS 95A provides data rate up to 9.6Kbps/14.4Kbps
IS 95B Provides data rate up to 115.2Kbps
IS 95B is categorized as 2.5 G

CDMAOne provides a family of related services including cellular and fixed
wireless (wireless local loop).

11
3G Systems
In 2000 the ITU-T was responsible for the IMT-2000 specification, which is meant
to be a guideline for every 3G standard
Universal Mobile Telecommunication Service (UMTS) is the marketing name for
the 3G has two standardization bodies:
1- 3GPP which uses the W-CDMA technology.
2- 3GPP2 which uses the CDMA2000 technology.
12
WCDMA as a 3G Approach
The 3G solution for GSM is called WCDMA (Wideband CDMA).

WCDMA requires a new radio spectrum as it operates in ultra wide 5-MHz radio
channels.

WCDMA meets the IMT-2000 requirements of 384 kbps outdoors and 2 Mbps
indoors.

The earliest deployment was by NTT DoCoMo.

13
CDMA2000 as a 3G Approach
CDMA2000 represents a family of technologies that includes:
CDMA2000 1X
CDMA2000 1XEV.
CDMA2000 1X can double the voice capacity of CDMAOne networks and
delivers peak packet data speeds of 307 kbps in mobile environments.
CDMA2000 1xEV includes:
CDMA2000 1xEV-DO delivers peak data speeds of 2.4Mbps and supports
applications such as MP3 transfers and video conferencing
CDMA2000 1xEV-DV provides integrated voice and simultaneous high-
speed packet data multimedia services at speeds of up to 3.09 Mbps.
14
Migration towards 3G Systems
15
Greater than 2 Mbps User Data Rate
10 Different Frequency Bands
CDMA Low Power (PSD) Results in:
Low Detection Probability
Less Susceptible to Jamming
IMT-2000
CDMA2000
IS-95 W-CDMA
GSM
2 Mbps Global Roaming with a single handset
3G Systems & IMT2000
16
Why Wireless?
source Destination
Transmission medium
17
Why Wireless? (cont.)
The kinds of transmission medium :

1- Twisted-pair:
It is very low bandwidth and it is easily tapped either physically or by monitoring
its electromagnetic radiation

2- Coaxial cable:
It is greater bandwidth than twisted-pair but it is very expensive.

3- optical fibers:
It is very high bandwidth , very high bit rate and inherently transmission medium.

18
4- Radio (wireless):
It is greatly depending on the particular frequency of the
electromagnetic wave
Some of their advantages :
a- They are very flexible and suitable for all terrain.
b- Portable system can be installed very quickly
c- There are often the most cost-effective solution
19
Although, On a wired transmission link (copper or fiber optic), the characteristics of
the medium are very well controlled and easily predicted
It still fixed and limit the mobility of the user
While the wireless (Radio) telecommunication bridged the distances between
people who wish to Communicate while they move.
So, we will use the radio waves to transmit and receive.
But first we need to know the properties of these waves.

20
Wave Properties
A wave is defined by its Wave Length and Frequency.
The Wave Length () represents the distance traveled by the wave to move one
complete cycle. This complete cycle takes a duration named as the cycle
duration (t).
If one cycle occurs in one t, then a number of (1/t) cycles occur in one second.
Number of cycles per second is called Frequency.
t
If this duration = 1 sec, the frequency of
this wave will be 4 Hz
21
Wave Properties
Speed = Wave Length / Time of one Cycle = / t = x f
All Electromagnetic waves travel in air with a fixed speed equal to the speed of
light, no other phenomena move in a speed faster than the speed of light,
3 x 10
8
m/s.
Thus, for any electromagnetic wave, x f = 3 x 10
8
m/s.
From this formula it can be determined that the higher the frequency, the shorter
the wavelength and vise versa.
22
Wave Properties
Lower frequencies, with longer wavelengths, are better suited to transmission
over large distances, because they bounce on the surface of the earth and in
the atmosphere.
Television and FM radio are examples of applications, which use lower
frequencies.

Higher frequencies, with shorter wavelengths, are better suited to transmission
over small distances, because they are sensitive to such problems as obstacles
in the line of the transmission path. Higher frequencies are suited to small
areas of coverage, where the receiver is relatively close to the transmitter.
23
Analog to digital
The analog mobile systems have main restrictions of:
the limited capacity,
voice-only services
high operational cost.
different systems are incompatible in terms of equipment and operation, e.g NMT and
TACS.

While with digital systems such as GSM,
the available frequency spectrum is used more efficiently, leading to increased capacity
reductions in associated costs for network operators, equipment suppliers and
subscribers.

24
Analog to digital
Analog mobile systems were originally designed for voice.
However, digital mobile systems can support voice, data and a range of additional
services such as:
a short message service
call forwarding
ISDN compatible.

Analog mobile systems offered limited international roaming and a low level of
security.
Digital mobile systems, on the other hand, offers few restrictions on international
roaming and provides advanced security using ciphering and authentication.
25
Unlike fixed links, mobile radio transmissions suffer large fluctuation in both time
and space

During propagation, the radio signal experiences different effects (phenomenon)
which affect the signal quality
26
Signal degradation can be classified by type :
Path Loss
during distance covered by the radio signal, it is called Free space
path loss , it can be calculated by
LFS = 32.44 + 20 log F (MHz) +20 log d (Km)
Signal attenuation
Resulting from shadowing effects introduced by the obstacles between
transmitter and receiver
Fading of the signal
Caused by numerous effects all of which are related to the Radio
propagation phenomenon
27
the Radio propagation phenomenon
Reflection
Propagating wave impinges on an object which is large compared to
wavelength
E.g., the surface of the Earth, buildings, walls, etc.
Diffraction
Radio path between transmitter and receiver obstructed by surface with
sharp irregular edge
Waves bend around the obstacle, even when LOS does not exist
Scattering
Objects smaller than the wavelength of the propagating wave
E.g., foliage, street signs, lamp posts
28

29
These phenomena's of the radio propagation causes multi kind of fading:
1- the normal fading:
Fading means that the signal strength received fluctuates around a mean
value while changing the mobile position.
The reason for normal fading:
shadowing is the presence of obstacles like large buildings or hills in the path
between the site and the mobile
Multi path scattering from nearby objects.
Attenuation effects

30
2- The multi path fading:
Due to the reflected signals from the surrounding building. So, a
combination of direct and out-of-phase reflected waves at the receiver yields
attenuated signals (i.e. signal paths of different paths with different times of
arrival at the receiver)

31
But how will we use this radio frequencies to serve all users.
We must need to access techniques to use these frequencies.
32
Frequency Division Multiple Access (FDMA)
Strength
f1 f2 f3
Frequency
33
Time Division Multiple Access (TDMA)

Strength
34
Code Division Multiple Access (CDMA).

Frequency
Strength
35
FDMA, TDMA, vs CDMA
36
Wireless Challenges
To provide coverage for a large service area of a mobile network we have
two Options:

(A)Install one transceiver with high radio power at the center of the service
area

Drawbacks:
The mobile equipments used in this network should have high output
power in order to be able to transmit signals across the coverage area
So, Powerful transmitters & huge equipment are required.
The usage of the radio resources would be limited, So, Capacity is
limited to the frequency band allocated.

37
Wireless Challenges
(B) Divide the service area into smaller areas (cells)
Advantages:
Each cell as well as the mobile handsets will have relatively small
power transceivers.
The frequency spectrum might be reused in two far
separated cells. This yields:
1- Unlimited capacity of the system.
2- Good interference characteristics

So, The solution is going to Cellular Systems

38
The Area to be covered is divided into
small cells.
So,
Low Transmission power.
Smaller equipment size.
Capacity of the system can be
increased,
Cellular System Concepts

Ex.: In the figure:
Capacity of one big cell =
Capacity of the band Capacity of cellular design = 7 * Capacity of one big cell.
39
Reuse Pattern(Cluster):
Cells are grouped into Clusters
Available Band is distributed among the cells of the
cluster
Each frequency is reused after the same distance D
Reuse Plan:
(D/R)= 3N
N is the number of cells in a cluster .
Where R is the cell radius
5
2
3
4
7
1
6
5
N=7 Cell Cluster N=7 Cell Cluster
7 Cell Reuse Plan 7 Cell Reuse Plan
2
3
4
7
1
6
5
2
3
4
7
1
6
5
2
3
4
7
1
6
5
2
3
4
7
1
6
5
D
Cellular System Concepts Frequency reuse
40
For more efficient use of available spectrum and hence
enhancing the system capacity ,each cell is divided into
three sectors of 120
o

In each sector a directional antenna is used whose narrow
beams allow reusing the channels more often

Sectorization is suitable to use in dense urban areas
Cellular System Concepts Sectorization
41
Directional Antenna
Cellular System Concepts Sectorization
42
Omni Antenna
Cellular System Concepts Omni Sector
43
Course Outlines
UMTS air interface
UMTS Synchronization, accessing and handover
44
Course Outlines
UMTS air interface
UMTS synchronization, accessing, handover and
power control.
45
Definition of Coverage Areas
Location area
MSC area
PLMN area
Service area
Sector
area
Cell area
46
GSM 2G Architecture
47
2.5G Architectural
48
3G Architecture (UMTS)
49
The Mobile Services Switching Center (MSC)
The primary node in a CDMA network is the MSC. It is the node, which
controls calls both to MSs and from MSs. The primary functions of an MSC
include the following:
Administers its Base Station Controllers BSC(s).
Switches calls to/from mobile subscribers.
Records charging and accounting details
Provides the gateway functionality to other networks.
Service provisioning.
Control of connected BSCs.
Provides the gateway functionality to other networks.

50
Gateway Mobile Switching Center (GMSC):
Gateway functionality enables an MSC to interrogate a HLR in order to route a
mobile terminating call. It is not used in calls from MSs to any terminal other
than another MS.

For example, if a person connected to the PSTN wants to make a call to a
CDMA mobile subscriber, then the PSTN exchange will access the CDMA
network by first connecting the call to a GMSC

51
Visitor Location Register (VLR):
The role of a VLR in a CDMA network is to act as a temporary storage location for
subscription information for MSs, which are within a particular MSC service area.
Thus, there is one VLR for each MSC service area. This means that the MSC
does not
have to contact the HLR (which may be located in another country) every time the
subscriber uses a service or changes its status.
The VLR may be integrated with the MSC.
For the duration when the MS is within one MSC service area, then the VLR
contains a
complete copy of the necessary subscription details, including the following
information:
Identity numbers for the subscriber
Supplementary service information (e.g. Does the subscriber has call waiting
activated or not)
Activity of MS (e.g. idle or busy)
Current Location Area of MS

52
Home Location Register (HLR):
The HLR is a centralized network database that stores and manages all mobile
subscriptions belonging to a specific operator.
It acts as a permanent store for a persons subscription information until that
subscription is cancelled.
The primary functions of the HLR include:
Stores for each mobile subscriber:
Basic subscriber categories.
Supplementary services.
Current location.
Allowed/barred services.
Authentication data.
Subscription database management
Controls the routing of mobile terminated calls and SMS.

53
Operation and Maintenance Center (OMC)
The OMC provides the network operator with network operation and
maintenance services manages the subscriber information and implements
network planning, to enhance the overall working efficiency and service quality
of the system. As the maintenance functions have their respective emphases,
54
Serving GPRS Support Node SGSN
Ciphering, authentication, and IMEI check
Logical link management towards the MS
Connection - HLR, MSC, BSC and SMS-MSC
Packet routing & transfer
Charging data
Mobility management
Session management
55
Gateway GPRS Support Node GGSN
External interfaces
Traditional gateway functionality
Subscriber addresses publish
Session Management
Routing
Charging
56
AAA Server and Home Agent
AAA server
Authentication: PPP and mobile IP connections
Authorization: service profile and security key distribution and
management
Accounting: usage data for billing
Mobile IP Home Agent
Track location of mobile IP subscribers when they move from
one network to another
Receive packets on behalf of the mobile node when node is
attached to a foreign network and deliver
packets to mobiles current point of attachment
57
Main UTRAN elements
RNS (Radio Network Subsystem)
RNC (Radio Network Controller)
Node B
Interfaces
U
u
Interface (between UE and Node B)
I
u
Interface (between CN and RNS)
Iur Interface (between one RNS and another RNS)
Iub Interface (between RNC and Node B)

58
RNS (Radio Network Subsystem)
A full or partial network offering access between UE and Core
Network
Contains one RNC and one node B

59
RNC (Radio Network Controller)
The Radio Network Controller: Is the UTRAN element
responsible for:
The control of the radio resources of UTRAN.
It interfaces the CN (normally to one MSC and one SGSN).
Terminates the RRC (Radio Resource Control) protocol that defines the
procedures between the UE and UTRAN.
The RNC controlling a Node B is logically called the Controlling RNC
(CRNC) of that Node B.
In some cases the UE is connected to two RNSs in this case each one of
the has a separate logical role:
Serving RNS(SRNS) :It performs the Basic Radio Resource Management
operations like Power control and Handover decision.
Drift RNS(DRNS): The DRNC is any RNC other than the SRNC that
controls cells used by the mobile it also routes the data transparently to the
SRNS.
Note: A UE can have only one SRNS but more than one DRNS

60
Node B (RBS)
Logical Node controlling transmission and reception from
one or more cells
Conversion data from and to Uu interface (modulation and
de-modulation)
Error detection
Power control

61
3G Network main blocks
User Equipment (UE): By which the user can access the
network.
It consists of :
UMTS Subscriber Module (USIM): Holds the subscriber
identity, performs authentication algorithms, and stores authentication and
encryption keys.
Mobile Equipment (ME): Radio terminal used for radio
communication over the Uu interface.
62
General Protocol Model for UTRAN
Terrestrial Interfaces
UTRAN-related issues are visible
only in the Radio Network Layer.
Transport Network Layer is a
standard transport technology that is
selected to be used for UTRAN but
without any UTRAN-specific
dependence.
The Control Plane is used for all
UMTS-specific control signaling.
The User Plane is used for All user
information, such as the coded voice
in a voice call or the packets in an
Internet connection.
The Transport Network Control
Plane:
is used for control signaling in
the Transport Layer.
63
It does not include any Radio Network Layer information.
It includes the ALCAP protocol that is needed to set up the Data Bearer for the
User Plane.
It enables the independence of signaling bearers of control plane and data
bearers of user plane.
Transport Network User Plane
General Protocol Model for UTRAN
Terrestrial Interfaces
64
Iu, The UTRANCN Interface
Iu can have three different instances: Iu-CS, Iu-PS.
The original design goal was to develop one Iu interface, but it is realized that to
optimize User Plane transport for CS and PS is achieved by different transport tech
But One of the main design guidelines is that the Control Plane should be the same for Iu
CS and Iu PS.
65
Protocol Structure for Iu CS:
All planes in the Iu share a common ATM transport.
RANAP: Radio Access Network App. Protocol.
SCCP: Signaling Connection Control Part .
MTP3-b: the Message Transfer Part.
SSCF: Service Specific Coordination Function.
SSCOP: Service Specific Connection Oriented
Protocol.
AAL5 :ATM Adaptation Layer 5 segments the data to
ATM cells.
SSCF+SSCOP+AAL5=SAAL-NNI (Signaling ATM
Adaptation Layer for Network to Network Interfaces)
which are SS7 Broadband protocols for signaling in
ATM environment.
Q.2630.1 and adaptation layer Q.2150.1:the Signaling
Protocol for setting up AAL2 connections in User Plane.
66
Iu PS Control Plane Protocol Stack:
Control plane: It has alternative signaling route
which is IP-based.
M3UA:MTP3 User Adaptation Layer.
SCTP: Simple Control Transmission Protocol
is specifically designed for signaling transport
in the Internet
IP: Internet Protocol.
The GTP-U (User Plane part of the GPRS
Tunneling Protocol) is the multiplexing layer
that provides identities for individual packet
data

67
RANAP Protocol has the following functions:
Relocation. This function handles both SRNS Relocation and Hard Handover,
including the inter-system case to/from GSM.
Iu Release.
Reporting Unsuccessfully Transmitted Data.
Paging.
Management of tracing. if CN requests UTRAN to start recording all activity
related to a specific UEUTRAN connection.
UECN signaling transfer. signaling messages that are not interpreted by
UTRAN.
Management of overload; for example overload at the CN or UTRAN. A
simple mechanism is applied that allows stepwise reduction of the load and its
stepwise resumption, triggered by a timer.
Reset: CN or the UTRAN side of the Iu interface in error situations.
Location Reporting. Allowing the CN to receive information on the location of
a given UE.
68
Iu User Plane Protocol has the following Modes:
Transparent Mode: In this mode of operation the protocol does not perform any
framing or control.
Transparent operation: The User Plane performs framing of the user data into
segments of predefined size corresponds to AMR (Adaptive Multirate Codec)
speech frames, or to the frame sizes derived from the data rate of a CS data
call. Also, control procedures for initialization, rate control.
69
Iur, UTRAN Internal Interfaces
initially designed in order to support the inter-RNC soft
handover.
RNSAP: Radio Network System
Iur interface provides the following functions:
Support of basic inter-RNC mobility.
Support of SRNC relocation.
Support of inter-RNC cell and UTRAN
registration area update.
Support of inter-RNC packet paging.
Reporting of protocol errors.
Support of Dedicated Channel traffic
Establishment, modification& release of the
dedicated &shared channel in DRNC
Set-up and release of dedicated transport
connections across the Iur interface.
Transfer of DCH Transport Blocks between SRNC
&DRNC using the Frame Protocol for dedicated
channels (DCH FP).
Management of the radio links in the DRNS
70
Iur, UTRAN Internal Interfaces
Support of Common Channel traffic.
Set-up and release of the transport connection across the Iur for common
channel data streams (i.e. RACH, FACH and CPCH) using Common
Transport Channel Frame Protocol (CCH FP).
Avoiding the SRNC relocation procedure (via the CN). As we know the
SRNC is the RNC controlling the cell used for common or shared channel
transport
71
Iub RNCNode B Interface
Logical model for Node B Protocol stack of Iub
72
Iub RNCNode B Interface
NBAP (Node B Application Part) is divided into two components:
The common NBAP: Used in the common signaling link. It performs the
following:
Set-up of the first RL of a UE& selection of the traffic termination point.
Cell configuration.
Handling of the RACH/FACH/CPCH and PCH channels.
Initialization and reporting of Cell or Node B specific measurement.
Signaling that is not related to one specific UE already exists in NodeB.
The dedicated NBAP: used in the dedicated signaling link. It performs the
following:
Addition, release and reconfiguration of radio links for one UE context.
Handling of dedicated and shared channels.
Initialization and reporting of radio link specific measurement.
73
Course Outlines
UMTS air interface
power control.
74
Multiple Access Technologies
User 1 User 2 User 3
Time
Frequency
FDMA
User 1
User 2
User 3
Time
Frequency
TDMA
Time
Frequency
Code
CDMA
User3
User2
User1
Based on codes, all users obtain traffic
channels at the same time and on the same
frequency band, for example, WCDMA and
CDMA2000
Traffic channels on different frequency bands are
allocated to different users,for example, AMPS and
TACS
Traffic channels at different points of time are
allocated to different users, for example, DAMPS
and GSM
75
CDMA Principals
The core idea that makes CDMA possible was first explained by Claude
Shannon, a Bell Labs research mathematician

Shannon's work relates amount of information carried, channel
bandwidth, signal-to-noise-ratio, and detection error probability
It shows the theoretical upper limit attainable

In 1948 Claude Shannon published his landmark paper on information
theory, A Mathematical Theory of Communication.

He observed that "the fundamental problem of communication is that
of reproducing at one point either exactly or approximately a message
selected at another point." His paper so clearly established the
foundations of information theory that his framework and terminology are
standard today.
76
CDMA Principals
SHANNONS CAPACITY EQUATION
C = Bw log
2
[ 1 + S/N ]
Bw = bandwidth of the signal in Hertz
C = channel capacity in bits/second
S = signal power
N = noise power

77
Spread Spectrum
By a small amount of analysis in Shannon equation we can see that the:
bandwidth of the signal (Bw) is inversely proportional to the signal power

This result can be used to serve more than one user by the same frequency in
the same time by generating a new dimension to discriminate between the
different users and make the spreading process
So, the question is how to make the spreading process

f
Sf
The spectrum before spreading
information
f0
The spectrum after spreading
information
f0
Sf
f
78
Two Types of Spread Spectrum
Frequency- Hopping
Each users narrowband signal hops among discrete frequencies, and the
receiver follows in sequence
Frequency-Hopping Spread Spectrum (FHSS) CDMA is NOT currently
used in wireless systems, although used by the military

79
Two Types of Spread Spectrum
Direct Sequence
narrowband input from a user is coded (spread) by a user-unique
broadband code, then transmitted
broadband signal is received; receiver knows, applies users code,
recovers users data
Direct Sequence Spread Spectrum (DSSS) CDMA IS the method used in
IS-95 commercial systems

80
CDMA: Using A New Dimension
All CDMA users occupy the same frequency at the same time! Frequency and
time are not used as discriminators
CDMA operates by using CODING to discriminate between users
CDMA interference comes mainly from nearby users
Each user is a small voice in a roaring crowd -- but with a uniquely
recoverable
81
DSSS Spreading: Frequency-Domain View
information
pulse interference White noise
The improvement of
time-domain
information rate means
that the bandwidth of
spectrum-domain
information is spread.
The Y-coordinate is energy density.
The spectrum before despreading
information
Interference noise
Sf
f0
f
f0
The spectrum after despreading
information
Interference noise
Sf
f
f
Sf
The spectrum before spreading
information
f0
The spectrum after spreading
information
f0
Sf
f
82
Time domain and frequency domain
83
Spread Spectrum
Principle of Using Multiple Codes
Spreading
Sequence
A
Spreading
Sequence
B
Spreading
Sequence
C
Spreading
Sequence
C
Spreading
Sequence
B
Spreading
Sequence
A
Input
Data
X
Recovered
Data
X
X+A X+A+B X+A+B+C X+A+B X+A
Spread-Spectrum Chip Streams
ORIGINATING SITE DESTINATION
84
Advantages of Spread Spectrum
Give the ability of multiple access
Avoid interference arising from jamming signal or multi-path effects.
Covert operation:Difficult to detect
Achieve Privacy: Difficult to demodulate, (Noise like signal.)
Impossible to Eavesdrops on the signal expect using the same code
85
WCDMA Code Types
Channelization Codes (Orthogonal Codes)
Used to orthogonally code different data channels from BS, UE
Scrambling Codes (Spread Spectrum Codes)
BS Scrambling Codes: Used by UE to distinguish the desired BS
UE Scrambling Codes: Used by BS to distinguish the desired UE
Synchronization Codes
Primary Sync. Code: Fixed 256-bit code
Helps UE identify the presence of a WCDMA BS
Helps UE achieve Slot Synchronization
Secondary Sync. Codes: Group of 256-bit codes
Helps UE achieve Frame Synchronization
Pilot Codes
A full-time common Pilot (CPICH) provides coherent reference for UE receiver
Pilot data bits are embedded into each timeslot of the Dedicated Data Channel
Random Access Preamble Codes
Preamble Signatures; Used by BS to distinguish between UE making access attempts
Preamble Scrambling Codes; Used to identify which BS is being accessed
86
Types of codes in WCDMA
Downlink (NodeB to UE )
Scrambling Code: Identifies cell (sector).
Channelization Code: Identifies users in cell (Sector).
Scrambling Code A
Scrambling Code B
Scrambling Code C
Channelization
Code 1
Channelization
Code 2
Channelization
Code 3
Channelization
Code 1 Channelization
Code 2
Channelization
Code 2
Channelization
Code 1
87
Up Link (UE to NodeB )
Scrambling Code: Identifies user terminal.
Channelization Code: Identifies channels in user terminal.
Scrambling Code A
Scrambling Code B
Scrambling Code C
Channelization
Code 1
Channelization
Code 2
Channelization
Code 1
Channelization
Code 1
88
When you send data using Orthogonal Codes...
Orthogonal Codes
User 1
Data:
1 0 1
Multiply with Orthogonal Code
1 1 1-1
User 1 Orthogonal-spread
Data:
-1 1-1 1 1-1 1-1 -1 1-1 1
You send one orthogonal (channelization) code for every data bit!

If you want to send a digital 0, you transmit the assigned channelization code

If you want to send a digital 1, you transmit the inverted channelization code
Transmitted chips
Data
Orthogonal Code
D/A conv.
-1 +1 -
1
89
OVSF Codes
OVSF Code Space: 8 users; one 8-bit code per user
Chip Rate = 3.840 Mcps
480 kb/s 480 kb/s 480 kb/s 480 kb/s 480 kb/s 480 kb/s 480 kb/s 480 kb/s
1
1-1 11
1-11-1 1-1-11 11-1-1 1111
1-11-11-11-
1
1-11-1-11-
11
1-1-111-1-
11
1-1-11-111-
1
11-1-111-1-
1
11-1-1-1-
111
1111-1-1-1-
1
11111111
90
OVSF Codes
Chip Rate = 3.840 Mcps
480 kb/s 480 kb/s 480 kb/s 480 kb/s
1
1-1 11
1-11-1 1-1-11 11-1-1 1111
1-11-11-11-
1
1-11-1-11-
11
1-1-111-1-
11
1-1-11-111-
1
11-1-111-1-
1
11-1-1-1-
111
1111-1-1-1-
1
11111111
OVSF Code Space: 5 users; one user has 4x data bandwidth
User with 4x Bit Rate
= Unusable Code Space
1.92 Mb/s
91
Orthogonal Variable Spreading Factor [OVSF] codes are the channelization codes used for
signal spreading in the uplink and downlink which achieves variable bit rate according to
required service.
For this code tree each parent is orthogonal to subsequent upper branches only.
SF=No. of chips/symbol. Note that bit rate increase with decrease of SF.
92
The code used for scrambling of the uplink Channels may be
of either long or short type, There are 2
24
long (Gold code)
and 2
24
short uplink scrambling codes. Uplink scrambling
codes are assigned by higher layers.
For downlink physical channels, a total of 2
18
-1 = 262,143
scrambling codes can be generated. Only scrambling codes k
= 0, 1, , 8191 are used.
In the downlink direction 512 of scrambling codes are used to
identify the cells in the downlink so downlink planning is
required

93
Cellular CDMA Code Layering

Function
IS-95A/B
cdma2000
(1x, RC 3~9)
WCDMA
Data
Channelization
Orthogonal
64 chip
OVSF
4 ~ 256 chip
OVSF
4 ~ 512 Chip
BTS Separation Short PN Code
2
15
chip
Same as
IS-95
38,400 chips
of 2
18
Gold code
Downlink
Data
Encryption
Long PN Code
(2
42
1) chip
Same as
IS-95
None*
Data
Channelization
None
(only one data
channel at a time)
OVSF
4 ~ 256 chip
OVSF
4 ~ 256 Chip
MS
Separation
Long PN Code
(2
42
1) chip
Same as
IS-95
38,400 chips
of 2
25
Gold code
Uplink
Data
Scrambling
Due to MS
Separation Code
Same as
IS-95
None*

*WCDMA implements encryption at higher layers
94
Soft capacity
In CDMA the number of subscribers has flexible relation with service level as
the operator is allowed to increase the error frame ratio slightly during peak
traffic hours to gain more usable channels, so enhancing system capacity
Soft capacity is realized by Breathing & Shrinking function which is :
For adjacent base stations
1. If the number of in call subscribers increase. So, more interference will
occur. So, base station will decrease the transmitting power of its pilot to
shift some subscriber to the adjacent base station through soft handoff.
So, base station decreases its interference. This process called
(exhaling).
2. If the number of in call subscribers decrease. So, interference will be
small. So, base station will increase the transmitting power of its pilot to
shift the subscriber of adjacent base station to its own coverage area
through soft hand off. This process called (inhaling)

95
The Principle of RAKE Receiver
The RAKE technology can overcome the multi-path fading and enhance
the receive performance of the system.
Receive set
Correlator 1
Correlator 2
Correlator 3
Searcher correlator
Calculate the
time delay and
signal strength

Combiner The combined
signal
t
t
s(t) s(t)
96

d
1

d
2

t t t
d
3

transmission receiving
Raker combination
noise
Rake Receiver
97
Development of Throughput Rates
98
Development of Bit Rate vs. Coverage
99
QoS of Different Services
Time delay
Quality (BER)
background
conversational
streaming
interactive
100
QoS of Different Services
101
UMTS services
Conversational Services
Speech service:
Real time conversational service require the low time delay from end to
end , and the uplink and the downlink service bandwidth is symmetrical .
Adopt AMR ( adaptive multi rate ) technique (WCDMA).
12.2, 10.2, 7.95, 7.40, 6.70, 5.90, 5.15 and 4.75kbps.
The bit rate of AMR voice can be controlled by the RAN according to
quality of voice service .
Video phone (WCDMA):
The requirement of time delay is similar to the voice service
Via CS connection :adopt ITU-T Rec.H.324M (AMR-H.263)
Via PS connection :adopt IETF SIP or H.323

102
UMTS services
Streaming Services
(e.g. Audio and Video streaming )
Interactive Services
(e.g. Web browsing , and online games )
Background Services
(e.g. Email , Fax , and SMS )
103
W-CDMA Specification
Multiple access method DS-CDMA (DS: Direct Spread)
Duplexing method
FDD
Inter-cell synchronization Asynchronous
Bandwidth 5 MHZ
Chip rate 3.84 Mcps
Carrier spacing Flexible with 100/200kHz carrier raster
Frame length Unit 10 ms
Data modulation Downlink: complex QPSK, Uplink: HPSK
Multi-rate concept Variable spreading factor and/or multi-code
Maximum data rate 2 Mbps (indoor)/384 kbps (mobile)
104
Course Outlines
UMTS principles and Advantages
UMTS air interface
power control
105
DOCUMENTTYPE
TypeUnitOrDepartmentHere
TypeYourNameHere TypeDateHere
1850 1900 1950 2000 2050 2100 2150 2200 2250
Reserve
IMT 2000
GSM 1800
DECT
MSS
MSS
IMT 2000 PHS
MSS IMT 2000
IMT 2000
MSS
IMT 2000
IMT 2000
IMT 2000
MSS
IMT 2000
MSS
A D B EF A B C
MSS
MSS MSS
GSM 1800, PCS
D F E B B C
ITU
identifications
Europe
China
Japan,
Korea (w/o PHS)
North America
1700 1750 1800 950 1000 800 850 900
IMT 2000 IMT 2000
GSM
Cellular
PDC
Cellular
P C S
MSS
GSM
Previous IMT-2000 terrestrial bands
New IMT-2000 terrestrial bands
Frequency allocation for IMT2000
In 1992 230MHz in 2GHZ Band was allocated to IMT2000
2nd of June, 2000 additional bands for IMT-2000, 800MHz, 1.8GHz, and 2.5GHz Band.
DOCUMENTTYPE
1850 1900 1950 2000 2050 2100 2150 2200 2250
Reserve
IMT 2000
GSM 1800
DECT
MSS
MSS
IMT 2000 PHS
MSS IMT 2000
IMT 2000
MSS IMT 2000
IMT 2000
IMT 2000
MSS
IMT 2000
MSS
A D B EF A B C
MSS
MSS MSS
GSM 1800, PCS
D F E B B C
ITU
identifications
Europe
China
Japan,
Korea (w/o PHS)
North America
1700 1750 1800 950 1000 800 850 900
IMT 2000 IMT 2000
GSM
Cellular
PDC
Cellular
P C S
MSS
GSM
Previous IMT-2000 terrestrial bands
New IMT-2000 terrestrial bands
MSS: Mobile Satellite Service
106
1850 1900 1950 2000 2050 2100 2150 2200 2250
ITU
1850 1900 1950 2000 2050 2100 2150 2200 2250
1880 MHz 1980 MHz
1885 MHz 2025 MHz
2010 MHz
IMT 2000
2170 MHz
IMT 2000
2110 MHz 2170 MHz
MSS MSS
China
MSS MSS MSS FDD FDD
1920 MHz
TDD TDD
1850 1900 1950 2000 2050 2100 2150 2200 2250
ITU
1850 1900 1950 2000 2050 2100 2150 2200 2250
1880 MHz 1980 MHz
1885 MHz 2025 MHz
2010 MHz
IMT 2000
2170 MHz
IMT 2000
2110 MHz 2170 MHz
MSS MSS
China
MSS MSS MSS FDD FDD
1920 MHz
TDD TDD
Occupation of the IMT-2000 frequency
spectrum in China
FDD mode: 1920 MHz ~ 1980MHz/2110 MHz ~ 2170 MHz
TDD mode: 1880 MHz ~ 1920 MHz/2010 MHz ~ 2025 MHz
107
UMTS FDD and TDD
FDD (Frequency Division Duplex)
TDD (Time Division Duplex)
Base station
Mobile Terminal
Base station Mobile Terminal
Up Down
TS TS
108
Agenda: Part 1
CDMA Wireless Technology
Evolution from 2G to 3G
The CDMA Transmitter
Voice Coding
CRC Coding
FEC Coding
Interleaving
Channelization Coding (Orthogonal/Walsh Codes)
Spread Spectrum Multiple Access Coding (PN Codes)
Serial-to-Parallel Data Conversion
Spectral Containment Filtering
I/Q Modulation
109
From 2G to 3G
Circuit-Switched Voice
Circuit-Switched Data
Circuit-Switched Voice
Low-Speed Circuit-Switched Data
Packet Data
High-Speed Circuit-Switched Data
Short Message Service (SMS)
2G
3G
9.6, 14.4 kbps
up to 2 Mbps ?
110
3G Wireless Multiple Access
2 data channels
(voice, control)
2 data channels
(voice, control)
Voice Conversation
2 data channels
(14 kbps data, control)
1 data channels
(control)
Uplink Packet Data
3 data channels
(voice, video,
control)
3 data channels
(voice, video,
control)
Videoconference
4 data channels
(384 kbps data,
voice, video, control)
4 data channels
(384 kbps data,
voice, video, control)
Videoconference with 384 kbps Data
111
Multiple Access Approaches
Frequency
Division
Multiple
Access
Each User has a unique
frequency

(1 voice channel per user)

All users transmit at the
same time

AMPS, NMT, TACS
U
s
e
r

1

U
s
e
r

2

U
s
e
r

3

Frequency
Each Transmitter has a unique
spreading code

Each Data Channel has a unique
orthogonal code

Many users share the same
frequency and time

IS-95, cdma2000, WCDMA
Frequency
Code
Division
Multiple
Access
Spread
Spectrum
Multiple
Access
Multiple
Transmitters
and
Multiple Data
Channels
Each User has a unique
time slot

Each Data Channel has a unique
position within the time slot

Several users share the
same frequency

IS-136, GSM, PDC
Time
Division
Multiple
Access
U
s
e
r

1

U
s
e
r

2

U
s
e
r

3

U
s
e
r

N

Time
112
Data
Multiplexer

Transmit
Gating
The TDMA Transmitter
Control/
Signaling
Data
Filtering
+
RF
Modulation
RF
Out
Sync.
Bits
User Data
Channel N
Error
Protection
Timeslot
Selector
Error
Protection
User Data
Channel 1
Error
Protection
Vocoder
Error
Protection
The Multiplexer allows various data
channels to share the same timeslot.
The timeslot selector allows multiple
transmitters to share the same carrier
frequency, by assigning a unique timeslot
to each transmitter.
113
The TDMA Transmitter
Example of GSM Downlink Transmission;
Tail bits, Flag, Training sequence and guard period are multiplexed with the user data bits
Downlink Timeslot to User 1
Data Multiplexing
GP
(8.25)
TB
(3)
Flag
(1)
Encrypted bits
(57)
Training sequence
(26)
Encrypted bits
(57)
TB
(3)
Flag
(1)
Slot 1 Slot 3 Slot 4 Slot 5 Slot 6 Slot 7 Slot 8
Downlink Timeslot to User 2
GP
(8.25)
TB
(3)
Flag
(1)
Encrypted bits
(57)
Training sequence
(26)
Encrypted bits
(57)
TB
(3)
Flag
(1)
Slot 2
Data Multiplexing
114
The CDMA Transmitter
Filtering
+
RF
Modulation
RF
Out
Linear
Summation

Control/
Signaling
Data
Sync.
Bits
User Data
Channel N
Error
Protection
Error
Protection
User Data
Channel 1
Error
Protection
Vocoder
Error
Protection
Spread
Spectrum
(PN or Gold)
Code
Spread Spectrum (PN) Codes
provide unique identification
of each transmitter
Frequency
User 1
User 2
User 3
...
Orthogonal
Code 4
Orthogonal
Code N
Orthogonal
Code 3
Orthogonal
Code 2
Orthogonal
Code 1
Orthogonal Codes provide unique
identification of each data channel
115
Pulse
Shaping
Filter
RF
Ou
t
Data
Channel
1
Data
Channel
N
Linear
Summatio
n

Spread Spectrum
Code
(PN Code or Gold
Code)
FEC
Coding
Orthogon
al Code 1
Orthogon
al Code N
1:2
Demux
Pulse
Shaping
Filter
I/Q
Modulato
r
CRC
Coding
Inter-
leaving
CRC
Coding
Complex
Multiplie
r
(I + jQ)
FEC
Coding
Inter-
leaving
D/A
D/A
SSC_Q SSC_I
I
Q
I
Q
I
Q
Allows for
error
detection in
the receiver
Allows for
error
correctio
n in the
receiver
Improves
error
correction
in the
receiver
Gives a
unique
identity to
each data
stream
Maps
digital bits
to analog
signals
0 +1
1 -1
Provides
2x higher
data rate
(WCDMA,
cdma2000
downlink)
Gives a unique
identity to this
transmitter
Contains
transmitte
d
frequency
spectrum
Allows both
signals from 1:2
Demux to share
the same RF
bandwidth
Pre-coded
data
(bits)
Symbols Chips
Cellular CDMA Transmitter
116
Voice Coding
Example: Two ways to hear the sax player
Record the sax player onto a CD... ... and play back the CD
20 MB per song
Write down the notes he plays... ... and have a friend play the same notes
20 kB per song
117
Voice Coding
Vocoding

Human Voice:
ss, ff, sh ~20% of time
ah, v, mm , ~80% of time
Transmitted Parameters
8~12 kb/s typical,
vs.
64 kbps for log-PCM
32 kbps for ADPCM
Vocoder
White Noise Generator
Pulse Generator
E
Voice Re-Synthesis at the Receiver
Noise
parameters
Pitch
parameters
H(s)
Filter poles
correspond to
resonances of the
vocal tract
Speech
Output
H(s)
118
ACELP/AMR Voice Coding
A/D
Linear
Predictive
Coding
(LPC)
Filter
Codebook
Index
Codebook
Perceptual
Weighting
Error
Analysis
Speech
Generator
Vocoder
Output Bits
MUX
Voice, Tone
Activity
Detectors
Mode Indication bits
Comfort Noise
Tone Emulation
DTX Indication
E
(+)
(-)
Prediction
Error
Benefits of Activity Detection:
1)
2)
119
Digital Cellular Error Correction
Digital Cellular
Analog Cellular
Transmitted Signal Received Signal + Noise
Transmitted Signal Received Signal + Noise
120
Digital Cellular Error Correction
Example: Mailing a letter in the US
Extra (redundant) symbols in address help correct lost symbols
ZIP codes used to detect errors in the address
John Doe
123 East 45th Street
New York City, New York 10017
JD
123 E 45
NYC NY
With minimal data...
Errors are uncorrectable
With redundant data...
Errors are correctable
Bandwidth utilization: 13 bytes Bandwidth utilization: 48 bytes
121
CRC Coding
Cyclic-Redundancy Check (CRC) Coding
Identifies corrupted data
If there is an error, the receiver can request that data be re-sent
For voice data errors, the vocoder discards any bad data
Checksum
011010
Original Data
100101101010
CRC
Generator
Original Data
100101101010
CRC
Generator
Re-Generated Checksum
011011
Transmitter
Receiver
If Checksums do not match,
there is an error
Received Data
100101001010
Received Checksum
011010
RF
Transmission Path
122
CRC Coding
Cyclic-Redundancy Check (CRC) Coding: Example
22-bit in /6-bit out CRC: g(x) = [ x
6
+ x
2
+ x + 1 ]
Input Data b
1
b
2
b
3
b
4
b
5
b
22

D
CRC (6 bits)
c
1
c
2
c
3
c
4
c
5
c
6

D D D D D
0
0
Input Data (22 bits)
b
1
b
2
b
3
b
4
b
5
b
22

Output
Output
clock
D Shift Register (one unit delay)
All switches up for first 22 bits;
All switches down for last 6 CRC bits
123
FEC Coding
Error Correction
How do you correct errors at the receiver?
Send
message
many times?
010010110,
010010110,
010010110,
010010110,
010010110,
-
-
-
Forward
Error
Correction!
Up to 6x data expansion...
But the most powerful results
124
FEC Coding
FEC Coding approaches
Block Codes (Hamming Codes, BCH Codes, Reed-Solomon Codes)
Data is processed into unique Codewords
Each Codeword can be positively identified even if one or more bits are
corrupted
Example: New York City is a codeword for NYC
Continuous Codes (Convolutional Codes, Turbo Codes)
Data is processed continuously through FEC generator
Resulting data stream has built-in redundancy that can be extracted to correct
bit errors.

IS-95, cdma2000, and WCDMA utilize Convolutional Codes low-rate data
Powerful error correction
Simple implementation allows low-latency, real-time processing
cdma2000 and WCDMA utilize Turbo Codes for high rate data
Most powerful error correction
More processing power (MIPS) required for decoding
125
FEC Coding: The Convolutional Coder
Convolutional Coding

Original Data
00011011...
FEC
Generator
FEC Encoded data
1010011100110110...
Original Data
00011011
Viterbi
Decoder
Transmitter
Receiver
RF
Transmission Path
126
FEC Coding: Convolutional Coder
Convolutional Coding: Example
R = 1/2 , k=2 Convolutional Coder
For every input bit, there are two output bits
The maximum time delay is 2 clock cycles
D D Input Data 1010...

MUX
X
2k+1

X
2k

clock
127
FEC Coding: Convolutional Coder
FEC Coding: Example
State [00]
State [01]
State [10]
State [11]
State [00]
State [01]
State [10]
State [11]
State Diagram
11
00
10
01
11
00
01
10
x
2k
x
2k+1
= Coder Output
Clock
Cycle
Current
Input
Delayed
Inputs
Outputs
D
k
D
k-1
D
k-2
X
2k
X
2k+1
1 0 0 0 0 0
2 1 0 0 1 1
3 0 1 0 0 1
4 1 0 1 0 0
5 1 1 0 1 0
6 1 1 1 0 1
7 0 1 1 1 0
8 0 0 1 1 1
X
2k
= (D
k
) XOR (D
k-2
)
X
2k+1
= (D
k
) XOR (D
k-1
)

XOR (D
k-2
)
STATE
128
FEC Coding: Viterbi Decoder
Viterbi Decoding Process:
1) Calculate Branch Metric for each possible
state transition
BM = (|R
1
- T
1
|
+
|R
2
- T
2
|)
2

R
1
, R
2
= Received data values
T
1 ,
T
2
= Transmitted data values

2) Calculate Cumulative Path Metric
Path Metric is sum of N previous
Branch Metrics (N is memory depth
of Viterbi Decoder).

3) Calculate surviving Path
The surviving path is the path
with the lowest Path Metric.

4) Extract the error-corrected Data
The error-corrected data sequence
is equal to the first bit of each state
code along the surviving path
Example:
Received Signal R
1
,R
2
= [0 1]
T
1
,T
2
= [0 0]
T
1
,T
2
= [0 1]
T
1
,T
2
= [1 1]
T
1
,T
2
= [1 1]
T
1
,T
2
= [0 0]
T
1
,T
2
= [0 1]
T
1
,T
2
= [1 0]
T
1
,T
2
= [1 0]
State [00]
State [01]
State [10]
State [11]
State [00]
State [01]
State [10]
State [11]
1
0
1
1
1
4
4
0
= Branch Metric
129
Viterbi Decoding (No noise)
1 1
1 1
0 1
0 1
0 0
0 0
1 0
1 0
4 1 0 1
1
4
0
1 4
1
0
1
4
4
1 0
0 1
[0 0]
[0 1]
[1 0]
[1 1]
[0 0]
[0 1]
[1 0]
[1 1]
0
0
0
0
Path with lowest path
metric has the least
likelihood of error
Output --->> 0 1 0 1 1
130
Viterbi Decoding (With noise)
1 1
1.1 0.8
0 1
-.3 1.2
0 0
0.6 0.5
1 0
0.8 0.3
3.61 2.25
1.21 1.21
0.09
2.25
0.81
0.81
.25 2.25
6.25
0.25
1.21
1.21
Transmitted Data:
Received Data:
[0 0]
[0 1]
[1 0]
[1 1]
[0 0]
[0 1]
[1 0]
[1 1]
.09
.34
1.55
1.80
0.81 0.81
Output --->> 0 1 0 1 1
1.15 2.36
3.80
1.96
131
Block Interleaving
Time
A
m
p
l
i
t
u
d
e

To Viterbi
decoder
Original Data Samples
1 2 3 4 5 6 7 8 9
Interleaving
Matrix
1 2 3
4 5 6
7 8 9
Transmitter
Interleaved Data Samples
1 4 7 2 5 8 3 6 9
RF
Transmission Path
Interleaved Data Samples
1 4 7 2 5 8 3 6 9
Errors Clustered
De-
Interleaving
Matrix
1 2 3
4 5 6
7 8 9
De-Interleaved Data Samples
1 2 3 4 5 6 7 8 9
Receiver
Errors Distributed
132
Turbo Coding
Turbo Codes
Outperform Convolutional codes
Requires much more processing power; data packets may be decoded off-line
Used for high-bit rate data and packet data
Interleaving (time diversity) enhances error correction
Encoder #1
Encoder #2
MUX
Data
Decoded
Data
DE-
MUX
Decoder #2
D
P1
P2
D
P1
P2
D
Turbo Encoder Turbo Decoder
Interleaver
Interleaver
I
n
t
e
r
l
e
a
v
e
r

D
e
-
I
n
t
e
r
l
e
a
v
e
r

Decoder #1
133
Cellular CDMA
Cellular CDMA = SSMA + Orthogonal Coding
(IS-95, cdma2000, WCDMA)
Spread Spectrum Multiple Access (SSMA):
Allows multiple CDMA transmitters to share the same Radio Frequency

Orthogonal Coding:
Allows multiple data channels to co-exist within each CDMA transmission
134
The CDMA Cocktail Party
What do YOU hear...
If you only speak Japanese?
If you only speak English?
If you only speak Italian?
If you only speak Japanese, but the Japanese-
speaking person is all the way across the room?
If you only speak Japanese, but the Spanish-
speaking person is talking very loudly?
135
Code Correlation
Input Data
+1 -1
+1
+1 -1 +1
Divide by
Code Length
Case I: Autocorrelation using a PN Code
Receiver and Transmitter use identical code at same time offset
+1 1 +1 +1 1 -1 +1 -1 +1 1 +1 +1 1 -1 +1 -1 +1 1 +1 +1 1 -1 +1 -1
PN code used
in Transmitter
x x x
+8 -8 +8
Integrate
Result
Integrate Integrate Integrate
+1 1 +1 +1 1 -1 +1 -1 -1 +1 -1 -1 +1 +1 -1 +1 +1 1 +1 +1 1 -1 +1 -1
Transmitted
Sequence
= = =
+1 +1 +1 +1 +1 +1 +1 +1 -1 1 1 1 1 1 1 -1 +1 +1 +1 +1 +1 +1 +1 +1
= = =
+1 1 +1 +1 1 -1 +1 -1 +1 1 +1 +1 1 -1 +1 -1 +1 1 +1 +1 1 -1 +1 -1
PN Code
Used in Receiver
x x x
Transmitter
Receiver
136
Code Correlation
Input Data
+1 -1
+1
+1 1 +1 +1 1 -1 +1 -1 +1 1 +1 +1 1 -1 +1 -1 +1 1 +1 +1 1 -1 +1 -1
+1 1 +1 +1 1 -1 +1 -1 -1 +1 -1 -1 +1 +1 -1 +1 +1 1 +1 +1 1 -1 +1 -1
-1 +1 1 +1 +1 1 -1 +1 +1 -1 +1 1 +1 +1 1 -1 -1 +1 +1 +1 1 -1 +1 +1
-1 1 1 +1 1 +1 1 -1 -1 1 1 +1 +1 +1 +1 -1 -1 1 +1 +1 +1 +1 +1 -1
PN code used
in Transmitter
Transmitted
Sequence
PN Code
Used in Receiver
-4 0 2
Integrate
Result
-0.5
0
0.25
Divide by
Code Length
Case II: Cross-Correlation using PN Codes
Receiver and Transmitter use different codes
x x x
= = =
x x x
= = =
Transmitter
Receiver
137
Code Correlation
Input Data
+1 -1
+1
-1 +1 1 +1 +1 1 +1 -1 -1 +1 1 +1 +1 1 +1 -1 -1 +1 1 +1 +1 1 +1 -1
-1 +1 1 +1 +1 1 +1 -1 +1 1 +1 1 1 +1 1 +1 -1 +1 1 +1 +1 1 +1 -1
-1 +1 1 +1 +1 1 +1 -1 +1 +1 +1 +1 +1 +1 +1 +1 -1 -1 +1 1 +1 +1 1 +1
+1 +1 +1 +1 +1 +1 +1 +1 +1 1 +1 1 1 +1 1 +1 +1 1 1 1 +1 1 1 -1
Orthogonal code
in Transmitter
Transmitted
Sequence
Orthogonal Code
used in Receiver
8 0 -4
Integrate
Result
+1
0
-0.5
Divide by
Code Length
Case III: Correlation using Orthogonal Codes
(a) Same Orthogonal code; (b) Different Orthogonal codes; (c) Same code with non-zero time offset
x x x
= = =
x x x
= = =
Transmitter
Receiver
138
Cellular CDMA (SSMA + OC)
2 data channels
(voice, control)
PN3 + OC1 + OC2
2 data channels
(14 kbps data, control)
PN4 + OC1 + OC2
3 data channels
(voice, video, control)
PN2 + OC1 + OC2 + OC3
3 data channels
(voice, video, control)
PN5 + OC1 + OC2 +
OC3
4 data channels
(384 kbps data, voice, video, control)
PN6 + OC1 + OC2 + OC3 + OC4
4 data channels
(384 kbps data, voice, video, control)
PN2 + OC4 + OC5 + OC6 + OC7
2 data channels
(voice, control)
PN1 + OC1 + OC2
1 data channels
(control)
PN1 + OC3
Voice
Conversation
Uplink
Packet Data
Videoconference
Videoconference
with Data
Pilot, Broadcast
PN1 + OC
P
+ OC
B

Pilot, Broadcast
PN2 + OC
P
+ OC
B

139
I/Q Modulation
I/Q (In-phase/Quadrature) Modulation: Definition
Two data streams are multiplied by a common carrier frequency, but at phase
offsets of 0 degrees (cosine)and 90 degrees (sine)
Data Stream #1 I
Data Stream #2 Q
90
o

SUM

cos ( 2 t f
RF
t)
I sin (2 t f
RF
t)
+ Q cos (2 t f
RF
t)
+1
-1
+1
-1
140
I/Q Modulation
Graphical representation of an I/Q modulated
signal
I
Q
( I = 1, Q = 1 )
( I = -1, Q = -1 )
( I = -1, Q = 1 )
( I = 1, Q = -1 )
1 Modulation Symbol represents 2 data bits
Modulation efficiency = 2 bits/symbol
RF Carrier amplitude
RF Carrier phase angle
141
I/Q Modulation
By multiplying by the sin and cosine at the receiver, the original I and Q data streams
are recovered
90
o

SUM

cos (2 t f
RF
t)
I sin (2 t f
RF
t)
+ Q cos (2 t f
RF
t)
LPF
LPF
Data Stream #1 I
Data Stream #2 Q
+1
-1
+1
-1
142
Data Filtering
Data Filtering: Why?
RF Modulator
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
-60
-50
-40
-30
-20
-10
0
10
20
Frequency
Baseband filtering of data stream is
required to contain RF bandwidth
143
Data Filtering
Ordinary Channel Filter: Impulse Response
0 20 40 60 80 100 120 140 160 180 200
-2
0
2
4
6
x 10
-5
Channel Filter
(Digital Chebyshev, 10-tap, Fc = 0.2Fs)
0 10 20 30 40 50 60 70 80 90 100
-1
-0.5
0
0.5
1
1.5
2
Ringing may interfere
with subsequent bit decisions
Time
Time
144
Raised-Cosine Data Filter
Raised Cosine Filter: Equations
0 50 100 150 200 250 300
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
; 0
;
2
sin 1
2
;
)
`
|
.
|
\
|

T
T T
T
t
e
o
T
T T
T
/ ) 1 (
/ ) 1 ( / ) 1 (
/ ) 1 ( 0
t o e
t o e t o
t o e
+ >
+ s s
s s
= ) (e H
o = 0.1
o = 0.3
o = 0.5
o = 0.7
o = 0.9
WCDMA uses alpha = 0.22
Frequency
145
Raised-Cosine Data Filter
Raised Cosine Filter: Impulse Response
-0.4
-0.2
0
0.2
0.4
0.6
0.8
1
o = 0.01
(Narrow filter)
o = 0.3
(Wide filter)
t1 t2 t3 t4 t5 t6 t7 t8 t9
Notes:

1) Ringing = 0 at exact time instants where future data points are to be sampled
2) Low alpha provides narrowest spectrum; best for reducing adjacent channel interference
3) High alpha provides lowest ringing amplitude; best for reducing ISI
4) Theoretically, even filters with very low alpha provide zero ringing at future sample points
5) Practically, low-alpha filters create greater ISI when there is timing jitter present
Time
146
Data Filtering: The RRC Filter
Eye Diagram
Raise
d
Cosin
e
Filter
Chebyshe
v
Filter
0 50 100 150
-0.4
-0.2
0
0.2
0.4
0.6
0.8
1
1.2
1.4
0 50 100 150
-0.4
-0.2
0
0.2
0.4
0.6
0.8
1
1.2
1.4
Time
Time
147
The WCDMA Transmitter
Data
0110101
.
Add
CRC
Bits
Add
FEC
Bits
I/Q
Mod.
OVSF Code
Generator
Error
Detection
Error
Correction
Orthogonal
Coding
RF
Out
FIR
Filter
FIR
Filter
Inter-
leaver

Complex
Spreading
(DL)

HPSK
Spreading
(UL)
SSMA
Spreading,
PAPR
Reduction
Spectral
Containment
RF Modulation
Channelization
Code
BS code (DL) or
UE code (UL)
Data
Channel
Code
Spread Spectrum
Code
(Gold Code)
Scrambling
Code
Fading
Resistance
S/P
148
Air interface protocol model and channels
Logical channels: Define what
type of data is transferred.
Transport channels define how
and with which type of
characteristics the data is
transferred by the physical
layer.
Physical channels define the
exact physical characteristics
of the radio channels.
149
WCDMA Physical Channels

Base
Station

(BS)

User
Equipment

(UE)

P-CCPCH- Primary Common Control Physical Channel
SCH - Synchronization Channel
P-CPICH - Primary Common Pilot Channel
S-CPICH - Secondary Common Pilot Channel(s)
Channels broadcast to all UE in the cell
DPDCH - Dedicated Physical Data Channel
DPCCH - Dedicated Physical Control Channel
PDSCH - Physical Downlink Shared Channel
Dedicated Connection Channels
PICH - Paging Indicator Channel
Paging Channels
S-CCPCH - Secondary Common Control Physical Channel
PCPCH Physical Common Packet Channel
AP-AICH - Access Preamble Acquisition Indicator Channel
CD/CA-AICH -Collision Detection/Ch.Assignment
Indicator Ch.
CSICH - CPCH Status Indicator Channel
PRACH - Physical Random Access Channel
AICH - Acquisition Indicator Channel
Random Access and Packet Access Channels
150
WCDMA Downlink Physical Channels
Common Downlink Physical Channels

P-CCPCH Primary Common Control Physical Channel
- Broadcasts cell site information
- Broadcasts cell SFN; Timing reference for all DL channels
SCH Synchronization Channel
- Fast Synch. codes 1 and 2; time-multiplexed with P-CCPCH
S-CCPCH Secondary Common Control Physical Channel
- Transmits idle-mode signaling and control information to UEs
P-CPICH Common Pilot Channel
S-CPICH Secondary Common Pilot Channel (for sectored cells)
PDSCH Physical Downlink Shared Channel
- Transmits high-speed data to multiple users

Dedicated Downlink Physical Channels
DPDCH Dedicated Downlink Physical Data Channel
DPCCH Dedicated Downlink Physical Control Channel
- Transmits connection-mode signaling and control to UEs
151
WCDMA Downlink Physical Channels
Downlink Indication Channels
AICH (Acquisition Indicator Channel)
Acknowledges that BS has acquired a UE Random Access attempt
(Echoes the UEs Random Access signature)
PICH (Paging Indicator Channel)
Informs a UE to monitor the next paging frame
AP-AICH (Access Preamble Acquisition Indicator Channel)
Acknowledges that BS has acquired a UE Packet Access attempt
(Echoes the UEs Packet Access signature)
CD/CA-ICH (Collision Detection/Channel Assignment Indicator Channel)
Confirms that there is no ambiguity between UE in a Packet Access attempt
(Echoes the UEs Packet Access Collision Detection signature)
Optionally provides available Packet channel assignments
CSICH (CPCH Status Indicator Channel)
Broadcasts status information regarding packet channel availability
3GPP TS 25.211
152
Downlink Logical Channels
Common Downlink Logical Channels
BCCH (Broadcast Control Channel)
Broadcasts cell site and system identification to all UE
PCCH (Paging Control Channel)
Transmits paging information to a UE when the UEs location is unknown
CCCH (Common Control Channel)
Transmits control information to a UE when there is no RRC Connection
SHCCH (Shared Channel Control Channel)
Control channel associated with shared traffic channels (TDD mode only)
CTCH (Common Traffic Channel)
Traffic channel for sending traffic to a group of UEs.

Dedicated Downlink Logical Channels
DCCH (Dedicated Control Channel)
Transmits control information to a UE when there is a RRC Connection
DTCH (Dedicated Traffic Channel)
Traffic channel dedicated to one UE
3GPP TS 25.301 5.3.1.1
153
Downlink Transport Channels
Common Downlink Transport Channels
BCH (Broadcast Channel)
Continuous transmission of system and cell information
PCH (Paging Channel)
Carries control information to UE when location is unknown
Pending activity indicated by the PICH (paging indication channel)

FACH (Forward Access Channel)
Used for transmission of idle-mode control information to a UE
No closed-loop power control

DSCH (Downlink Shared Channel)
Carries dedicated control and/or traffic data; shared by several UEs

Dedicated Downlink Transport Channels
DCH (Dedicated Channel)
Carries dedicated traffic and control data to one UE

154
WCDMA Downlink (FDD)
BCCH
Broadcast Control Ch.
PCCH
Paging Control Ch.
CCCH
Common Control Ch.
DCCH
Dedicated Control Ch.
DTCH
Dedicated Traffic Ch. N
BCH
Broadcast Ch.
PCH
Paging Ch.
FACH
Forward Access Ch.
DCH
Dedicated Ch.
P-CCPCH(*)
Primary Common Control Physical Ch.
S-CCPCH
Secondary Common Control Physical Ch.
DPDCH (one or more per UE)
Dedicated Physical Data Ch.
DPCCH (one per UE)
Dedicated Physical Control Ch.
Pilot, TPC, TFCI bits
SSC
i

Logical Channels
(Layers 3+)
Transport Channels
(Layer 2)
Physical Channels
(Layer 1)
Downlink
RF Out
DPCH (Dedicated Physical Channel)
One per UE
DSCH
Downlink Shared Ch.
CTCH
Common Traffic Ch.
CPICH
Common Pilot Channel
Null Data
Data
Encoding
Data
Encoding
Data
Encoding
Data
Encoding
Data
Encoding
PDSCH
Physical Downlink Shared Channel
AICH
(Acquisition Indicator Channel)
PICH
(Paging Indicator Channel )
Access Indication data
Paging Indication bits
AP-AICH
(Access Preamble Indicator Channel )
Access Preamble Indication bits
CSICH
(CPCH Status Indicator Channel )
CPCH Status Indication bits
CD/CA-ICH
(Collision Detection/Channel Assignment )
CPCH Status Indication bits
S/P
S/P
C
ch

S/P
S/P
S/P
S/P
S/P
S/P
S/P
S/P
Cell-specific
Scrambling
Code
I+jQ
I/Q
Modulator
Q
I
C
ch

C
ch

C
ch

C
ch

C
ch

C
ch

C
ch

C
ch 256,1

C
ch 256,0

E
G
S

PSC
G
P
E
Sync Codes(*)
* Note regarding P-CCPCH and SCH
Sync Codes are transmitted only in bits 0-255 of each timeslot;
P-CCPCH transmits only during the remaining bits of each timeslot
E
Filter
Filter
Gain
Gain
Gain
Gain
Gain
Gain
Gain
Gain
Gain
Gain
SCH (Sync Channel)
DTCH
Dedicated Traffic Ch. 1
DCH
Dedicated Ch.
Data
Encoding
M
U
X
M
U
X
CCTrCH
DCH
Dedicated Ch.
Data
Encoding
155
Common Pilot Channel
Downlink CPICH (Common Pilot Channel)
Pilot Symbol Data (10 symbols per slot)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 0
1 Frame = 15 slots = 10 mSec
1 timeslot = 2560 Chips = 10 symbols = 20 bits = 666.667 uSec
A A A A A A A A A A A A A A A A A A A A A A A A A
-A A A -A A -A -A A A -A -A A A -A -A A A -A -A A A -A A A -A
Slot 0 Slot 1 Slot 14
Antenna 1
Symbols
Antenna 2
Symbols
If transmit diversity is used, then the pilot symbols are as shown for each antenna:
156
Sync Channel /
Primary Common Control Channel
Downlink SCH / P-CCPCH
Broadcast Data (18 bits)
SSC
i
BCH Spreading Factor = 256
1 Slot = 0.666 mSec = 18 BCH data bits / slot
2304 Chips 256 Chips
SCH BCH
PSC
1 2 3 4 5 6 7 8 9 10 11 12 13 14 0
157
Secondary Common Control Channel
Downlink S-CCPCH
Spreading Factor = 256 to 4
1 Slot = 0.666 mSec = 2560 chips = 20 * 2
k
data bits; k = [0..6]
20 to 1256 bits 0, 2, or 8 bits
Data TFCI or DTX Pilot
0, 8, or 16 bits
1 2 3 4 5 6 7 8 9 10 11 12 13 14 0
158
Paging Indication Channel
Paging Indicator Channel (PICH)
Spread with SF=256 Channelization code
Each UE looks for a particular paging indicator, PI
A paging indicator set to 1 indicates that the UE should read the
S-CCPCH of the corresponding frame.
b
1
b
0

288 bits for paging indication 12 bits (undefined)
One radio frame (10 ms)
b
287
b
288
b
299

159
Dedicated Control/Data Channel
Downlink DPCCH/DPDCH Frame
Data 2 TFCI Data 1 TPC
1 Slot = 0.666 mSec = 2560 chips = 10 x 2^k bits, k = [0...7]
SF = 512/2
k
= [512, 256, 128, 64, 32, 16, 8, 4]

DPDCH
Pilot
DPDCH DPCCH DPCCH
The DPDCH carries user traffic, layer 2 overhead bits, and layer 3 signaling data.

The DPCCH carries layer 1 control bits: Pilot, TPC, and TFCI
Downlink Closed-Loop Power Control steps of 1 dB, 0.5 dB
1 2 3 4 5 6 7 8 9 10 11 12 13 14 0
160
Downlink Data Rates
Variable Data Rates on the Downlink: Examples
Bits/Frame Bits/ Slot
DPCCH
Channel Bit
Rate
(kbps)
Channel
Symbol
Rate
(ksps)
SF
TOTAL DPDCH DPCCH TOTAL DPDCH
TFCI TPC PILOT
15 7.5 512 150 60 90 10 4 0 2 4
120 60 64 1200 900 300 80 60 8 4 8
1920 960 4 19,200 18,720 480 1280 1248 8 8 16
Coded Data
1.920 Mb/sec
(19,200 bits
per 10 mSec frame)

S/P
Converter

Channel Coding
(OVSF codes at 3.84 Mcps)
960 kb/sec
161
Downlink DPDCH/DPCCH Slot Formats
14 480 240 16 320 56 232 8 8* 16 15
14A 480 240 16 320 56 224 8 16* 16 8-14
14B 960 480 8 640 112 464 16 16* 32 8-14
15 960 480 8 640 120 488 8 8* 16 15
15A 960 480 8 640 120 480 8 16* 16 8-14
15B 1920 960 4 1280 240 976 16 16* 32 8-14
16 1920 960 4 1280 248 1000 8 8* 16 15
16A 1920 960 4 1280 248 992 8 16* 16 8-14
DPDCH
Bits/Slot
DPCCH
Bits/Slot
Slot
Format
#i
Channel
Bit Rate
(kbps)
Channel
Symbol
Rate
(ksps)
SF Bits/
Slot
NData1 NData2 NTPC NTFCI NPilot
Transmitted
slots per
radio frame
NTr
0 15 7.5 512 10 0 4 2 0 4 15
0A 15 7.5 512 10 0 4 2 0 4 8-14
0B 30 15 256 20 0 8 4 0 8 8-14
1 15 7.5 512 10 0 2 2 2 4 15
1B 30 15 256 20 0 4 4 4 8 8-14
2 30 15 256 20 2 14 2 0 2 15
2A 30 15 256 20 2 14 2 0 2 8-14
2B 60 30 128 40 4 28 4 0 4 8-14
3 30 15 256 20 2 12 2 2 2 15
3A 30 15 256 20 2 10 2 4 2 8-14
3B 60 30 128 40 4 24 4 4 4 8-14
Notes:
1) Zero-TFCI slot formats
are used when there is
only one data service
on the DCH.
2) Slot formats A and B
are used during
compressed mode
operation

162
Time-Embedded Pilot Symbols
DL: Time-multiplexed with DPDCH
UL: Transmitted on Q-channel along with TPC, TFCI, FBI bits
Npilot = 4 Npilot = 8 Npilot = 16
Symbol # 0 1 0 1 2 3 0 1 2 3 4 5 6 7
Slot #1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
00
01
00
10
11
11
10
01
11
01
10
10
00
00
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
00
01
00
10
11
11
10
01
11
01
10
10
00
00
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
10
10
01
00
01
10
00
00
10
11
01
11
00
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
00
01
00
10
11
11
10
01
11
01
10
10
00
00
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
10
10
01
00
01
10
00
00
10
11
01
11
00
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
10
01
11
01
10
10
00
00
11
00
01
00
10
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
10
00
00
10
11
01
11
00
11
11
10
10
01
00
01

Pilot Bit Patterns, Downlink DPDCH (Data Channel)
Note:
Shaded portions are the
Frame Synchronization
Words (FSW)
163
Transmit Power Control (TPC) Bits
TPC Bits
2, 4, or 8 bits per slot depending on slot format
TPC
Command
N
TPC
= 2 N
TPC
= 4 N
TPC
= 8
Up (1) 11 1111 11111111
Down (0) 00 0000 00000000

164
TFCI Bits
TFCI (Transport Format Combination Indicator)
Used when multiple services are multiplexed onto one DPDCH
Data Channel 1
Data Channel 2
Data Channel N Channel Coding
Channel Coding
Channel Coding
Coded Composite
Transport Channel
(CCTrCH)
TFI 1
TFI 2
TFI N
MUX
MUX
TFCI Word
32 bits
Channel Coding
10 bits
165
Downlink Data Coding, Multiplexing
Conv. Coding R=1/3
304
304
#2 344
688
688
#1 344
420
344 76
Radio frame FN=4N+1 Radio frame FN=4N+2 Radio frame FN=4N+3 Radio frame FN=4N
Traffic data (122x2)
Add CRC bits
Add Tail bits
2nd interleaving
420 420 420
344 76 344 76 344 76
#1 76 #2 76 #3 76 #4 76
804
260
244
Tail 8
CRC16
360
112
Tail 8
96
96
CRC 16
Rate matching
1st interleaving
Add CRC bits
Layer 3 Control data
Add Tail bits
Conv. Coding R=1/3
#2 344 #1 344
Radio Frame
Segmentation
slot segmentation
30 ksps DPCH
Rate matching
1st interleaving
244
Traffic @ 12.2 kbps L3 Data @ 2.4 kbps
28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28
MUX: Pilot, TPC, TFCI 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12
600 bits (300 symbols) 600 bits (300 symbols) 600 bits (300 symbols) 600 bits (300 symbols)
Data from second 244-bit packet
166
Downlink Data Coding, Multiplexing, continued
Conv. Coding R=1/3
304
304
#2 344
688
688
#1 344
420
344 76
Add CRC bits
Add Tail bits
2nd interleaving
420 420 420
344 76 344 76 344 76
#1 76 #2 76 #3 76 #4 76
804
260
244
Tail 8
CRC16
360
112
Tail 8
96
96
CRC 16
Rate matching
1st interleaving
Add CRC bits
Add Tail bits
Conv. Coding R=1/3
#2 344 #1 344
Radio Frame
Segmentation
slot segmentation
30 ksps DPCH
Rate matching
1st interleaving
244
28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28 28
MUX: Pilot, TPC, TFCI 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12
167
Downlink Data Coding, Multiplexing
Turbo Coding R=1/3
280
280
#2 9050
18100
18100
#1 9050
9120
9050 70
2nd interleaving
9120 9120 9120
9050 70 9050 70 9050 70
#1 70 #2 70 #3 70 #4 70
11568
7712
3840
Termination
bits
CRC16
360
112
Tail 8
96
96
CRC 16
Rate matching
1st interleaving
Conv. Coding R=1/3
#2 9050 #1 9050
Radio Frame
Segmentation
slot segmentation
480 ksps DPCH
Rate matching
1st interleaving
3840
Traffic @ 384 kbps L3 Data @ 2.4 kbps
MUX: Pilot, TPC, TFCI
9600 bits (4800 symb.) 9600 bits (4800 symb.) 9600 bits (4800 symb.) 9600 bits (4800 symb.)
3840
CRC16
3840
Concatenate Add Tail bits
Add CRC bits Add CRC bits
12 11568 12
608 608 608
32 32 32
608 608 608
32 32 32
608 608 608
32 32 32
608 608 608
32 32 32
168
Multi-Code Transmission
Downlink DPCCH/DPDCH Frame
Data 2 TFCI Data 1 TPC Pilot
Primary
DPCCH/DPDCH
Data 4 Data 3
Additional
DPCCH/DPDCH
Data N Data N-1
Additional
DPCCH/DPDCH
169
Downlink Shared Channel
PDSCH Frame
Data (30 kbps to 1920 kbps)
SF = [256, 128, 64, 32, 16, 8, or 4]
Notes:

The PDSCH has no embedded Pilot, TFCI, or TPC. Therefore, it must always be associated with an active DPCCH.
The associated DPCCH provides the necessary Pilot, TFCI, and TPC bits for the PDSCH.
The PDSCH can change its spreading ratio every frame, as indicated by the TFCI on the DPCCH
Any orthogonal code under the PDSCH Root Channelization Code may be utilized
Multiple PDSCHs may be assigned to one UE
1 2 3 4 5 6 7 8 9 10 11 12 13 14 0
170
Downlink Scrambling Codes
Used to distinguish Base Station transmissions on Downlink
Each Cell is assigned one and only one Primary Scrambling Code
The Cell always uses the assigned Primary Scrambling Code for the Primary and Secondary CCPCHs
Secondary Scrambling Codes may be used over part of a cell, or for other data channels
Primary SC
0
Secondary
Scrambling
Codes
(15)
Secondary
Scrambling
Codes
(15)
Secondary
Scrambling
Codes
(15)
Secondary
Scrambling
Codes
(15)
Code Group #1 Code Group #64
8192 Downlink Scrambling Codes
Each code is 38,400 chips of a 2
18
- 1 (262,143 chip) Gold Sequence
Primary SC
7
Primary SC
504
Primary SC
511
171
Downlink Scrambling Code Generation
10 mSec Gold Code formed by Modulo-2 Addition of 38,400 chips from two m-sequences
Initial Conditions:
x(0) =1; X(1)... X(17) = 0
y(0) ... Y(17) = 1
I
Q
1
1 0
0 2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
17
17
16
16
15
15
14
14
13
13
12
12
11
11
10
10
X
Y
Primary Scrambling code i (where i = 0,...,511) is generated
by offsetting the X sequence by (16*i) clock cycles from the Y sequence
172
WCDMA Uplink (FDD)
Uplink
RF Out
UE
Scrambling
Code
I+jQ
I/Q
Mod.
Q
I
Ch
c

E
E
I

Filter
Filter
CCCH
Common Control Ch.
DTCH (packet mode)
Dedicated Traffic Ch.
RACH
Random Access Ch.
PRACH
Physical Random Access Ch.
DPDCH #1
CPCH
Common Packet Ch.
PCPCH
Physical Common Packet Ch.
Data
Coding
Data
Coding
DPDCH #3 (optional)
DPDCH #5 (optional)
DPDCH #2 (optional)
DPDCH #4 (optional)
DPDCH #6 (optional)
E
Q

DPCCH
Dedicated Physical Control Ch.
Pilot, TPC, TFCI bits
Ch
d

G
c

G
d

j
Ch
d,1
G
d

Ch
d,3
G
d

Ch
d,5
G
d

Ch
d,2
G
d

Ch
d,4
G
d

Ch
d,6
G
d

Ch
c
G
d

Ch
c

E
Ch
d

G
c

G
d

j
RACH Control Part
PCPCH Control Part
E
j
E
DCCH
Dedicated Control Ch.
DTCH
Dedicated Traffic Ch. N
DCH
Dedicated Ch.
Data
Encoding
DTCH
Dedicated Traffic Ch. 1
DCH
Dedicated Ch.
Data
Encoding
M
U
X
CCTrCH
DCH
Dedicated Ch.
Data
Encoding
173
WCDMA Uplink Physical Channels
Uplink Physical Channels

Common Uplink Physical Channels
PRACH Physical Random Access Channel
- Used by UE to initiate access to BS
PCPCH Physical Common Packet Channel
- Used by UE to send connectionless packet
data

Dedicated Uplink Physical Channels
DPDCH Dedicated Physical Data Channel
DPCCH Dedicated Physical Control Channel
- Transmits connection-mode signaling and
control to BS
174
Uplink Transport Channels
Uplink Transport Channels

Common Uplink Transport Channels

RACH Random Access Channel
- Carries access requests, control information, short data
- Uses only open-loop power control
- Subject to random access collisions

CPCH Uplink Common Packet Channel
- Carries connectionless packet data to PCPH
Dedicated Uplink Transport Channels

DCH Dedicated Channel
- Carries dedicated traffic and control data from one UE

175
Uplink DPDCH/DPCCH
Uplink DPDCH/DPCCH
Coded Data, 10 x 2^k bits, k=06 (10 to 640 bits)
Dedicated Physical Data Channel (DPDCH) Slot (0.666 mSec)
Pilot FBI TPC
Dedicated Physical Control Channel (DPCCH) Slot (0.666 mSec)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
I
Q
TFCI
DPCCH: 15 kb/sec data rate, 10 total bits per DPCCH slot
PILOT: Fixed patterns (3, 4, 5, 6, 7, or 8 bits per DPCCH slot)
TFCI: Transmit Format Combination Indicator (0, 2, 3, or 4 bits)
FBI: Feedback Information (0, 1, or 2 bits)
TPC: Transmit Power Control bits (1 or 2 bits); power adjustment in steps of 1, 2, or 3 dB
176
Uplink DPDCH/DPCCH
Uplink DPDCH/DPCCH Slot Formats
Slot Format #i Channel Bit Rate
(kbps)
Channel Symbol
Rate (ksps)
SF Bits/
Frame
Bits/
Slot
N
data

0 15 15 256 150 10 10
1 30 30 128 300 20 20
2 60 60 64 600 40 40
3 120 120 32 1200 80 80
4 240 240 16 2400 160 160
5 480 480 8 4800 320 320
6 960 960 4 9600 640 640

Slot
Form
at #i
Channel Bit
Rate (kbps)
Channel Symbol
Rate (ksps)
SF Bits/
Frame
Bits/
Slot
Npilot NTPC NTFCI NFBI Transmitted
slots per
radio frame
0 15 15 256 150 10 6 2 2 0 15
0A 15 15 256 150 10 5 2 3 0 10-14
0B 15 15 256 150 10 4 2 4 0 8-9
1 15 15 256 150 10 8 2 0 0 8-15
2 15 15 256 150 10 5 2 2 1 15
2A 15 15 256 150 10 4 2 3 1 10-14
2B 15 15 256 150 10 3 2 4 1 8-9
3 15 15 256 150 10 7 2 0 1 8-15
4 15 15 256 150 10 6 2 0 2 8-15
5 15 15 256 150 10 5 1 2 2 15
5A 15 15 256 150 10 4 1 3 2 10-14
5B 15 15 256 150 10 3 1 4 2 8-9

DPDCH (Dedicated Physical Data Channel) Slot Formats
DPCCH (Dedicated Physical Control Channel) Slot Formats
177
FBI (Feedback Information) Field
FBI Field
S Field
0, 1, or 2 bits
Used for SSDT signaling
during soft handover
D Field
0 or 1 bit
Provides feedback information
for closed-loop transmit diversity
0, 1, or 2 bits total depending on Slot Format
SSDT (Site Selection Diversity Transmission) is an enhanced soft handover process
The UE determines the cell with the strongest received signal, and indicates this primary cell selection using the S Field.
Cells other than the primary cell suspend transmission, so that overall downlink interference is reduced.
178
Uplink Data Coding, Multiplexing
Conv. Coding R=1/3
360
402
600
Add CRC bits
Add Tail bits
2nd interleaving
600 600 600
490 110
110 110 110 110
804
260
244
Tail 8
CRC16
360
112
Tail 8
96
96
CRC 16
1st interleaving
Add CRC bits
Add Tail bits
Conv. Coding R=1/3
Rate Matching
slot segmentation
60 kbps
DPDCH
1st interleaving
244
40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40
402 Frame Segmentation
804
#1a 490 #2a 490 #1b 490 #2b 490
Frame Segmentation 90 90 90 90
490 110 490 110 490 110
179
Uplink Data Coding, Multiplexing
Turbo Coding R=1/3
360
9525
23160
11580
9600
9525 75
2nd interleaving
9600 9600 9600
9525 75 9525 75 9525 75
75 75 75 75
11568
7712
3840
Termination
bits
CRC16
360
112
Tail 8
96
96
CRC 16
Rate matching
1st interleaving
Conv. Coding R=1/3
Frame Segmentation
slot segmentation
960 kbps DPDCH
1st interleaving
3840
Traffic @ 384 kbps L3 Data @ 2.4 kbps
9600 bits (9600 symb.) 9600 bits (9600 symb.) 9600 bits (9600 symb.) 9600 bits (9600 symb.)
3840
CRC16
3840
Concatenate Concatenate
Add CRC bits Add CRC bits
12 11568 12
640 640 640 640 640 640 640 640 640 640 640 640
11580
9525 9525 9525
Frame Segmentation 90 90 90 90
180
Uplink Channelization Codes for HPSK
Special Restrictions on OVSF Codes on the Uplink (for HPSK)
If only one DPDCH is used:
SF of 4 ~ 256 may be used
OVSF Channelization Code is C
SF,K
where K = SF/4
If two through six DPDCHs are used:
SF of 4 must be used for all six DPDCHs
DPDCH_1 , DPDCH_2 must use OVSF code C
4,1

4,3

4,2

1
1 -1
1 1
1 1 1 1
1 1 -1 -1
1 -1 1 -1
1 -1 -1 1
C
1,0
C
2,0
C
2,1
C
4,0
C
4,1
C
4,2
C
4,3
DPCCH
DPDCH 1, 2
DPDCH 3, 4
DPDCH 5, 6
181
Uplink Scrambling Code
Uplink Scrambling Code (38,400 chips of 2
25
Gold Code)
Note:
c
2
(quadrature component) is a 16,777,232 chip delayed version of the code, c
1

Code n is created using a 24-bit key [n
0
... n
23
] for the initial conditions:

x
n
(0) = n
0 ;
x
n
(1) = n
1
, x
n
(23) = n
23
; x
n
(24)=1
y(0) = y(1) = = y(23) = y(24) = 1
X
Y
MSB
LSB
Decimate
1:2
C
long 1,n

C
long 2,n

w
0
= {1 1}
w
0
= {1 -1}
C
scr

I
Q
182
WCDMA Physical Layer Procedures
Physical Layer Timing and procedures
BS Downlink timing
Fast Synchronization Codes
Synchronization Code 1 (PSC)
Synchronization Code 2 (SSC
i
)
Used by UE to distinguish desired Base Station
8192 possible codes, 64 Scrambling Code Groups
Slot Synchronization
System Timing Synchronization
Soft Handover
Random Access protocol
Packet Access protocol
Inter-Frequency Handover
183
Course Outlines
UMTS principles
UMTS advantages
UMTS air interface
power control
184
Downlink Transmission Timing
Secondary SCH
Primary SCH
t
S-CCPCH,k
10 ms Frame
P-CCPCH, (SFN modulo 2 = 0) P-CCPCH, (SFN modulo 2 = 1)
CPICH (Common Pilot Channel)
AICH access slots
#0 #1 #2 #3 #14 #13 #12 #11 #10 #9 #8 #7 #6 #5 #4
Any PDSCH

t
PICH
t
DPCH,n
Common Pilot
Channel
Primary CCPCH
(Broadcast Data)
Secondary CCPCH
(Paging, Signaling)
Paging Indicator Channel
SCH (PSC+SSC)
P-CCPCH
S-CCPCH
PICH
AICH
PDSCH
DPCH
t
S-CCPCH,k
= N x 256 chips

t
DPCH,n
= N x 256 chips
t
PICH
= 7680 chips (3 slots)

3GPP TS 25.211 7.0
k:th S-CCPCH
PICH for n:th S-CCPCH
n:th DPCCH/DCDPH

Downlink Shared Channel
Dedicated Physical
Control/Data Channel
185
Synchronization Codes
Synchronization Codes (PSC, SSC)

Broadcast by BS
First 256 chips of every SCH time slot
Allows UE to achieve fast synchronization in an asynchronous system
Primary Synchronization Code (PSC)
Fixed 256-chip sequence with base period of 16 chips
Provides fast positive indication of a WCDMA system
Allows fast asynchronous slot synchronization
Secondary Synchronization Codes (SSC)
A set of 16 codes, each 256 bits long
Codes are arranged into one of 64 unique permutations
Specific arrangement of SSC codes provide UE with frame timing, BS code group
P-CCPCH
(PSC + SSC + BCH)
SSC
i
PSC
186
Primary Synchronization Code
Primary Synchronization Code (PSC)

let a = <1, 1, 1, 1, 1, 1, -1, -1, 1, -1, 1, -1, 1, -1, -1, 1>
PSC(1...256) = < a, a, a, -a, -a, a, -a, -a, a, a, a, -a, a, -a, a, a >
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Note: PSC is transmitted Clear (Without scrambling)
SSC
i
SCH BCH
PSC
187
Secondary Synchronization Code Group
16 Fixed 256-bit Codes; Codes arranged into one of 64 patterns

slot number
Scrambling
Code Group
#1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #13 #14 #15
Group 1 1 1 2 8 9 10 15 8 10 16 2 7 15 7 16
Group 2 1 1 5 16 7 3 14 16 3 10 5 12 14 12 10
Group 3 1 2 1 15 5 5 12 16 6 11 2 16 11 15 12
-

-

-

-

-

-

-

-

-

Group 62 9 10 13 10 11 15 15 9 16 12 14 13 16 14 11
Group 63 9 11 12 15 12 9 13 13 11 14 10 16 15 14 16
Group 64 9 12 10 15 13 14 9 14 15 11 11 13 12 16 10

Note:
The SSC patterns positively identify one and only one of the 64 Scrambling Code Groups.
This is possible because no cyclic shift of any SSC is equivalent to any cyclic shift of any other SSC.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
SSC
1

SSC
2

SSC
3

SSC
4

SSC
5

SSC
6

SSC
7

SSC
8

SSC
9

SSC
10

SSC
11

SSC
12

SSC
13

SSC
14

SSC
15

SSC
16

SSC
i
SSC
1
SSC
15
188
Slot Synchronization
Slot Synchronization using Primary Synchronization Code
BCH
Data
PSC
[1]
BCH
Data
PSC
[2]
BCH
Data
PSC
[3]
BCH
Data
PSC
[4]
BCH
Data
PSC
[15]
Matched Filter
(Matched to PSC)
10 mSec Frame (15 slots x 666.666 uSec)
Matched
Filter
Output
time
P-CCPCH
(PSC)
189
Frame Synchronization, SCG ID
Frame Synchronization using Secondary Synchronization Code
BCH
Data
SSC
[1]
BCH
Data
SSC
[2]
BCH
Data
SSC
[3]
BCH
Data
SSC
[4]
BCH
Data
SSC
[15]
Matched Filter

Matched to SSC code
group pattern
10 mSec Frame (15 slots x 666.666 uSec)
Matched
Filter
Output
time
SSC
[2]
SSC
[3]
SSC
[4]
SSC
[1]
SSC
[6]
SSC
[7]
SSC
[8]
SSC
[5]
SSC
[10]
SSC
[11]
SSC
[12]
SSC
[9]
SSC
[14]
SSC
[15]
SSC
[13]
SSC Code Group Pattern provides
Positive ID of Scrambling Code Group
Remember, no cyclic shift of any SSC is equal to any other SSC
190
Random Access
Random Access Attempt and AICH Indication
Pre-
amble
Pre-
amble
Pre-
amble
AICH
RACH
No
Ind.
No
Ind.
Acq.
Ind.
RACH
message part
(UE Identification)
UE
BS
4096 chips
(1.066 msec)
191
Random Access Procedure
Prior to initiating a Random Access attempt,
the UE receives:

The preamble scrambling code for this cell
The available random access signatures and set of available RACH sub-
channels
The available spreading factors for the message part
The message length (10 ms or 20 ms)
Initial preamble power parameter
The power-ramping factor Power Ramp Step [integer > 0]
The parameter Preamble Retrans Max [integer > 0]
The AICH transmission timing parameter [0 or 1]
The power offset AP
p-m
between preamble and the message part.
Transport Format parameters

192
Random Access Preamble Signatures
Random Access Preamble Signature Symbols
Signature P0 P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12 P13 P14 P15
0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1
2 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1
3 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1
4 1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1
5 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1
6 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1
7 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1
8 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1
9 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1
10 1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1
11 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1
12 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1
13 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 -1
14 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1
15 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 1

Preamble codes are 16-long Orthogonal Codes.
Preamble = [ P
0
, P
1
, P
15
] repeated 256 times (4096 chips total).
Preamble codes help the BS distinguish between UE making simultaneous Random Access Attempts.
193
Random Access Scrambling Codes
Random Access Preamble Scrambling Codes

Preamble Scrambling Code is a 4096-chip segment of a 2
25
-long Gold
Code
The UE targets one BS by using the BSs indicated preamble scrambling
code

All UE accessing this cell
shall use Random Access
Preamble Spreading Code
n2
All UE accessing this cell
shall use Random Access
Preamble Spreading Code
n1
194
Acquisition Indicator Channel
Acquisition Indicator Channel (AICH)
Transmits Acquisition Indicators in response to UE Access Attempts
AIs are derived from the UEs Access Preamble Signature
Identifies the UE which is the target of the AICH response
1024 chips
AS #0 AS #1 AS #i AS #14
a
1
a
2
a
0
a
31

a
30
AI part
20 ms
AS #14 AS #0
(Transmission Off)
=
=
15
0
,
s
j s s j
b AI a
195
Random Access Message
Random Access Message
Sent only after positive AICH indication
Random Access Message (10, 20, 40, or 80 bits per slot)
RACH Data Slot (0.666 mSec)
Pilot (8 bits)
RACH Message Slot (0.666 mSec)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
I
Q
TFCI (2 bits)
196
Random Access Offset Timing
Random Access Procedure
Set of available RACH sub-channels determined by upper layers, sent over BCH.
UE derive available access slots in the next full access slot set and selects slot
based on pseudo-random algorithm
#0 #1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #13 #14
Access slot set 1 Access slot set 2
AICH access slot
RX at UE
PRACH access
slot
TX at UE
RACH sub-channel
number
P P
P P
P P
P
P
P
# 0
# 1
# 11
# 2
# 3

# 10
radio frame: 10 ms radio frame: 10 ms
SFN mod 2 = 0 SFN mod 2 = 1
#0 #1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #13 #14
+ every 12
th
access slot
+ every 12
th
access slot
+ every 12
th
access slot
+ every 12
th
access slot
+ every 12
th
access slot
+ every 12
th
access slot
{
197
Acquisition and Synchronization
Physical Layer Procedures
1) UE Acquisition and Synchronization
Initiate Cell Synchronization
P-CCPCH
(PSC + SSC + BCH)
UE Monitors Primary SCH code, detects peak in matched filter output
Slot Synchronization Determined ------>
UE Monitors Secondary SCH code, detects SCG and frame start time offset
Frame Synchronization and Code Group Determined ------>
UE Determines Scrambling Code by correlating all possible codes in group
Scrambling Code Determined ------>
UE Monitors and decodes BCH data
BCH data, Super-frame synchronization determined ------>
Cell Synchronization Complete
UE adjusts transmit timing to match timing of BS + 1.5 Chips
198
Random Access
2) UE Requests System Access and Registration
Cell Synchronization Complete
P-CCPCH
(PSC + SSC + BCH)
UE Reads Random Access parameters from BS;
Calculates Random Access probe power
Initiate Random Access Attempt;
Respond to Authentication challenge
When system Registration is complete,
UE enters Idle mode
199
Establishing a Dedicated Channel
3) Establishing a Dedicated Channel
UE in Idle Mode
BS Begins transmission of downlink DPCCH/DPDCH
UE Establishes chip and frame sync to UTRAN
UE begins transmission of Reverse Link Channel,
Responds to TPC bits from BS
UTRAN establishes Reverse Link chip and frame sync,
Responds to TPC bits from UE
UE and BS notify upper layers
that synchronization is complete
Dedicated Channel Established
200
Packet Channel Access
CSICH
AP-AICH
CD/CA-ICH
DPCCH
CCC TFCI TPC Pilot
FBI TFCI TPC Pilot
PCPCH (Data); SF 4 to 256
DL-DPCCH Slot (SF=256)
PCPCH Control part (SF=256)
AP
CDP
PCPCH
PCPCH control
part
CCC (CPCH Control Commands)
e.g., Start-of-Message , Emergency-Stop
PCPCH
Uplink Data Packet
N x 10 msec Frames
Power Control
Preamble
(0 or 8 slots)
FBI TFCI TPC Pilot
PCPCH PC-Preamble Slot (SF=256)
CSICH
AP
AP
AP-AICH CD/CA-ICH
CDP
201
Packet Channel Access
Prior to Packet Access, the UE receives from the UTRAN:
UL Access Preamble (AP) scrambling code.
UL Access Preamble signature set.
The Access Preamble slot sub-channels group.
AP- AICH Preamble channelization code.
UL Collision Detection(CD) preamble scrambling code.
CD Preamble signature set.
CD Preamble slot sub-channels group.
CD-AICH Preamble channelization code.
CPCH UL scrambling code.
DPCCH DL channelization code.([512] chip).
CSICH/CA message indicating channel availability
202
CPCH Status Indicator Channel
CPCH Status Indicator Channel (CSICH)
Transmits Indicators to convey PCPH Channel Availability
1024 chips
8 bits/slot
SF = 256
AS #0 AS #1 AS #i AS #14
b
1
b
2
b
0
4096 chips
20 ms
AS #14 AS #0
(Transmission Off)
b
4
b
5
b
3
b
7
b
6
Higher layers provide
mapping of status
indicators to availability
of CPCH resources
203
Access Preamble Indicator Channel
Access Preamble Indicator Channel (AP-AICH)
Transmits Indicators in response to UE CPCH Access Attempt
APIs are derived from the UEs CPCH Access Preamble Signature
Identifies the UE which is the target of the AP-AICH response
1024 chips
AS #0 AS #1 AS #i AS #14
a
1
a
2
a
0
a
31

a
30
20 ms
AS #14 AS #0
(Transmission Off)
=
=
15
0
,
s
j s s j
b API a
204
CD/CA Indicator Channel
Collision Detection/Channel Assignment Indicator Channel
Transmits Acquisition Indicators in response to UE CD preambles
CDIs are derived from the UEs CD Preamble Signature
Optionally may transmit CPCH Channel Assignment Indicators
1024 chips
AS #0 AS #1 AS #i AS #14
a
1
a
2
a
0
a
31

a
30
20 ms
AS #14 AS #0
(Transmission Off)

= =
+ =
15
0
,
15
0
,
s
j s s
s
j s s j
b CAI b CDI a
205
Connection first and disconnection
afterwards in handoff.
High quality of service and effective
reduction of call drops.
Softer handoff: same BS &
frequency, between
different sectors.
Soft handoff: adjacent cells of the
same frequency.
BSC
BSC
MSC
Soft & Softer Handoff
206
WCDMA Soft Handover
Destination BS
Originating BS SC5
SC6
SC1
SC4 SC7
SC8
Each cell uses a different Scrambling Code
Each cell has an independent time reference
CPICH and System Frame timing between cells is arbitrary

207
The WCDMA Soft Handover Problem...
WCDMA Base Stations have Asynchronous timing references
IS-95/cdma2000 BSs are synchronized to GPS!
Data 2 TFCI Data 1 TPC
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Pilot
CPICH 2 CPICH 2 CPICH 2
DPCCH/DPDCH DPCCH/DPDCH DPCCH/DPDCH
CPICH 2
CPICH 1
DPCCH/DPDCH
T
offset
10 msec
frame

BS 1
BS 2
DPCCH/DPDCH DPCCH/DPDCH DPCCH/DPDCH DPCCH/DPDCH
10 msec DPCCH/DPDCH frame

0.666 msec DPCCH/DPDCH slot

208
WCDMA Handover Scenarios
RNS
RNC
RNS
RNC
Node B Node B Node B Node B
Iu Iu
Iur
Iub
Iub
Iub Iub
Inter-Node
(Hard or Soft)
Intra-Node
(Softer)
Inter-RNS
(Soft with Iur;
Hard with no Iur)
UTRAN
Core Network
209
WCDMA Soft Handover
To facilitate asynchronous handover, timing adjustments are made by
the UE, the RNC, and the Core Network

Time
Alignment
Transport Channel
Frame Alignment
Radio
Synchronization
RNS
UTRAN
Core Network
UE
RNS
Node B Node B

Node B
Vocoder
Node B Node B

Node B
RNC RNC
210
WCDMA Soft Handover
Soft Handover Initiation
(2)
UE measures
CPICH power and time
delay from adjacent cells
(3)
UE Reports measurements
to UTRAN
(1)
UTRAN informs UE
of neighboring cell
information
(4)
UTRAN decides
the handover
strategy
DOCUMENTTYPE
CPICH 2
CPICH 1
DPCCH/DPDCH
T
offset
10 msec
frame

BS 1
BS 2
UTRAN
UE Reports T
offset
to UTRAN
211
WCDMA Soft Handover
(6)
UE Rake Receiver
Synchronizes to BS2
DPCCH/DPDCH
(7)
UE in soft handover
with BS1 and BS2
DPCCH/DPDCHs
(5)
UTRAN Commands BS2
to adjust DPCH timing
by T
offset
(8)
When BS2 sufficiently
strong compared to BS1,
drop BS1.
(Handover complete)
CPICH 2 CPICH 2 CPICH 2 CPICH 2
CPICH 1
DPCCH/DPDCH
T
offset
10 msec
frame

BS 1
BS 2
UTRAN
UE Reports T
offset
to UTRAN
UTRAN Commands BS2
to adjust DPCH timing
by T
offset
DPCCH/DPDCH DPCCH/DPDCH DPCCH/DPDCH DPCCH/DPDCH
T
offset
Soft Handover Execution
212
Inter-Frequency Handover
Inter-frequency Handover

To allow inter-frequency measurements, data is compressed in time so that
some of the 10 mSec frame is available for measurements.

8 to 14 slots per frame may be used

Data compression can be accomplished by:

Decreasing the Spreading Factor by 2:1
Increases Data Rate so bits get through twice as fast!

Puncturing bits
weakens FEC coding

Higher layer scheduling
Reduces available timeslots for user traffic
213
Compressed Mode Operation
1 to 7 slots per frame diverted for hard handover processes
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2 3 4 5 11 12 13 14 15 6
1 2 3 4 5 11 12 13 14 15 1 2 3 4 5 11 12 13 14 15 6
1 2 3 4 5 6 7 8 9 10 11 12 4 5 11 12 13 14 15 6
10 mSec Frames (15 slots)
Normal Operation
Compressed-Mode; single-frame method
Compressed-Mode; double-frame method
Transmission Gap
Transmission Gap
The complete TFCI word must be transmitted every frame, even in Compressed Mode.
Compressed Mode Slot formats (A,B) contain higher proportion of TFCI bits per slot compared with normal slots.
214
Handover to/from GSM
Handover to/from GSM
GSM handover is an explicit requirement in WCDMA
Facilitated by commonality of multi-frame structures
1 2 3 4 5 6 7 8 9 10 11 12
T T T T T T T T T T T S T T T T T T T T T T T T T I
12 WCDMA 10 mSec Frames (120 ms)
GSM 26-frame TCH multiframe (120 ms)
T = Traffic Frame
S = SACCH Frame
I = Idle Frame
215
Power Control
Reverse power control
The object is UE
The Node B orders the MS to adjust its output power to decrease the interference
in the system
There are two types of Reverse Power control (open loop power control- used only
on access stage- and closed loop power control used when there is a dedicated
channel-)

Forward power control
The object is Node B
The Node B increase and decrease its power to get the maximum capacity and
minimum interference in the system
This type of power of control called Fast power control.

UMTS Material (LT)

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

UMTS Material (LT)

Загружено:

Авторское право:

Доступные форматы

1

Вам также может понравиться