Data and Signals
Data and Signals
3.1
3-4 TRANSMISSION IMPAIRMENT
3.2
Figure 3.25 Causes of impairment
3.3
Attenuation
Means loss of energy -> weaker
signal
When a signal travels through a
medium it loses energy overcoming
the resistance of the medium
Amplifiers are used to compensate
for this loss of energy by amplifying
the signal.
3.4
Measurement of
Attenuation
To show the loss or gain of energy
the unit “decibel” is used.
dB = 10log10P2/P1
P1 - input signal
P2 - output signal
3.5
Figure 3.26 Attenuation
3.6
Example 3.26
3.8
Example 3.28
3.9
Figure 3.27 Decibels for Example 3.28
3.10
Example 3.29
Solution
We can calculate the power in the signal as
3.11
Example 3.30
3.12
3.13
Distortion
Means that the signal changes its form or
shape
Distortion occurs in composite signals
Each frequency component has its own
propagation speed traveling through a
medium.
The different components therefore arrive
with different delays at the receiver.
That means that the signals have
different phases at the receiver than they
did at the source.
3.14
Figure 3.28 Distortion
3.15
3.16
Noise
There are different types of noise
Thermal - random noise of electrons in
the wire creates an extra signal
Induced - from motors and appliances,
devices act are transmitter antenna
and medium as receiving antenna.
Crosstalk - same as above but
between two wires.
Impulse - Spikes that result from
power lines, lighning, etc.
3.17
Figure 3.29 Noise
3.18
Signal to Noise Ratio
(SNR)
To measure the quality of a system
the SNR is often used. It indicates
the strength of the signal wrt the
noise power in the system.
It is the ratio between two powers.
It is usually given in dB and
referred to as SNRdB.
3.19
Example 3.31
Solution
The values of SNR and SNRdB can be calculated as
follows:
3.20
Example 3.32
3.21
Figure 3.30 Two cases of SNR: a high SNR and a low SNR
3.22
3-5 DATA RATE LIMITS
3.23
Note
3.24
Capacity of a System
The bit rate of a system increases with an
increase in the number of signal levels we
use to denote a symbol.
A symbol can consist of a single bit or “n”
bits.
The number of signal levels = 2n.
As the number of levels goes up, the
spacing between level decreases ->
increasing the probability of an error
occurring in the presence of transmission
impairments.
3.25
Nyquist Theorem
Nyquist gives the upper bound for the bit
rate of a transmission system by
calculating the bit rate directly from the
number of bits in a symbol (or signal
levels) and the bandwidth of the system
(assuming 2 symbols/per cycle and first
harmonic).
Nyquist theorem states that for a
noiseless channel:
C = 2 B log22n
C= capacity in bps
B = bandwidth in Hz
3.26
Example 3.33
Solution
They match when we have only two levels. We said, in
baseband transmission, the bit rate is 2 times the
bandwidth if we use only the first harmonic in the worst
case. However, the Nyquist formula is more general than
what we derived intuitively; it can be applied to baseband
transmission and modulation. Also, it can be applied
when we have two or more levels of signals.
3.27
Example 3.34
3.28
Example 3.35
3.29
Example 3.36
C = B log2(1 + SNR)
3.31
Example 3.37
3.32
Example 3.38
This means that the highest bit rate for a telephone line
is 34.860 kbps. If we want to send data faster than this,
we can either increase the bandwidth of the line or
improve the signal-to-noise ratio.
3.33
Example 3.39
3.34
Example 3.40
3.35
Example 3.41
Solution
First, we use the Shannon formula to find the upper
limit.
3.36
Example 3.41 (continued)
3.37
Note
3.38
Example 3.43
3.39
Example 3.44
Solution
We can calculate the throughput as
3.41
Propagation and Transmission
Delay
Propagation Delay = Distance/Propagation
speed
3.42
Example 3.45
Solution
We can calculate the propagation time as
Solution
We can calculate the propagation and transmission time
as shown on the next slide:
3.44
Example 3.46 (continued)
3.45
Example 3.47
Solution
We can calculate the propagation and transmission
times as shown on the next slide.
3.46
Example 3.47 (continued)
3.47
Figure 3.31 Filling the link with bits for case 1
3.48
Example 3.48
3.49
Figure 3.32 Filling the link with bits in case 2
3.50
Note
3.51
Figure 3.33 Concept of bandwidth-delay product
3.52