Documente Academic
Documente Profesional
Documente Cultură
Telecommunications
Engineering I
Jorma Kekalainen
154
Telecommunications
Engineering I
Modulation
155
What is modulation?
156
What is modulation
Idea is to change one or more of the waveform parameters
amplitude, phase, frequency
in a radio-frequency carrier, in response to the signal we want
to transmit.
In other words, we superimpose or combine one signal on
another.
The trick is how to do this so that the original signal can be
recovered at the receiver.
Also desire
minimal cost/complexity,
minimal power wastage,
maximum quality of the recovered signal,
minimum susceptibility to interference (electrical noise and
interference).
157
Types of modulation
There are many different types of modulation:
Amplitude modulation (AM) changes the amplitude of a
high frequency carrier in response to the low-frequency
modulating signal;
Frequency modulation (FM) changes the frequency of a
high frequency carrier in response to the low-frequency
modulating signal;
Phase modulation (PM) changes the phase of a high-
frequency carrier in response to the low-frequency
modulating signal;
Also there are many other combinations (usually of
amplitude and phase), which give higher throughput
(data rate) for digital data systems.
158
Overview of modulation
159
Example
160
Concept of modulation
161
Modulation types
Amplitude Modulation (AM) is where we change the
amplitude of the carrier according to the modulating signal.
Frequency Modulation (FM) is where we change the
frequency of the carrier according to the modulating signal.
Phase Modulation (PM) is where we change the phase of the
carrier according to the modulating signal.
162
AM, FM and PM
163
164
Amplitude modulation
165
Amplitude modulation
Mathematically
Let the carrier be
166
167
168
169
170
Envelope
171
172
AM-analysis
173
AM-analysis
174
AM-analysis
175
AM-analysis
AM waveform showing B as maximum
of envelope, and A as minimum
176
Analysis
177
Analysis
178
Analysis
179
Frequency analysis
181
Frequency analysis
182
Frequency analysis
183
Trigonometric formulas
184
Frequency analysis
185
Frequency analysis
186
Spectrum summary
187
Examples
188
Power
189
Power
Efficiency
Conclusions
192
Double-sideband (amplitude)
modulation
Spectrum for fixed frequency signal m(t) at
frequency m will be at c - m.
193
DSB-AM
194
Single-sideband AM
195
196
197
198
199
200
201
Telecommunications
Engineering I
Angle modulation
202
Angle modulation
203
Frequency modulation
204
Compare with
205
Phase modulation
206
Mathematically,
208
Frequency modulation
Now remember that frequency equals rate of change of phase,
So from
It could be written as
209
Frequency modulation
210
Time waveforms
Frequency and Phase modulation
211
FM Analysis
FM signal for modulation m(t) is
with
212
Note: This is only for a single-tone modulation. In reality the modulation is a complex
signal, but for analysis we use a single test tone.
FM Analysis
Single-tone FM signal
213
FM Analysis
Single-tone FM signal
214
FM Analysis
215
216
Modulation
Index
217
Example Effect of
=1
218
Example Effect of
=2
219
Example Effect of
=4
220
FM Analysis
221
Telecommunications
Engineering I
Digital modulation
Modulation
Digital modulation
digital data is translated into an analog signal (baseband)
ASK, FSK, PSK
differences in spectral efficiency, power efficiency, robustness
Analog modulation
shifts center frequency of baseband signal up to the radio carrier
Motivation
smaller antennas (e.g., /4)
Frequency Division Multiplexing
medium characteristics
Basic schemes
Amplitude Modulation (AM)
Frequency Modulation (FM)
Phase Modulation (PM)
radio
carrier
analog
baseband
digital
signal
analog synchronization data
demodulation decision 101101001 radio receiver
radio
carrier
Digital modulation
225
226
227
Note: log is to base 2, because it is binary information
Bandwidth B ~ 3kHz
With one bit per signalling interval (symbol) M = 2
Using C = 2B log2M,
C = 230001 = 6 kbps
228
229
Note: Here S/N is not expressed in dB
R<C
there exists a code which allows the probability of error at the receiver to
be made arbitrarily small.
This means that theoretically, it is possible to transmit information nearly
without error up to nearly a limit of C bits per second.
If
R>C
the probability of error at the receiver increases without bound as the rate is
increased.
So no useful information can be transmitted far beyond the channel
capacity. 230
Example: PSTN/POTS
SNR = 10log10103 = 30 dB
231
Note: 210 = 1024, so log to base 2 of 1000 is approx. 10.
Digital modulation
232
Digital modulation
Modulation of digital signals known as shift keying
Amplitude Shift Keying (ASK): 1 0 1
very simple
low bandwidth requirements
t
very susceptible to interference
1 0 1
Frequency Shift Keying (FSK):
needs larger bandwidth
t
234
235
236
237
238
239
Digital modulation
240
241
242
Advanced FSK
Bandwidth needed for FSK depends on the distance between
the carrier frequencies
Special pre-computation avoids sudden phase shifts
MSK (Minimum Shift Keying)
bit separated into even and odd bits, the duration of each bit
is doubled
depending on the bit values (even, odd) the higher or lower
frequency, original or inverted is chosen
the frequency of one carrier is twice the frequency of the
other
Even higher bandwidth efficiency using a Gaussian low-pass
filter GMSK (Gaussian MSK), used in GSM
Example of MSK
1 0 1 1 0 1 0
data bit
even 0101
even bits odd 0011
MSK
signal
t
No phase shifts!
245
Advanced PSK
Q
BPSK (Binary Phase Shift Keying):
bit value 0: sine wave
bit value 1: inverted sine wave I
1 0
very simple PSK
low spectral efficiency
robust, used e.g. in satellite systems 10 Q 11
QPSK (Quadrature Phase Shift
Keying):
2 bits coded as one symbol I
symbol determines shift of sine wave
needs less bandwidth compared to
00 01
BPSK
more complex A
Often also transmission of relative,
not absolute phase shift: DQPSK -
Differential QPSK t
11 10 00 01
Hierarchical modulation
DVB-T modulates two separate data streams onto a single DVB-T stream
High Priority (HP) embedded within a Low Priority (LP) stream
Multi carrier system, about 2000 or 8000 carriers
QPSK, 16 QAM, 64QAM
Example: 64QAM
good reception: resolve the entire
Q
64QAM constellation
poor reception, mobile reception:
resolve only QPSK portion
6 bit per QAM symbol, 2 most 10
significant determine QPSK I
HP service coded in QPSK (2 bit),
LP uses remaining 4 bit
00
000010 010101
249
Manchester encoding
250
Received waveforms
Received waveforms are not perfect.
Square edges knocked off due to channel filtering effects
(capacitance/inductance)
May also have noise coupled in
Manchester waveforms after going through simple theoretical channel
252
Summary
253
Telecommunications
Engineering I
Multiplexing and Multiple
Access
254
255
Multiplexing
Multiplexing in 4 dimensions channels ki
space (si) k1 k2 k3 k4 k5 k6
time (t) c
frequency (f) t c
code (c) t
s1
f
s2
Goal: multiple use f
of a shared medium c
t
Frequency multiplexing
Separation of the whole spectrum into smaller frequency bands
A channel gets a certain band of the spectrum for the whole
time
Advantages
no dynamic coordination
k1 k2 k3 k4 k5 k6
necessary
c
works also for analog signals
f
Disadvantages
waste of bandwidth
if the traffic is
distributed
unevenly t
inflexible
FDM: Principle
Each channel carried on different frequency
258
259
FDM
Carrier at different frequencies.
Modulation can be anything
260
FDM: Sub-channels
Filter responses
No channel overlap Channels overlap
261
Frequency-division multiplexing
262
FDM system
263
Composite signal
264
Example: Stereo FM
265
Note: Compatibility is usually needed in upgrades, e.g., black and white TV colour TV
Stereo transmitter
266
Stereo FM spectrum
267
Stereo FM receiver
268
Subcarrier system
269
Subcarrier system
270
271
272
Complete FM transmitter
273
Complete FM receiver
274
275
276
277
OFDM
Multiply and integrate.
Clock synchronization not OFDM recovery
shown.
If equal get a larger product
If not equal low (ideally zero)
product
If all input frequencies are
orthogonal, they will yield zero
for all local frequencies not equal
to the local one.
Thus signals can be recovered,
and can coexist.
278
Advantages
only one carrier in the
medium at any time k1 k2 k3 k4 k5 k6
throughput high even
for many users c
f
Disadvantages
precise
synchronization
necessary t
Advantages k1 k2 k3 k4 k5 k6
better protection against
c
tapping (eavesdropping)
f
protection against frequency
selective interference
but: precise coordination
required
t
Frequency reuse
Frequency reuse only with a certain distance between the base stations
Standard model using 7 frequencies:
f3
f5 f2
f4 f6 f5
f1 f4
f3 f7 f1
f2
Fixed frequency assignment:
certain frequencies are assigned to a certain cell
problem: different traffic load in different cells
Dynamic frequency assignment:
base station chooses frequencies depending on the frequencies already
used in neighbor cells
more capacity in cells with more traffic
assignment can also be based on interference measurements
Frequency reuse
f3 f3 f3 f2 f3 f7
f2 f2 f5 f2
f1 f1 f1 f4 f6 f5
f3 f3 f1 f4
3 cell cluster f3 f7 f1
f2 f2 f2
f1 f1 f2 f3
f3 f3 f3 f6 f5 f2
7 cell cluster
f2 f2 f2
f1 f f f f3
3 h 1 f3 h2 1
h1 2
g 2 h3 g 2 1 h3
h
g2 3 cell cluster
g1 g1 g1
g3 g3 g3 with 3 sector antennas
Multiple-access control
286
288
289
290
291
Analogy
292
293
294
295
FDMA
Channel spectrum divided into frequency bands
each station assigned fixed frequency band
unused transmission time in frequency bands go idle
example: 6-station LAN, 1,3,4 have packet, frequency bands
2,5,6 idle
frequency bands
FDM cable
296
298
TDMA
access to channel in "rounds"
each station gets fixed length slot (length = single packet
can be transmitted during a slot time) in each round
unused slots go idle
example: 6-station LAN, 1,3,4 have packet, slots 2,5,6 idle
6-slot
frame
1 3 4 1 3 4
299
Synchronization
The main problem with TDMA lies in achieving
synchronization between the different stations.
Each station needs to know the beginning of its slot and the
location of its slot.
This may be difficult because of propagation delays introduced
in the system if the stations are spread over a large area.
To compensate for the delays, we can insert guard times.
Synchronization is normally accomplished by having some
synchronization bits (normally referred to as preamble bits) at
the beginning of each slot.
300
301
303
304
f f
Side effects:
coexistence of several signals without dynamic coordination
tap-proof
Alternatives: Direct Sequence (DS), Frequency Hopping (FH)
Spread Spectrum
306
user signal
i) ii) broadband interference
narrowband interference
f f
sender
dP/df dP/df dP/df
iii) iv) v)
f f f
receiver
2 narrowband channels
1 5 6
3
4
frequency
narrow band guard space
signal
channel
quality
2
2 spread spectrum channels
2
2
2
1
spread frequency
spectrum
Spread spectrum
Instead of transmitting on one or a few frequencies, the
modulator deliberately tries to use a much wider channel
bandwidth.
It is used:
military communications,
cellular communications (where the term CDMA is used),
interference-prone environments
309
310
N 1
Rxy (k ) = lim
1
Definition of cross-correlation function:
N N
x
n=0
n yn k
311
Correlation
Each user in a CDMA system uses a different code to modulate their
signal.
Choosing the codes used to modulate the signal is very important in the
performance of CDMA systems.
The best performance will occur when there is good separation between the
signal of a desired user and the signals of other users.
The separation of the signals is made by correlating the received signal
with the locally generated code of the desired user.
If the signal matches the desired user's code then the value of correlation
function will be high and the system can extract that signal.
If the desired user's code has nothing in common with the signal the
correlation should be as close to zero as possible (thus eliminating the
signal).
If the code is correlated with the signal at any time offset other than zero,
the correlation should be as close to zero as possible.
This is used to reject multi-path interference (operation is referred to as
auto-correlation).
312
Synchronous CDMA
In general, CDMA belongs to two basic categories: synchronous (orthogonal codes)
and asynchronous (pseudorandom codes).
Synchronous CDMA exploits mathematical properties of orthogonality between
vectors representing the data strings.
For example, binary string "1011" is represented by the vector (1, 0, 1, 1).
Vectors can be multiplied by taking their dot product, by summing the products of
their respective components.
Example: if u=(a,b) and v=(c,d), the dot product uv = a*c + b*d.
If the dot product is zero, the two vectors are said to be orthogonal to each other
If vectors a and b are orthogonal, then
313
Synchronous CDMA
Asynchronous CDMA
Since it is not mathematically possible to create sequences that are
orthogonal for arbitrarily random starting points, unique pseudo-random or
pseudo-noise (PN) sequences are used in Asynchronous CDMA systems.
A PN code is a binary sequence that appears random but can be reproduced
in a deterministic manner by intended receivers.
These PN codes are used to encode and decode a user's signal in
Asynchronous CDMA in the same manner as the orthogonal codes in
synchronous CDMA.
These PN sequences are statistically uncorrelated, and the sum of a large
number of PN sequences results in Multiple Access Interference (MAI) that
is approximated by a Gaussian noise process.
If all of the users are received with the same power level, then the variance
(the noise power) of the MAI increases in direct proportion to the number
of users.
In other words, unlike synchronous CDMA, the signals of other users will
appear as noise to the signal of interest and interfere slightly with the
desired signal in proportion to number of users.
315
Processing gain
All forms of CDMA use spread spectrum processing gain (spreading factor) to
allow receivers to partially discriminate against unwanted signals.
Signals encoded with the specified PN sequence (code) are received, while signals
with different codes (or the same code but a different timing offset) appear as
wideband noise reduced by the process gain.
Since each user generates MAI (Multiple Access Interference) , controlling the
signal strength is an important issue with CDMA transmitters.
A Synchronous CDMA, TDMA or FDMA receiver can in theory completely reject
arbitrarily strong signals using different codes, time slots or frequency channels due
to the orthogonality of these systems.
This is not true for Asynchronous CDMA; rejection of unwanted signals is only
partial.
If any or all of the unwanted signals are much stronger than the desired signal, they
will overwhelm it.
This leads to a general requirement in any Asynchronous CDMA system to
approximately match the various signal power levels as seen at the receiver
(Near-far problem).
In CDMA cellular, the base station uses a fast closed-loop power control scheme
to tightly control each mobile's transmit power.
316
Characteristics of CDMA
CDMA can also effectively reject narrowband interference.
Since narrowband interference affects only a small portion of the spread spectrum
signal, it can easily be removed through notch filtering without much loss of
information.
Convolution encoding and interleaving can be used to assist in recovering this lost
data.
CDMA signals are also resistant to multipath fading.
Since the spread spectrum signal occupies a large bandwidth only a small portion of this
will undergo fading due to multipath at any given time.
Like the narrowband interference this will result in only a small loss of data and can be
overcome.
Another reason that CDMA is resistant to multipath interference is because the
delayed versions of the transmitted pseudorandom codes will have poor
correlation with the original pseudorandom code, and will thus appear as another
user, which is ignored at the receiver.
In other words, as long as the multipath channel induces at least one chip of delay,
the multipath signals will arrive at the receiver such that they are shifted in time by
at least one chip from the intended signal.
The correlation properties of the pseudorandom codes are such that this slight
delay causes the multipath to appear uncorrelated with the intended signal, and
it is thus ignored.
318
A spreading code assigned to each station is also called chip sequence.
Characteristics of CDMA
Some CDMA devices use a rake receiver, which exploits
multipath delay components to improve the performance of the
system.
A rake receiver combines the information from several correlators,
each one tuned to a different path delay, producing a stronger version
of the signal than a simple receiver with a single correlator tuned to the
path delay of the strongest signal.
Frequency reuse is the ability to reuse the same radio channel
frequency at other cell sites within a cellular system.
In the FDMA and TDMA systems frequency planning is of paramount
importance.
The frequencies used in different cells need to be planned carefully in
order to ensure that the signals from different cells do not interfere with
each other.
In a CDMA system the same frequency can be used in every cell
because channelization is done using the pseudorandom codes.
319
320
321
322
323
user data
0 1 0 1 1 t
f
td
f3 slow
f2 hopping
(3 bits/hop)
f1
td t
f
f3 fast
f2 hopping
(3 hops/bit)
f1
326
narrowband
spread
signal
transmit
user data signal
modulator modulator
frequency hopping
synthesizer sequence
transmitter
narrowband
received signal
signal data
demodulator demodulator
hopping frequency
sequence synthesizer
receiver
328
330
332
Note: Exclusive-OR
334
chipping radio
sequence carrier
transmitter
correlator
lowpass sampled
received filtered products sums
signal signal data
demodulator X integrator decision
radio chipping
carrier sequence
receiver
DSSS system
Multiply BPSK signal,
sd(t) = A d(t) cos(2 fct)
by c(t) [+1, -1] to get
s(t) = A d(t)c(t) cos(2 fct)
A = amplitude of signal
fc = carrier frequency
d(t) = [+1, -1]
At receiver, incoming
signal multiplied by c(t)
Since, c(t) x c(t) = 1,
incoming signal is
recovered
336
DSSS-CDMA
338
0 fc fc 0
Transmission Reception
Coding
Baseband Walsh Code Walsh Code Deinterleaving Baseband
and
Information Bits Spread Correlator and Decoding Information Bits
Interleaving
9,6 kbps 19,2 kbps chip rate chip rate 19,2 kbps 9,6 kbps
-113 dBm (1,23 MHz) Spurious Signals chip rate (BW) chip rate (BW)
fc fc fc fc
Thermal Noise External Interference Interference from other Interference from users 339
cells within the system within the same cell
CDMA
Receiver for User 1
m1(t)+
Transmitter for User 1 Wireless m2(t)c1(t)c2(t) m1(t)+e1(t)
m1(t)
m1(t) m1(t)c1(t) Channel TSym bol
c2(t)
The spreading code is a series of numbers that look random, but are
actually a pattern.
Data Symbol
Symbol Detection
342
PN sequences
PN generator produces periodic sequence that
appears to be random
PN Sequences
Generated by an algorithm using initial seed
Sequence is not statistically random but will pass many
test of randomness
Sequences referred to as pseudorandom numbers or
pseudonoise sequences
Unless algorithm and seed are known, the sequence is
impractical to predict
343
Pseudo-random sequence
Can generate the pseudo-random sequence (PN, Pseudo-Noise) using shift registers
with feedback.
Low the register with initial starting point.
The parallel output of the registers can be used to select the carrier frequency in
Frequency Hopping system.
The single bit output of one register can be used to select the plus/minus multiplier
in Direct Sequence system (0 binary for -1 volt, 1 binary for +1 volt)
344
Important PN properties
Randomness
Uniform distribution
Independence
Correlation property
The periodic autocorrelation of a 1 m-sequence is
1 = 0, N, 2N, ...
R ( ) = 1
otherwise
N
Where N=2m-1 is sequence length of m-stage register
Maximal length sequences are not perfectly orthogonal
Maximal length sequences have good auto-correlation properties
Unpredictability
345
Definitions
Correlation
The concept of determining how much similarity
or resemblance one set of data has with another
Range between 1 and 1
1 The second sequence matches the first sequence
0 There is no relation at all between the two sequences
-1 The two sequences are mirror images
Cross correlation
The comparison between two sequences from
different sources rather than a shifted copy of a
sequence with itself
346
Orthogonal codes
Orthogonal codes
All pairwise cross-correlations are zero
Fixed- and variable-length codes used in CDMA systems
For CDMA application, each mobile user uses one
sequence in the set as a spreading code
Provides zero cross-correlation among all users
Types
Walsh codes
Variable-Length orthogonal codes
Chipping sequence
In a CDMA protocol, each bit being sent is encoded by
multiplying the bit by a signal or spreading code (the chipping
sequence) that changes at a much faster rate (known as the
chipping rate) than the original sequence of data bits.
Suppose that the rate at which original data bits reach the
CDMA encoder defines the unit of time; that is, each original
data bit to be transmitted requires a one-bit slot time.
Let di be the value of the data bit for the ith bit slot.
For mathematical convenience, we represent a data bit with a 0
value as -1.
Each bit slot is further subdivided into M mini-slots.
The CDMA code used by the sender consists of a sequence of
M values, cm, m = 1, . . . ,M, each taking a +1 or -1 value.
348
CDMA example
349
CDMA example
350
Recap: CDMA
351
352
FSK = Frequency Shift Keying
Conventional FSK
FSK time waveforms
353
354
Frequency spectra
FSK and FHFSK
355
356
QPSK = Quadrature Phase Shift Keying
357
358
Frequency spectra
QPSK-DSSS frequency spectra
359
360
Frequency spectra
Frequency spectra: QPSK and FHQPSK
361
Summary
362