WCDMA Design using Simulink

You should here music now. If you do not, check that

your PC speakers are on and you can play sounds on
your computer.

MathWorks,
MathWorks, Inc.
Inc.
Alex Rodriguez
arodriguez@mathworks.com

The
The MathWorks, Inc.

The
2002
2002
May 30th, 2002

©©
1
Agenda

• About WCDMA
• WCDMA Simulink Model
– About the models
– Physical Layer
– Mask parameters
– Coding and Multiplexing
– Modulation and Spreading

© 2002 The MathWorks, Inc.

– RAKE Receiver
– Channel Models
– Visualizing the results
• Enhancements
• Radiolab 3G

2
About WCDMA …
• WCDMA stands for Wideband Code Division Multiple Access.
• WCDMA is one of the five air-interfaces adopted by the ITU under the
name "IMT-2000 Direct Spread”.
• WCDMA can support multiple and simultaneous communications
such as voice, images, data, and video.
– Very high and variable bit rates:
• 144 kbps: vehicle speed, rural environ.
• 384 kbps: walking speed, urban outdoor.

© 2002 The MathWorks, Inc.

• 2048 kbps: fixed, indoor.
– Different QoS for different connections.
– High spectrum efficient.
– Coexistence with current systems.

• WCDMA is being specified by the 3GPP (Third Generation

Partnership Project).

3
About WCDMA and the 3G Standardization
Process
• References:
– ITU (International Telecommunication Union)
• http://www.itu.int
– 3GPP (3 Generation Partnership Project)
• http://www.3gpp.org
– UWCC (Universal Wireless Communications Consortium)
• http://www.uwcc.org
– UMTS Forum:

© 2002 The MathWorks, Inc.

• http://www.umts-forum.org
– GSM World :
• http://www.gsmworld.com
– CDMA Development Group
• http://www.cdg.org

4
About the models

• WCDMA has two basic modes of operation:

– TDD (Time Division Duplex).
• Low Chip Rate TDD (TD-SCDMA)
– FDD (Frequency Division Duplex).
• Duplex communications:
– Downlink Channel
• From Node B (Base Station) to UE (User Equipment).

© 2002 The MathWorks, Inc.

– Uplink Channel
• From UE to Node B
• Model simulates transmission of information data (DCH –
Dedicated Channel) during a connection.

5
About the models

R12.1 !!
For NT, Linux and Unix WCDMA Library
w/o accelerator

WCDMA Multiplexing WCDMA Spreading

and Coding and Modulation

© 2002 The MathWorks, Inc.

To open the models,
WCDMA Physical type wcdmademos
Layer

6
Physical Layer Specifications

• Physical layer provides data transport support to higher

layers via Transport Channels.
• Functions of the Physical Layer:
– Error detection.
– FEC encoding/decoding.
– Rate Matching/Dematching.
– Multiplexing/Demultiplexing different Transport Channels
into/from a Coded Composite Transport Channel (CCTrCH).

© 2002 The MathWorks, Inc.

– Mapping/Demapping of CCTrCH into/from Physical Channels.
– Modulation and Spreading/Demodulation and Despreading.
– Power Weighting and combining of physical channels.
– RF Processing.
– …

7
 WCDMA Physical Layer Transmitter
- Transport Block Set Size - DL Scrambling Code
- Transport Block Size - Channelization Code
Transport Format
- Transmission Time Interval - Transmit Diversity
- Size of CRC - Slot Format
- Type of Error Correction
Transport - Power Settings
- Coding Rate
Channels - Rate Matching Attribute
Slot
DPCH

Channel CCTrCh DPCH

Physical Spreading
Coding and
Channel And

© 2002 The MathWorks, Inc.

Multiplexing
Mapping Modulation

Pilot Bits
TPC Control Channels
Orthogonal
Layer 2 Interference (OCNS)
TFCI Codes
MAC Layer 1 Channel

8
WCDMA Physical Layer Model

© 2002 The MathWorks, Inc.

9
Initial Settings Mask – Layer 2

Multiplexing and Coding

Spreading and Modulation

© 2002 The MathWorks, Inc.

Variables are stored in
the workspace.
To view them, type
who or whos

10
Coding and Multiplexing Specifications

• Physical layer provides data transport support to higher

layers via Transport Channels.
• There is a Transport Format associated to each Transport
Channel that describes the processing (CRC size, encoding
scheme, coding rate, …) to be applied by the Physical Layer.
• Every transport block is generated every 10, 20, 40 or 80 ms
(Time Transmission Interval – TTI).

© 2002 The MathWorks, Inc.

11
 Coding and Multiplexing Overview
Layer 1

Rate 1st Radio

Concat/ Channel
CRC Interleaver Frame
Segment Encoder Matching
Segment

Limits Max Size Accommodates data rates

to a fixed channel bit rate Multiplexes bits from
of Codewords different Transport
Coding Schemes:
Channels every 10 ms. CCTrCH
- No coding
Attaches CRC
- Convolutional Coding Interleaves bits within each
Size={0,8,12,16,24}
- Turbocoding Transport Channel

© 2002 The MathWorks, Inc.

Rate 1st Radio
Concat/ Channel
CRC Interleaver Frame
Segment Encoder Matching
Segment

{10,20,40 and 80ms} {10ms}

Transmission Time Interval Radio Frame

12
Coding and Multiplexing Model
Transport Concatenation Rate
Channel First CCTrCh
Channels CRC and
Encoder Matching Interleaver
Segmentation

© 2002 The MathWorks, Inc.

{10,20,40 and 80ms} {10ms}
Transmission Time Interval Radio Frame

Layer 2 Layer 1

13
 Physical Channel Mapping Overview
Transport Format Combination Index
contains information of how the
Interleaves bits within a different transport channel have been
Radio Frame coming from processed Data is sent to the
different Transport Channels Modulation and Spreading
TFCI block

CCTrCh DPCH DPCH

Slot DPCH
Physical 2nd
Channel Builder
Interleaver
Segmentation

© 2002 The MathWorks, Inc.

Power
Control Bits
One CCTrCH can be
mapped onto one or
several PhCHs Pilot Bits
Structure of slot is defined
by the Higher Layers via
Slot Format Data 1 TPC TFCI Data 2 Pilot

14
 Physical Channel Mapping Model

Slot Builder
Physical
channel
segmentation

© 2002 The MathWorks, Inc.

2nd Interleaver

{10ms} {10/15 ms}

Radio Frame Slot

15
References

• 3GPP TS 25.302 – “Services provided by the Physical Layer”.

• 3GPP TS 25.211 – “Physical channels and mapping of
transport channels onto Physical Channels (FDD)”.
• 3GPP TS 25.212 – “Multiplexing and channel coding”.

© 2002 The MathWorks, Inc.

• 3GPP TS 25.944 – “Channel coding and multiplexing
examples”.

16
Modulation and Spreading Specifications
• Modulation:
– QPSK.
– Same gain for I and Q components.
• Spreading or Channelization Operation:
– Transforms every bit into a given number of chips, hence
increasing the bandwidth.
– Chip Rate = 3.84 Mcps.
– By using an orthogonal code for each physical channel, receiver
can separate them.

© 2002 The MathWorks, Inc.

– Orthogonal codes are real-valued OVSF codes (Orthogonal
Variable Spreading Factor) of different length.
• Scrambling:
– Separates different Base Stations.
– Complex-valued Gold Code Sequences.

17
Modulation and Spreading Specifications

• Power weighting:
– Different power is applied to each physical channel before being
added together.
• Pulse shaping:
– Root-raised cosine filter with ß=0.22.
– Bandwidth is 5MHz.

© 2002 The MathWorks, Inc.

18
Modulation and Spreading Specifications

• Physical channels required during a connection:

– Dedicated Channel:
• DPCH  Dedicated Physical Channel
– Common Channels:
• P-CPICH  Primary Common Pilot Channel
– Could be used at the receiver end for channel estimation, tracking
• P-CCPCH  Primary Common Control Physical Channel
• SCH  Synchronization Channel

© 2002 The MathWorks, Inc.

– Not multiplied by orthogonal code.
– Used mainly for cell search: slot and frame timing acquisition.
• PICH  Paging Indicator Channel
• OCNS  Orthogonal Channel Noise Simulator
– Simulates interference caused by other users or signals.

19
Modulation and Spreading Overview
Physical
Channelization Orthogonal Codes PN Sequence Scrambling Channels are
OVSF Gold Codes added before
being sent to
QPSK Power Pulse Shaping
Modulation Weighting

I&Q
DPCH
Mapping

+
Spreading Scrambling Power To
Channel
Common Settings
Channels

© 2002 The MathWorks, Inc.

Common
Channels are
introduced OCNS SCH {3.84Mcps}
Bit Rate Chip Rate

20
Modulation and Spreading Model
Modulation Spreading Pulse Shaping

© 2002 The MathWorks, Inc.

Introduce Common Power
Channels Introduce Interference Scrambling Adjustment

21
References

• 3GPP TS 25.101 – “UE Radio Transmission and Reception”.

• 3GPP TS 25.211 – “Physical channels and mapping of
transport channels onto Physical Channels (FDD)”.
• 3GPP TS 25.213 – “Spreading and Modulation (FDD)”.

© 2002 The MathWorks, Inc.

22
RAKE Receiver

• Standard does not defined Receiver algorithms.

– Although specifications has been defined in a such a way that a
RAKE receiver will satisfy most of the cases.
• RAKE receiver consists of several branches (RAKE Fingers)
each of them assigned to a different receive paths, due to:
– Diversity reception (“echoes”) : sum of attenuated and delayed
versions of the transmitted signal.
– Handoff.

© 2002 The MathWorks, Inc.

• The outputs of the different RAKE fingers are aligned in time
and coherently combined.
– Convert destructive interference into constructive interference.

23
RAKE Receiver

• Rake finger consists of:

– Downsampler
– Decorrelators for Data and Pilot
• Receiver requires knowledge of channelization codes used by
Data (Dedicated Physical Channel) and Pilot.
– Channel Estimation
• By comparing receiving pilot signal with reference signal.
• Low Pass filter is introduced is smooth noise estimates.

© 2002 The MathWorks, Inc.

– Data Derotation or Phase Correction
• Using channel estimates data is phase corrected.

• Current RAKE receiver assumes perfect carrier and timing

synchronization.

24
 RAKE Finger Overview
Paths are aligned and
Pilot Sequence,
added coherently
Channelization and
From Other
Scrambling Code are Pilot
generated at the receiver
Reference Channel Fingers
Estimation

From Phase
Channel ↓ Correlator
Correction +
To
Decoder

© 2002 The MathWorks, Inc.

Orthogonal Derotates data using
channel estimates
Codes
Oversampled data
Data / Pilot From Other
Fingers

Tick Rate Chip Rate Bit Rate

25
RAKE Receiver Model

Pilot and Data Correlators

Pilot
Reference
Generator Channel
Estimator

© 2002 The MathWorks, Inc.

RAKE
Combiner
Sequence
Generators
Phase
Correction

26
Channel Models

• 3GPP standard specifies minimum requirement tests under

for different data rates under different propagation
conditions:
– Static Channel (AWGN)
– Multipath Fading
• 6 different multipath profiles
– Moving Propagation Conditions
• Non fading channel with two taps (static – moving).

© 2002 The MathWorks, Inc.

– Birth-Death Propagation Conditions
• Non fading channel with two taps that appear randomly.

• Channel models are implemented using a Configurable

Subsystem.

27
Channel Models

• Use the mask of the demo, to

select any predefined profile.
• To define any multipath
profile, use the option User
Defined.

© 2002 The MathWorks, Inc.

28
References

• 3GPP TS 25.101 – “UE Radio Transmission and Reception”.

© 2002 The MathWorks, Inc.

29
Visualizing the results

Spreading and Multiplexing and

Physical Layer Demo
Modulation Demo Coding Demo
• BER • BER • BER
(Bit Error Rate) • BLER
• BLER
• Time Scopes (Syndrome Detector)
• Time Scopes
• Frequency Scopes
• Frequency Scopes

© 2002 The MathWorks, Inc.

• There is an intrinsic delay between transmission and
reception of at least 2 TTI.
• Simulink libraries contain several other types of displays such
as eye diagrams, scatter plots or histograms.

30
Visualizing the results

To open and close the

© 2002 The MathWorks, Inc.

scopes, double-click
on the switch icon

31
 Enhancements

32

© 2002 The MathWorks, Inc.

Enhancements
• Current model and library can be used as a baseline to test
different algorithms such as:
– Turbo coding
– Power Control
– AFC
– AGC
– Tracking
– Space Time Transmit Diversity
• Two transmit antennae and one receiver antenna.

© 2002 The MathWorks, Inc.

– Open Loop
– Close Loop Mode I and II
– Cell Search
– Multi-user detection.
– …

33
 Radiolab 3G

34

© 2002 The MathWorks, Inc.

Radiolab 3G: UMTS/W-CDMA Blockset
• 20 reference designs
• Uplink and downlink
• Transport channels and
physical channels
• Viterbi and Turbo decoding
• Multi-user detection
• Vary data rates during

© 2002 The MathWorks, Inc.

simulation (Bursty)
• Fixed-point and floating-point

http://www.mathworks.com/products/connections/product_name.shtml, “RadioLab3G”

35
Remember to fill out the survey !!

© 2002 The MathWorks, Inc.

36
 Thank you

37

© 2002 The MathWorks, Inc.