Wireless Communication Systems
@CS.NCTU
Lecture 2: Modulation and Demodulation Reference: Chap. 5 in Goldsmith’s book
Instructor: Kate Ching-Ju Lin (林靖茹)
1
Wireless Communication Systems @CS.NCTU Lecture 2: Modulation and - - PowerPoint PPT Presentation
Wireless Communication Systems @CS.NCTU Lecture 2: Modulation and Demodulation Reference: Chap. 5 in Goldsmiths book Instructor: Kate Ching-Ju Lin ( ) 1 Modulation From Wikipedia: The process of varying one or more properties of
1
2
From Wikipedia: The process of varying one or more properties of a periodic waveform with a modulating signal that typically contains information to be transmitted.
0.5 1
0.5 1
modulate
3
4
5
wireless channel TX transmitted Signal s(t) 1 1 1 bit stream
RX 1 1 1
received signal x(t) wireless channel TX transmitted Signal s(t) 1 1 1 bit stream
9
10
11 Transmitter Receiver x(t)
+
n(t) AWGN Channel s(t) i 1 K m ={b ,...,b } ^ 1 K m ={b ,...,b } ^ ^
12
𝑏 𝑢 2𝜌𝑔
&𝑢 + 𝜚 𝑢
𝑡 𝑢
13
I(t) + s2 Q(t)
𝑏 𝑢 𝜚 𝑢 𝑡′ 𝑢
exp(iθ) = cos(θ)+jsin(θ)
16
TX RX
signal s(t)
1 1 1 1 1 1
bit stream b(t) modulation demodulation
17
18
1 1 1 1 Time
(a) (c)
Time 4-ary signal 3
1
(b)
m (t ) A
3 A Time T T 4-ASK signal s (t ) Binary sequence 1
§ bit-rate = baud rate
§ Hard to pick a right threshold
1 baud 1 second
Bandwidth is the difference between the upper and lower frequencies in a continuous set of frequencies.
21
TX signal s(t)
1 1 1
bit stream modulation RX
1 1 1
demodulation
22
§ Bit-rate = baud rate
§ BW(min) = Nb + Nb
25
TX RX signal s(t) 1 1 1 bit stream s(t) modulation 1 1 1 demodulation
‘1’ ‘0’
s1=1+0i n1 n0
s’=a+bi s0=-1+0i
s1=1+0i
‘1’ ‘0’
s0=-1+0i
s’=a+bi
n s’ = a+bi
30
From Wikipedia: Q(x) is the probability that a normal (Gaussian) random variable will
Minimum distance of any two cancellation points
31
Band-pass representation
32
‘00’ ‘10’ ‘01’ ‘11’
‘00’ ‘10’ ‘01’ ‘11’
‘00’ = 1/√2(1+1i) ‘10’ ‘01’ ‘11’
1 2 1 2 − 1 2 − 1 2
36
37
38
‘10’ ‘01’ ‘11’
1 2 1 2 − 1 2
− 1 2
‘1’ ‘0’
‘111’ ‘100’ ‘010’ ‘011’ ‘001’ ‘000’ ‘100’ ‘101’
‘1111’ ‘0000’
Denser constellation points à higher BER Acceptable reliability
‘1000’ ‘1100’ ‘0100’ ‘0000’ ‘1001’ ‘1101’ ‘0101’ ‘0001’ ‘1011’ ‘1111’ ‘0111’ ‘0011’ ‘1010’ ‘1110’ ‘0110’ ‘0010’
2
a 3a
16-QAM
Signal Encoder 90 degree shift × × Message Source Band-pass Signal s(t) + +
Map each bit into sI(t) and sQ(t)
sI(t) sQ(t)
mixer
cos(2πfct) sin(2πfct)
Band- pass Filter 90 degree shift × × Message Sink Received Signal plus noise
Filters out out-
and noises
x(t) = s(t) + n(t) Low- pass Filter Signal Detector Low- pass Filter
0.5[AcsI(t) + nI(t)] 0.5[AcsQ(t) + nQ(t)]
cos(2πfct) sin(2πfct)
46
[sI(t)+n(t)] + j[sQ(t)+n(t)]
0000..000 0000..010
0001..100
0111..110
s1
I(t) + js1 Q(t)
s2
I(t) + js2 Q(t)
. . . sk
I(t) + jsk Q(t)
. . . sK
I (t) + jsK Q(t)
… …
47
48