Wireless Communications Group

Multiple Access

François Horlin

1
 Outline

• Introduction
• Direct-Sequence Code-Division Multiple Access (DS-CDMA)
• Universal Mobile Telecommunications System (UMTS)
• Orthogonal Frequency-Division Multiple Access (OFDMA)
• 3GPP Long Term Evolution (3GPP LTE)
• Exercises

2
 References

• ELEC 2796 - Wireless communications, UCL

• ”Zero Forcing and Minimum Mean-Square-Error Equalization for
Multiuser Detection in Code-Division Multiple-Access Channels”,
A. Klein, IEEE Trans. V.T. 1996
• ”Technical Solutions for the 3G Long Term Evolution”,
H. Ekstrom, IEEE Comm. Mag. 2006

3
 Outline

• Introduction
• Direct-Sequence Code-Division Multiple Access (DS-CDMA)
• Universal Mobile Telecommunications System (UMTS)
• Orthogonal Frequency-Division Multiple Access (OFDMA)
• 3GPP Long Term Evolution (3GPP LTE)
• Exercises

4
 Outline: Introduction

• Time-Division Multiple Access (TDMA)

• Frequency-Division Multiple Access (FDMA)
• Code-Division Multiple Access (CDMA)

5
 Introduction

The objective is to enable various signals to share the communication

medium without creating unmanageable interference to each other in
the detection process
We distinguish:
• Multiple access : distribution of resources among the users
• Duplex : distribution of resources among the two directions
(uplink - from terminals to base station, and downlink - from base
station to terminals)

6
 Introduction

Resource distribution opportunities:

• Frequency Division (FD)
• Time Division (TD)
• Code Division (CD)
• Space Division (FD)
• Polarization Division (PD)

7
Frequency-division multiple access (FDMA)

frequency

time

8
 FDMA principles

Permanent assignment of one frequency band to each user

Guard bands are inserted as buffer zones to reduce the interference
between adjacent frequency channels
Implemented with analog components (mixers at different
frequencies), and therefore lacks of flexibility
The base station must have as many analog chains as the number of
communicating users !
Example: first generation cellular system

9
 Time-division multiple access (TDMA)

frequency

time

10
 TDMA principles

Full spectral occupancy assignment of short duration time slots to

each user
Guard times are inserted to allow uncertainty between signals in
adjacent time slots
Implemented digitally, and therefore offers a high flexibility
Only one analog chain is required at the base station
Examples: second generation cellular system (GSM), wireless local
area networks (WiFi)

11
 TDMA typical frame

The time slots are organized in a frame structure

Each time slot is composed of training sequences/pilot symbols
besides the data symbols to facilitate the synchronization and the
channel estimation

12
 Code-division multiple access (CDMA)

Hybrid technology between FDMA and TDMA

There exists two flavors:
• Frequency-hopping CDMA (FH-CDMA)
• Direct-sequence CDMA (DS-CDMA)
Example: third generation cellular system (UMTS)

13
 FH-CDMA and DS-CDMA

Frequency-hopping CDMA:
• Short-term assignment of the frequency bands to the users
• A (nearly) orthogonal set of codes is employed that dictates the
order of the frequency band assignment over the time
Direct-sequence CDMA:
• Permanent assignment of the full spectrum to all users
• A (nearly) orthogonal set of codes is employed that spreads the
user signals over the time and frequency spectrum

14
 Frequency-Hopping CDMA

frequency

time

15
 Direct-Sequence CDMA

frequency

time

16
 Impact on the power spectral density

For each user:

• The bandwidth is much wider than the symbol rate
• The power spectral density is very low
PSD

frequency

17
 Advantages/drawbacks

Main advantages:
• High flexibility (all users can a-priori transmit anywhere on the
spectrum at anytime)
• High spectral efficiency (no a-priori division of time/frequency
resources)
But also: robustness to narrow-band interference, privacy...

Main drawback:
• Performance limited by the interference between users

18
 Outline

• Introduction
• Direct-Sequence Code-Division Multiple
Access (DS-CDMA)
• Universal Mobile Telecommunications System (UMTS)
• Orthogonal Frequency-Division Multiple Access (OFDMA)
• 3GPP Long Term Evolution (3GPP LTE)
• Exercises

19
 Outline: DS-CDMA

• Spreading/despreading principle
• Direct-Sequence Spread-Spectrum (DS-SS)
• Synchronous DS-CDMA
• Walsh-Hadamard codes
• Aynchronous DS-CDMA
• Gold codes
• Rake receiver
• Joint detection, interference cancelation

20
 Concept of DS-CDMA spreading

Input signals:
• Low rate data sequence composed of complex QAM symbols
• High rate code sequence composed of chips

Spreading factor: number of chips per symbol

21
 Spreading at transmitter

The data sequence is multiplied with the code sequence, resulting in a

high rate chip sequence

22
 Despreading at receiver

The received signal is again multiplied by the code sequence and

integrated over the symbol time interval, resulting in the estimated
data sequence

23
 Summary of spreading/despreading principle

wide bandwidth signal

estimated
symbol RT
dt symbol
channel 0
sequence sequence

chip noise chip

sequence sequence

In practice:
• The spreading is performed digitally and results in a digital
sequence of chips
• The chip sequence is shaped with a halfroot Nyquist filter

24
 DS spread-spectrum (DS-SS)

A single-user signal is spread over a large bandwidth

Initial motivation comes from the military applications:
• Provide resistance against narrowband interference/jamming
• Mask the signal in the noise (low probability of interception)

25
 DS-SS block diagram *

spreading code

In′ sn nTc
r(t)
In ↑M an gT (t) gT∗ (−t) a∗−n ↓M Iˆn

T Tc h(t) h∗ (−t)
z(t)

spreading factor halfroot Nyquist matched filter

26
 Spreading code

The spreading codes are usually binary, normalized, of length equal to

the spreading factor
an

√1
M

0 M −1 n

− √1M

27
 Chip sequence

In

In′ After up-sampling and convolu-

tion with the code:
X
an sn = Im′
an−m
m
X
= Im an−mM
sn m

28
 Received signal

X
r(t) = sn gT (t − nTc ) + z(t)
n
XX
= Im an−mM gT (t − nTc ) + z(t)
n m

X M
X −1
= Im an gT (t − (n + mM )Tc ) + z(t)
m n=0
X
= Im h(t − mT ) + z(t)
m

where:
M
X −1
h(t) := an gT (t − nTc )
n=0

29
 Receiver

The first stage of the optimal ML receiver is to sample the output of

the matched filter h∗ (−t) at the symbol rate
It can be equivalently seen as the succession of:
• Halfroot Nyquist filter (matched filter gT∗ (−t))
• Sampling at the chip rate nTc
• Code correlator (matched filter a∗−n )
• Down-sampling by the spreading factor

30
 Estimated symbols

Z ∞
Iˆl = r(t)h∗ (t − lT )dt
−∞
X Z ∞ Z ∞
= Im h(t − mT )h∗ (t − lT )dt + z(t)h∗ (t − lT )dt
m −∞ −∞
X
= Im xl−m + zl
m

where:
Z ∞
xl := h(t)h∗ (t − lT )dt
−∞
Z ∞
zl := z(t)h∗ (t − lT )dt
−∞

31
 Estimated symbols

Z ∞
xl := h(t)h∗ (t − lT )dt
−∞
M
X −1 M
X −1 Z ∞
= an a∗n′ gT (t − nTc )gT∗ (t − n′ T c − lT )dt
n=0 n′ =0 −∞

M
X −1 M
X −1
= an a∗n′ g(lT + (n′ − n)Tc )
n=0 n′ =0
M
X −1
= δl an a∗n = δl
n=0

For the sake of simplicity, it has been assumed that the Nyquist filter
g(t) is normalized (g(0) = 1)
32
 Estimated symbols

The optimal ML receiver reduces to its first stage matched filter since
there is no remaining inter-symbol interference (ISI):

Iˆl = Il + zl

The performance of the DS-SS modulation is independent of the

spreading factor (including the case without spreading M = 1)

33
 Synchronous DS-CDMA

The signals of the communicating users are received synchronously at

the receiver
Typical in the downlink:

34
 Synchronous DS-CDMA *

In1 ↑M a1n gT (t)

r(t) nTc
Ink ↑M akn gT (t) gT∗ (−t) (ak−n )∗ ↓M Iˆnk
T Tc
z(t)
InK ↑M aK
n gT (t)

The conventional single-user receiver (matched filter) considers the

other users as additive noise corrupting the desired signal

35
 Received signal

The received signal is the desired user signal plus the interfering user
signals:
X XX
j j k k
r(t) = Im h (t − mT ) + Im h (t − mT ) + z(t)
m k6=j m

where:
M
X −1
hk (t) := akn gT (t − nTc )
n=0

36
 Estimated symbols

Z ∞
Iˆlj = r(t)(hj (t − lT ))∗ dt
−∞
M −1
!
Ilj Ikj + zlj
X X
= + akn (ajn )∗
k6=j n=0

where: Z ∞
zlj := z(t)(hj (t − lT ))∗ dt
−∞

37
 Estimated symbols

Contributions to the estimated symbol:

• First term: desired signal
• Second term: inter-user interference
• Third term: noise
Only one symbol of the other users interferes on the desired signal
The multi-user interference (MUI) is completely eliminated when the
codes are orthogonal:
M
X −1
akn (ajn )∗ = δj−k
n=0

38
 Walsh-Hadamard codes

An orthogonal set of codes is given by the columns of the succession of

Walsh-Hadamard matrices:

 
  1 1 1 1
 
1 1  1 −1 1 −1 
1 → → ···
   
 
1 −1  1
 1 −1 −1 

1 −1 −1 1

39
 Asynchronous DS-CDMA

The signals of the communicating users are received asynchronously at

the receiver
Typical in the uplink:

40
 Asynchronous DS-CDMA *

In1 ↑M a1n gT (t) δ(t − τ1 )

r(t) nTc
Ink ↑M akn gT (t) δ(t) gT∗ (−t) (ak−n )∗ ↓M Iˆnk
T Tc
z(t)
InK ↑M aK
n gT (t) δ(t − τK )

The receiver is synchronized to the user of interest (the other user

signals arrive with a delay)
The conventional single-user receiver (matched filter) considers the
other users as additive noise corrupting the desired signal

41
 Received signal

The received signal is the desired user signal plus the delayed
interfering user signals:
X XX
j j k k
r(t) = Im h (t − mT ) + Im h (t − mT − τk ) + z(t)
m k6=j m

where:
M
X −1
hk (t) := akn gT (t − nTc )
n=0

42
 Estimated symbols

Z ∞
Iˆlj = r(t)(hj (t − lT ))∗ dt
−∞

= Ilj
M −1 M −1
!
akn (ajn′ )∗ g((l − m)T + (n′ − n)Tc − τk )
XX X X
k
+ Im
k6=j m n=0 n′ =0

+ zlj

where: Z ∞
zlj := z(t)(hj (t − lT ))∗ dt
−∞

43
 Estimated symbols

Contributions to the estimated symbol:

• First term: desired signal
• Second term: inter-user interference
• Third term: noise
Multiple symbols of the other users interfere on the desired signal
The inter-user interference is low when the codes are quasi-orthogonal:
M
X −1
ajm (akn )∗ ≃ δm−n δj−k
n=0

44
 M-sequences

The maximum length shift register sequences or m-sequences are the

most popular quasi-orthogonal sequences

Sequence of length n = 2m − 1 generated by an m-stage shift register

with linear feedback (corresponding to a primitive polynomial)

Sequence periodic with period n

Each period contains 2m−1 ones and 2m−1 − 1 zeros

45
 M-sequences *

Shift register with linear feedback:

46
 M-sequences

Map the {0, 1} values onto ai = {−1, 1}

Pn
Define the periodic correlation function φj = i=1 ai ai+j (periodic in
j, period n)

Ideally φj = nδj for the main period

For an m-sequence:

 n j=0
φj =
 −1 1 ≤ j ≤ n − 1

47
 Preferred sequences

In CDMA, not only auto-correlation matters but also cross-correlation

The periodic cross-correlation between any pair of m-sequences of the

same period can have large peaks, which is not acceptable in CDMA

Gold and Kasami proved that certain pairs of m-sequences of length n

have 3 values of the cross-correlation {−1, −tm , tm − 2} where

 2(m+1)/2 + 1 m odd
tm =
 2(m+2)/2 + 1 m even

Example: m = 10, n = 1023, t10 = 65, cross-correlation {−1, −65, 63}

Such sequences are called preferred sequences

48
 Gold codes

From a pair of preferred sequences, we can generate new sequences by

the modulo-2 sum of the first shifted versions of the second

For a period n, n = 2m − 1 shift possibilities

With 2 original m-sequences, one gets n + 2 sequences, called Gold

codes or sequences

Apart from the 2 original sequences, the other are not m-sequences;
hence the autocorrelation is not two-valued

The cross-correlation of any pair of Gold sequences taken from the

n = 2 is three-valued −1,−tm , tm − 2

49
Generation Gold codes (length 25 − 1 = 31)

50
 Extension to multipath channels

When the channel is time-dispersive, the single-user DS-SS system

becomes:

r(t) nTc
In ↑M an gT (t) c(t) c∗ (−t) gT∗ (−t) a∗−n ↓M Iˆn

h(t) h∗ (−t)
z(t)

It is still possible to limit the receiver to a filter matched to the

composite impulse response (including the channel)

51
 Rake receiver

The propagation channel is often composed of multiple delayed

complex paths, corresponding to reflections in the environment:
L
X
c(t) = αl δ(t − τl )
l=1

In this case, the matched filter can equivalently be implemented as a

weighted combination of correlators (Rake receiver)

52
 Rake receiver *

nTc + τ1
gT∗ (−t) a∗−n ↓M
r(t)
In ↑M an gT (t) c(t)
nTc + τL
α1∗ Iˆn

gT∗ (−t) a∗−n ↓M

z(t)
αL∗

Not all paths need to be recombined, so that the Rake receiver can be
limited to L′ ≤ L branches

53
 Rake receiver

When the paths are independently Rayleigh distributed, the Rake

receiver combines optimally the contribution of L′ paths (term in
PL′ 2 ′
l=1 |α l | ) and achieves a diversity gain of order L

However the signal obtained after correlation on each branch is

affected by the delayed signal replicas due to the other paths
The system relies on the good auto-correlation properties of the code
to mitigate partially the resulting ISI

When the Rake receiver is employed in a DS-CDMA system, it suffers

further from MUI

54
 Multipath diversity *

Slope of the BER curve improves with the diversity order (interference
neglected, identical path power):

55
 Rake performance (SF=16-32, K=3) *

The BER performance floors because the inter-path interference (IPI)

dominates the noise at high SNR

56
 Conventional single-user receiver limitations

The DS-CDMA system presented until now relies on a conventional

single-user receiver (equivalent to a matched filter) to demodulate the
user signals
The users are partially separated thanks to the good auto and
cross-correlation properties of the CDMA codes
It assumes that the interfering user signals can be treated as additive
white Gaussian noise
In practice, when the channels are time-dispersive, the remaining
interference level is not sufficiently low and the BER performance
floors at a high level

57
 Uplink advanced solutions

Detect the multiple user signals together (concept of joint detection)

Optimal MLSE joint detector composed of a matched filter and of a
Viterbi detector is of prohibitive complexity
Rather implement a linear zero-forcing/MMSE joint detector or a
decision-feedback joint detector
Successive or parallel interference cancelation can also be envisaged
Higher complexity is affordable at the base station

58
 Downlink advanced solutions

Joint detection/interference cancelation schemes can be envisaged too,

but useless complexity since the signals of the other terminals are not
needed
Meaningful option is to compensate first for the unique multipath
channel with a linear equalizer (chip equalizer) and to despread the
user signal of interest afterwards
Complexity should be low at the terminal

59
 Joint detection

Assume K users transmit a burst of N symbols

The received signal is equal to:
K X
X N
k k
r(t) = Im h (t − mT ) + z(t)
k=1 m=1

It is sampled at the chip rate (1/Tc ) or at twice the chip rate (1/2Tc )
after low-pass filtering to avoid aliasing:
Tc
r[n] := r(t = nTc ) or r(t = n )
2

60
 Joint detection

A matrix model is built:

K
X
r = Hk · Ik + z
k=1
 
I1
..
h i  
= H1 ··· HK · +z
 
 . 
IK
= H ·I + z

61
 Joint detection *

N
(2)M

H =

H1 H2 HK

62
 Linear MMSE joint detector

r  −1
H
I H H 2N0
σI2
IN + HH · H Î LM M SE

MF ISI/MAI mitigation
z

Error auto-correlation matrix:

h i
RLJD = E (I − IˆM M SE ) · (I − IˆM M SE )H
ǫ
 −1
2N0 H
= 2N0 2 I N
+ H ·H
σI

63
 Decision-feedback MMSE joint detector

DF E
r Î
I H HH 1
2N0 Λǫ · LH Ĩ
−
feedforward detection

z L−1 − I N
feedback

The triangular matrix L and the diagonal matrix Λǫ are obtained by

taking the Choleski decomposition of the linear MMSE joint detector
error auto-correlation matrix:

RLJD
ǫ
= L · Λǫ
· L H

64
 JD performance (SF=16, K=8) *

Significant gains can be obtained compared to the Rake (no flooring)

65
 Interference cancelation

Principle:
• Focus on user k
• Evaluate the signal contribution of already detected users
• Subtract it from the received signal
• Detect and decode signal of user k
• Iterate if needed

66
 Parallel interference cancelation (PIC)

All interfering users are subtracted simultaneously from the received

signal

67
 Successive interference cancelation (SIC)

Successively detect and subtract the users from the received signal
according to the order of signal strength

68
 Outline

• Introduction
• Direct-Sequence Code-Division Multiple Access (DS-CDMA)
• Universal Mobile Telecommunications
System (UMTS)
• Orthogonal Frequency-Division Multiple Access (OFDMA)
• 3GPP Long Term Evolution (3GPP LTE)
• Exercises

69
 Outline: UMTS

• Wideband CDMA: advantages and limitations

• Channelization and scrambling codes
• Downlink modulation and spreading
• Uplink modulation and spreading

70
 Third generation cellular system

Second generation cellular communication systems (like GSM) enabled

voice traffic to go wireless
In several countries there are now more mobile phones than landline
(wired) phones
Data handling capability of 2nd generation is limited
Third generation should provide high bit rate services that enable
transmission and reception of high quality images and video and
provide access to Internet
Third generation is referred in Europe to as UMTS (Universal Mobile
Telecommunications System)

71
 WCDMA for UMTS

WCDMA (Wideband CDMA) is the main third generation air

interface in the world
The specification has been created in the 3GPP (Third Generation
Partnership Project) joint standardization project of Europe, Japan,
Korea, USA and China
In 3GPP, WCDMA is called UTRA (Universal Terrestrial Radio
Access)
Both frequency-division duplex (FDD) and time-division duplex
(TDD) schemes are supported

72
UMTS/IMT2000 spectrum allocation *

73
 Cellular concept

The area is divided in cells

Some cells may be further split

to account for large demands

There is a base station at the

center of each cell

Possibility of having sectors in

cells thanks to directional
antennas

74
 Universal frequency reuse

All cells can use all available frequencies; hence two neighboring cells
can use the same carrier frequency (as opposed to former cellular
systems where a repetitive frequency pattern is defined)
The base station of each cell is distinguished with a DS-CDMA
scrambling code

Advantages Drawbacks
Capacity improvement Inter-cell interference
Soft hand-over

75
 Soft hand-over

Moving terminals communicate successively with multiple base

stations
Because the same carrier frequency is used in two neighboring cells, a
terminal at the boundary between the two cells can communicate
simultaneously with the two base stations even if it has a single analog
front-end
Therefore, when a terminal switches from one cell to the next, it can
initiate the communication with the new base station while still
communicating with the former base station (there is no need to break
the communication)

76
 Near-far problem

Happens when the DS-CDMA codes are not orthogonal or when the
orthogonality is destroyed by multipath propagation
With equal transmit power a terminal close to the base station may
hide a terminal at the cell border
Power control has as an objective to control the transmit powers of
the different terminals so that their signals reach the base station with
the same level

77
 Fast closed-loop power control

The base station performs frequent estimations of the received SIR

(Signal-to-Interference Ratio) and compares to a target SIR
The command-react cycle is 1500 times per second for each mobile
station (faster than any fading mechanism)
Basic step size equal to 1dB

78
Fast closed-loop power control

79
UMTS parameters *

80
 Spreading in two steps

Channelization codes:
• Separate channels from a single source from each other
• Span only one symbol (short codes)
Scrambling codes:
• Separate different sources from each other
• Span several symbols (long codes)

81
Spreading in two steps *

82
 Channelization codes

OVSF (Orthogonal Variable Spreading Factor) codes generated based

on a code tree
Allow spreading factor to be changed while maintaining orthogonality
between codes
When a code is intended to be used, no other code generated from the
intended code can be used (as for higher SF); no code between the
intended coded and the root can be used (as for smaller SF)
Restrictions apply to individual sources; do not apply to different base
stations (separation by scrambling) or to different mobiles in the
uplink (separation by scrambling)

83
Channelization codes *

84
 Scrambling codes *

Gold codes generated with 2 polynomials of degree 25

Uplink:
• Long code: 38400 chips (truncated to the 10 ms frame length),
combined with a Rake receiver
• Short code: 256 chips, combined with a joint detector/interference
canceler
Downlink:
• Long code: 38400 chips (truncated to the 10 ms frame length),
combined with a Rake receiver or to a chip equalizer

85
 Downlink modulation

The DPCCH (dedicated physical control channel - pilots and control

information) and DPDCH (dedicated physical data channel) are time
multiplexed

86
Downlink spreading and bit rate

87
 Uplink modulation

The DPCCH and DPDCH are I-Q multiplexed instead of time

multiplexed

88
 I-Q multiplexing

The amplitude levels of DPDCH and DPCCH may be different

depending on the supported bit rate
This may lead to an unbalanced DPCCH and DPDCH transmission:

Complex scrambling is used to share I-Q info between the 2 branches

There is a single DPCCH per radio link; but there may be several
DPDCH

89
Uplink spreading and bit rate

90
 DS-CDMA system limitations

DS-CDMA offers a high capacity and a high flexibility but suffers

from the different sources of interference (ISI, MUI)
The complexity of the advanced detectors necessary to mitigate the
interference (joint detector, chip equalizer, interference canceler) is
high compared to the complexity of the conventional Rake receiver
Look for a new air interface better able to deal with interference at a
reasonable complexity
Multi-user extension of OFDM, called orthogonal frequency-division
multiple access (OFDMA), has been adopted in emerging outdoor
systems (mobile WiMax, 3GPP LTE)

91
 Outline

• Introduction
• Direct-Sequence Code-Division Multiple Access (DS-CDMA)
• Universal Mobile Telecommunications System (UMTS)
• Orthogonal Frequency-Division Multiple
Access (OFDMA)
• 3GPP Long Term Evolution (3GPP LTE)
• Exercises

92
 Outline: OFDMA

• OFDM multi-user extension

• Localized/distributed transmissions

93
 OFDM system *

IF IFFT In rn FFT rF
I hn r

zn

OFDM transforms the multipath channel in a set of independent flat

fading channels:
r F = hF ⊙ I F + z F

94
 OFDMA multi-user extension *

I 1,F
IFFT In1 rn FFT rF
I1 h1n r

zn

IFFT InK
I K,F IK hK
n

95
 Advantages/drawbacks

Main advantages:
• High flexibility in the carrier allocation
• Robustness to multipath propagation at a low complexity
Main drawback:
• The users must be synchronized in the uplink (cyclic prefix
margin)

96
 Localized transmission

Sets of adjacent carriers are allocated to the users

Interesting when there is information on the channel gains at the
transmitter (obtained through feedback at low mobility)
The carrier sets can be smartly allocated among the users
Multi-user diversity

97
 Distributed transmission

Sets of distributed carriers are allocated to the users

Interesting when there is no information on the channel quality at the
transmitter (high mobility)
The user signals are distributed over the whole bandwidth
Frequency diversity

98
 Outline

• Introduction
• Direct-Sequence Code-Division Multiple Access (DS-CDMA)
• Universal Mobile Telecommunications System (UMTS)
• Orthogonal Frequency-Division Multiple Access (OFDMA)

• 3GPP Long Term Evolution (3GPP LTE)

• Exercises

99
 3GPP Long Term Evolution (3GPP LTE)

Objective is to ensure competitiveness in a long time frame, i.e. for

the next 10 years and beyond

Targets on data rates, mobility and coverage have been revisited...

100
 Targeted data Rates

• Instantaneous downlink peak data rate of 100 Mbps within a

20 MHz downlink spectrum allocation (5 bps/Hz)
• Instantaneous uplink peak data rate of 50 Mbps within a 20 MHz
uplink spectrum allocation (2.5 bps/Hz)

101
 Targeted mobility

• E-UTRAN should be optimized for low mobile speed from 0 to

15 km/h
• Higher mobile speed between 15 and 120 km/h should be
supported with high performance
• Mobility shall be maintained at speeds from 120 to 350 km/h

102
 Targeted coverage

• Throughput and mobility targets should be met for 5 km cells,

and with a slight degradation for 30 km cells
• Cell range up to 100 km should not be precluded

103
 3GPP LTE parameters

Variable spectral allocation size (1.25 to 20 MHz); proportional block

size to maintain the robustness against the mobility (block duration
and inter-carrier spacing are constant)

104
 Downlink performance (SF=16, K=16) *
0
10
CDMA CE CR 1
CDMA CE CR 1/2
OFDMA Distr. CR 1
OFDMA Distr. CR 1/2
−1
10 OFDMA Local. CR 1
OFDMA Local. CR 1/2
BER

−2
10

−3
10

−4
10
0 5 10 15 20 25 30
RX SNR [dB]

105
 Outline

• Introduction
• Direct-Sequence Code-Division Multiple Access (DS-CDMA)
• Universal Mobile Telecommunications System (UMTS)
• Orthogonal Frequency-Division Multiple Access (OFDMA)
• 3GPP Long Term Evolution (3GPP LTE)
• Exercises

106
 Exercise 1

Consider a BPSK sequence spread with a binary code.

• Show that the transmitted sequence can be found by correlating
the received signal with the spreading code.
• What is the impact of the spreading on the bandwidth, transmit
power, PSD, performance?
Demonstrate that 2 users can be separated based on the same
principle if their signal is spread with 2 orthogonal codes.

107
 Exercise 2

Compute the estimated symbol sequence Iˆn at the output of the

DS-SS demodulator and show that there is no ISI remaining (block
diagram in slide 26).
Compute the estimated symbol sequence Iˆnj at the output of the j-th
user DS-CDMA demodulator and show that there is no ISI/MUI
remaining (block diagram in slide 35).

108
 Exercise 3

Compare qualitatively OFDMA (with/without channel knowledge at

the transmitter) and DS-CDMA (Rake receiver or joint detector) in
terms of performance and computational/system implementation
complexity.

109