Dec 17, 2007 ... to transmit a periodic reference burst that defines a frame and forces a measure
of synchronization of all the users. The frame so-defined is ...
TDMA, FDMA, and CDMA Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008
Time Division Multiple Access (TDMA) Each user is allowed to transmit only within specified time intervals (Time Slots). Different users transmit in differents Time Slots. When users transmit, they occupy the whole frequency bandwidth (separation among users is performed in the time domain).
2
TDMA : Frame Structure TDMA requires a centralized control node, whose primary function is to transmit a periodic reference burst that defines a frame and forces a measure of synchronization of all the users. The frame so-defined is divided into time slots, and each user is assigned a Time Slot in which to transmit its information.
TS Time Slot
Re
fe
re B u nce rs t
Frame TF
3
TDMA : Frame Structure User 1
User 2
User 3
4
TDMA : guard times Since there are significant delays between users, each user receives the reference burst with a different phase, and its traffic burst is transmitted with a correspondingly different phase within the time slot. There is therefore a need for guard times to take account of this uncertainty. Each Time Slot is therefore longer than the period needed for the actual traffic burst, thereby avoiding the overlap of traffic burst even in the presence of these propagation delays. with guard time
misalignment
without guard time
misalignment 5
TDMA : preamble Since each traffic burst is transmitted independently with an uncertain phase relaive to the reference burst, there is the need for a preamble at the beginning of each traffic burst. The preamble allows the receiver to acquire on top of the coarse synchronization provided by the reference burst a fine estimate of timing and carrier phase.
preamble
information
6
TDMA: reference transmitter scheme
S Digital signal
IN T U W O O SL ST A F
TDMA coder
Pulse Shaper
Mod
STX
BUFFER fP Code generator
Carrier generator
7
TDMA: a case study User j
s
(t )= !k a k #(t " kT )
(j )
(j )
Digital signal of user j Sequence of equally spaced binary antipodal symbols ak : k-th binary antipodal symbol generated by user j (j)
T : time period between symbols
s(j)(t)
1 0.8 0.6 E 0.4 D U 0.2 T I 0 L P M -0.2 A -0.4 -0.6 -0.8 -1 0
1
2
3
4
5 TIME
6
7
8
9
10 -3
x 10
8
TDMA: a case study Compressed signal
s
s C(j )(t )
IN T U W O O SL ST A F
(t )
(j )
BUFFER
The symbols of the original signal are organized in groups of Nbps symbols. Each group is transmitted in a single Time Slot of duration TS. Time Slots are organized in frames of duration TF. Signal after compression 1
1 0.8
0.8 ] V [
0.6 E 0.4 D U 0.2 T I 0 L P M -0.2 A
E D U T I L P M A
-0.4 -0.6
0.6 0.4 0.2 0 -0.2 -0.4 -0.6
-0.8
-0.8
-1 0
1
2
3
4
5 TIME
6
7
8
9
10 -3
x 10
-1 0
1
2
3
4
5 TIME [s]
6
7
8
9
10 -3
x 10
9
TDMA: a case study
s (j )(t )= !k a (kj ) #(t " kT ) N bps
s C(j )(t )= !m ! a (kj+)mN bps #(t " kTC " mTF ) k =1
TC : time interval between symbols after compression Signal after compression 1
1 0.8
0.8 ] V [
0.6 E 0.4 D U 0.2 T I 0 L P M -0.2 A
E D U T I L P M A
-0.4 -0.6
0.6 0.4 0.2 0 -0.2 -0.4 -0.6
-0.8
-0.8
-1 0
1
2
3
4
5 TIME
6
7
8
9
10 -3
x 10
-1 0
1
2
3
4
5 TIME [s]
6
7
8
9
10 -3
x 10
10
TDMA: a case study the m fro ffer bu
s C (t ) (j )
TDMA coder
j) (t ) s (TDMA
TDMA Coded Signal The position in time of each group is modified according to the TDMA code, which is assigned to the user.
Code generator
In other words, the TDMA code indicates which slot inside each frame must be occupied by the user.
Signal after compression
] V [ E D U T I L P M A
1
1
0.8
0.8
0.6
] V [
0.4
0.6 0.4
-0.4
E D 0.2 U T 0 I L P -0.2 M A -0.4
-0.6
-0.6
-0.8
-0.8
0.2 0 -0.2
-1
-1
0
1
2
3
4
5 TIME [s]
6
7
8
9
10
0 -3
x 10
1
2
3
4
5 6 TIME [s]
7
8
9
10 -3
x 10
11
TDMA: a case study N bps
s C(j )(t )= !m ! a (kj+)mN bps #(t " kTC " mTF ) k =1
N bps
(
j) (t )= !m ! a (kj+)mN bps # t " kTC " c (mj)TS " mTF s (TDMA k =1
)
cm(j) : TDMA code assigned to user j for the m-th frame
Signal after compression
] V [ E D U T I L P M A
1
1
0.8
0.8
0.6
] V [
0.4
0.6 0.4
-0.4
E D 0.2 U T 0 I L P -0.2 M A -0.4
-0.6
-0.6
-0.8
-0.8
0.2 0 -0.2
-1
-1
0
1
2
3
4
5 TIME [s]
6
7
8
9
10
0 -3
x 10
1
2
3
4
5 6 TIME [s]
7
8
9
10 -3
x 10
12
TDMA: a case study e th der m co (j ) o r f A TDMA M TD
s
(t )
Pulse Shaper
Transmitted signal S(j)TX(t) at Radio Frequencies
Mod
Carrier generator
All users adopt the same carrier frequency fp for modulating the baseband signal
fP
s (bbj ) (t ) Base-band signal 1 0.8 ] V [
100
100
0.6
] V [
0.4
E D 0.2 U T 0 I L P -0.2 M A -0.4
] V [
50
E D U T I L P M A
E D U T 0 I L P M A -50
50
0
-50
-0.6 -0.8
-100
-100
-1 0
1
2
3
4
5 6 TIME [s]
7
8
9
10 -3
x 10
0
0.002
0.004
0.006
0.008
0.01
0.012
0.014
0
0.002
0.004
0.006 0.008 TIME [s]
0.01
0.012
TIME [s]
13
0.014
TDMA: a case study N bps
(
j) (t )= !m ! a (kj+)mN bps # t " kTC " c (mj)TS " mTF s (TDMA k =1
)
For the sake of simplifying the notation, let us consider the simple case of BPSK (in phase carrier modulation)
(
) (
j) j) (t )= 2PTX s (TDMA (t )# g 0 ( t) sin 2"fP t + !(j) s (TX
g0(t) : energy-normalized impulse response of the Pulse Shaper. It has unitary energy.
)
PTX : transmitted power fP : carrier frequency ϕ(j) : istantaneous phase
14
TDMA: a case study
s (RXj ) (t )
s TX (t ) (j )
15
100 ] V [ E D U T I L P M A
50
0
] V [
10
e d u t i l p m A
5
0
-5
-50 -10
-100 -15
0
0.002
0.004
0.006 0.008 TIME [s]
0.01
0.012
0.014
0
BEWARE! At risk for multi user interference!
0.002
0.004
0.006
0.008 0.01 Time [s]
0.012
0.014
0.016
Received signal after propagation over a two-paths channel 15
TDMA: a case study 15
] V [
10
e d u t i l p m A
5
Received waveform
0
-5
Front-end filtering -10
-15
Demodulation Sampling 0
0.002
Threshold detection
0.004
0.006
0.008 0.01 Time [s]
0.012
0.014
0.016
1
0.8
] V [
0.6
Received binary antipodal signal
0.4
E D 0.2 U T 0 I L P -0.2 M A -0.4 -0.6 -0.8 -1 0
1
2
3
4
5 6 TIME [s]
7
8
9
10 -3
x 10
16
Frequency Division Multiple Access (FDMA) Each user transmits with no limitations in time, but using only a portion of the whole available frequency bandwidth. Different users are separated in the frequency domain.
17
FDMA vs. TDMA Frequency division is very simple: all transmitters sharing the medium have output power spectra in non-overlapping bands. Many of the problems experienced in TDMA due to different propagation delays are eliminated in FDMA.
The major disadvantage of FDMA is the relatively expensive and complicated bandpass filters required. TDMA is realized primarily with much cheaper logic functions.
Another disadvantage of FDMA is the rather strict linearity requirement of the medium.
18
FDMA: reference scheme
S
Pulse Shaper
Mod
STX
Digital signal Code generator
Carrier generator
19
FDMA: a case study Base-band signal
Digital binary signal
s
FDMA-coded signal
s bb (t )
(t )
(j ) (t ) s FDMA
(j )
(j )
Generated bit stream for each user
Signal after Pulse Shaping
Signal after FDMA coding 60
60 1
40
40 0.5
0
-0.5
20
20
0
0
-20
-20
-40
-40
-1 -60 0
5
10 x 10
-60 0
0.005
0.01
0.015
0
0.005
0.01
0.015
-3
20
FDMA: a case study
s
Digital binary signal (j ) (j ) k k
(t )= !
a #(t " kT )
Base-band signal (j ) 0
s (bbj ) (t )= s
(t )! g (t )
FDMA-coded signal
( (
s FDMA (t )= 2PTX s bb ( t ) sin 2# fP + c (j )
STX(j)(t)
(j )
(t )"f )t + !
(j )
(j )
)
Δf : frequency spacing between adjacent users c(j) : FDMA code assigned to user j
21
FDMA: a case study 8 6 ] V [ e d u t i l p m A
Transmitted signal at RF
4 2 0 -2 -4
Propagation Demodulation (Decoding)
-6 -8 0
0.005
] V [
0.01 Time [s ]
0.015
0.02
Received Signal after Demodulation (Decoding)
40 e d 20 u t 0 i l p -20 m A -40
Transmitted Received
-60 0
Sampling
Received base-band waveform
0.002
0.004
0.006
0.008
0.01
0.012
0.014
0.016
0.018
Samples of the received waveform
-3
x 10
Samples at the receiver output
4 2 0 -2 -4
Threshold detection
-6 -4
-2
0
2
4
6
8
10
12
14
16
Received binary stream
1.5
1
0.5
0
-0.5 -4
-2
0
2
4
6
8
10
12
14
16
22
TDMA + FDMA
FDMA
TDMA + FDMA 23
TDMA + FDMA in GSM900 standard
24
Code Division Multiple Access (CDMA)
25
CDMA: basic principles In CDMA each user is assigned a unique code sequence (spreading code), which it uses to encode its data signal. The receiver, knowing the code sequence of the user, decodes the received signal and recovers the original data. The bandwidth of the coded data signal is chosen to be much larger than the bandwidth of the original data signal, that is, the encoding process enlarges (spreads) the spectrum of the data signal. CDMA is based on spread-spectrum modulation.
If multiple users transmit a spread-spectrum signal at the same time, the receiver will still be able to distinguish between users, provided that each user has a unique code that has a sufficiently low crosscorrelation with the other codes.
26
CDMA schemes Direct Sequence CDMA (DS-CDMA) The original data signal is multiplied directly by the high chip rate spreading code.
Frequency Hopping CDMA (FH-CDMA) The carrier frequency at which the original data signal is transmitted is rapidly changed according to the spreading code.
Time Hopping CDMA (TH-CDMA) The original data signal is not transmitted continuously. Instead, the signal is transmitted in short bursts where the times of the bursts are decided by the spreading code.
27
Direct Sequence Spread Spectrum Cx
x(t)
s(t)
CODING
frequency
Band of the original signal
frequency
band of the coded signal
28
Direct Sequence Spread Spectrum
Original signal (band related to the bit rate)
Spreading sequence composed by chips, with chip rate >> bit rate
Coded signal (band related to the chip rate)
29
Signal 1
Coded signal 1
Signal 2
Direct Sequence Spread Spectrum
Coded signal 2
Sum of coded signals 1 and 2
30
Direct Sequence Spread Spectrum code used for signal 1
Received signal
multiplier
signal 1
decoded signal
31
Frequency Hopping Spread Spectrum In FH-SS, the transmitter spreads the spectrum by continuously jumping from one frequency channel to another
A larger number of intervals leads to a better spreading Each user selectees the next frequency hop according to a code (FH code)
32
Frequency Hopping Spread Spectrum Time-frequency occupation for a FH-SS signal f
Dwell time
f9 f8 f7 f6 f5 f4 f3 f2 f1 f0 t FH code period 33
Frequency Hopping Spread Spectrum FH-SS signal robustness to a interferers at constant frequency f f9 Interference limited f8 f7 a un dwell time f6 f5 f4 f3 f2 f1 f0
Interferer at constant frequency
t
34
Frequency Hopping Spread Spectrum Coexistence of different FH-SS signals f
Signal 1 Signal 2
f9 f8 f7 f6 f5 f4 f3 f2 f1 f0 t
If codes are well chosen (orthogonal)
No interference!!
35
CDMA : the partial correlation problem Partial correlations among encoded signals arise when no attempt is made to synchronize the transmitters sharing the channel, or when propagation delays cause misalignment even when transmitters are synchronized. Partial correlations impede the receiver to totally cancel the contributions of other users even in the presence of spreading codes having low cross-correlation. In presence of partial correlations, the received signal is therefore affected by Multi User Interference. The partial correlations can be reduced by proper choice of the spreading codes, but cannot be totally eliminated. CDMA system capacity is thus tipically limited by the interference from other users, rather than by thermal noise. noise
36
CDMA : the near-far problem If all the users transmit at the same power level, then the received power is higher for transmitters closer to the receiving antenna. Thus, transmitters that are far from the receiving antenna are at a disadvantage with respect to interference from other users. This inequity can be compensated by using power control. control Each transmitter can accept central control of its transmitted power, such that the power arriving at the common receiving antenna is the same for all transmitters. In other words, the nearby transmitters are assigned a lower transmit power level than the far away transmitters. Power control can be easily achieved in centralized access schemes (e.g. third generation cellular networks), but is a challenging issue in distributed systems.
37
DS-CDMA: reference scheme Transmitter
S
CDMA coder (multiplier)
Pulse Shaper
Mod
STX
Digital signal fP Code generator
Carrier generator
38
DS-CDMA: reference scheme Receiver
SRX Received signal
Front-End filter and demodulator
Multiplier
Integrator
he t o t sor i c de
Code generator
39
DS-CDMA: a case study
binary data signal
s
DS-CDMA-coded signal
Codeword
(t )
(j )
c
Generated bit stream for each user
(j ) (t ) s DSCDMA
[k ]
(j )
Assigned Codeword
Binary signal after coding for each user
1 1 1
0.8
0.8
0.6
0.6
0.4
0.5
0.4
0.2
0.2
0
0
0
-0.2
-0.2
-0.4
-0.4 -0.5
-0.6
-0.6
-0.8
-0.8
-1
-1 -1 0
5
10 x 10
0
2
4
6
8
0
0.005
0.01
-3
40
DS-CDMA: a case study
s
Digital binary signal (j ) (j ) k k
(t )= !
a #(t " kT )
DS-CDMA-coded signal N DS (j ) (j ) k k m =1
(j ) (t )= ! a s DSCDMA
! c [m]#(t " mT
NDS : length of the codeword TC : chip time
(
C
Spreading Signal
) (
s TX (t )= 2PTX s DSCDMA (t )# g 0 ( t) sin 2"fP t + ! (j )
(j )
L
(
j) (t )% h (j)(t )= ! $ (l j)s (TXj) t # "(l j) s (RXj ) (t )= s (TX l =1
" kT )
)
(j )
)
Transmitted signal
Signal after propagation over a multipath channel 41
DS-CDMA: a case study ] V [
-4
x 10
Received Signal after Demodulation
e d 1 u t i 0 l p m -1 A ] V 0 0.001 0.002 0.003 0.004 0.005 0.006 0.007 0.008 0.009 [ -4 Received Signal after Code Multiplication x 10 e d 1 u t i 0 l p m -1 A ] V 0 0.001 0.002 0.003 0.004 0.005 0.006 0.007 0.008 0.009 [ -4 Received Signal after Integration x 10 e d u 5 t i 0 l p m -5 A 0
0.001 0.002 0.003 0.004 0.005 0.006 0.007 0.008 0.009
Received signal after Front-End filtering and demodulation 0.01
Signal obtained by direct multiplication of the baseband signal with the spreading signal 0.01
Received sequence after integration of the above samples 0.01
42