Академический Документы
Профессиональный Документы
Культура Документы
Digital Transmission
Stephen Kim
4.2
Line Coding
The process of converting digital data to
digital signals
◦ Digital data – sequences of bits
4.3
Line coding and decoding
4.4
Characteristics of Line
Coding
Signal element vs. data element
◦ A signal element is the shortest time unit of a digital signal.
◦ Data elements are what to need to send as information.
Data rate vs. signal rate
◦ Data rate (bit rate) – the number of data elements in a unit time (bps).
◦ Signal rate (pulse, modulation rate, baud rate) – the number of signal
element in a unit time (baud).
◦ The goal is two-fold of “high data rate” and “low signal rate”.
Bandwidth
◦ Although the actual bandwidth of a digital signal is infinite, the effective
bandwidth is finite.
Baseline wandering
DC components – unable to pass a low-pass filter
Self-synchronization
Built-in error detection
Immunity to noise and interferences
Complexity
4.5
Figure 4.2 Signal element versus data element
4.6
Example 4.1
Solution
We assume that the average value of c is 1/2 . The
baud rate is then
4.7
Example 4.2
4.8
Figure 4.3 Effect of lack of synchronization
4.9
Example 4.3
4.10
Line Coding Schemes
Unipolar
◦ All the signal levels are on one side of the time axis. Ex:
NRZ (Non-Return-to-Zero)
◦ Cost effective, but high power consumption
Polar
◦ The voltages are on the both sides of the time axis. Ex:
Polar NRZ
◦ Low power consumption but
◦ Baseline wandering, DC component and synchronization
problems
◦ NRZ-L: the level of the voltage determines the value of
the bit.
◦ NRZ-I: the inversion or the lack of inversion determines
the value of the bit.
4.11
Figure 4.5 Unipolar NRZ scheme
4.12
Figure 4.6 Polar NRZ-L and NRZ-I schemes
4.13
Example 4.4
Solution
The average signal rate is S = N/2 = 500 kbaud.
The minimum bandwidth for this average baud rate
is Bmin = S = 500 kHz.
4.14
Line Coding Schemes, con’t
RZ (Return-to-Zero)
◦ Use three signal value {+,-,0}
◦ The signal changes
During a bit, but not between bits
◦ Able to synchronize, but require higher bandwidth
Multiphase Schemes
◦ Manchester Encoding
Signal H to L represents a bit symbol 1,
Signal L to H represents a bit symbol 0.
◦ Differential Manchester Encoding
Combine RZ and NRZ-I
Always a transition at the middle of the bit
The absence of a change at the beginning of a symbol represents the symbol 1.
The existence of a change at the beginning of a symbol represents the symbol 0.
◦ The transition at the middle of the bit is used for synchronization.
◦ The minimum bandwidth of Manchester and differential Manchester is 2
times that of NRZ.
4.15
Figure 4.7 Polar RZ scheme
4.16
Figure 4.8 Polar biphase: Manchester and differential Manchester schemes
4.17
Line Coding Schemes, con’t
Bipolar. Ex: AMI and Pseudoternary
◦ use three levels: positive, zero, and negative.
Multilevel
◦ mBnL
a pattern of m data elements is encoded as a pattern
of n signal elements in which 2m ≤ Ln.
Ex)
2B1Q: 2 binary 1 quaternary (=2B4L)
8B6T: 8 binary 6 ternary. 28 data patterns, and 36 signal
pattern
◦ 4D-PAM5 (4-D 5-level pulse amplitude mod.)
Multitransition
◦ MLT-3 : multiline transmission, three level.
4.18
Figure 4.9 Bipolar schemes: AMI and pseudoternary
4.19
Figure 4.10 Multilevel: 2B1Q scheme
4.20
Figure 4.11 Multilevel: 8B6T scheme
4.21
Figure 4.12 Multilevel: 4D-PAM5 scheme
4.22
Figure 4.13 Multitransition: MLT-3 scheme
4.23
Table 4.1 Summary of line coding schemes
4.24
Note
4.25
Figure 4.14 Block coding concept
4.26
Figure 4.15 Using block coding 4B/5B with NRZ-I line coding scheme
4.27
Table 4.2 4B/5B mapping codes
4.28
Figure 4.16 Substitution in 4B/5B block coding
4.29
Example 4.5
4.31
Figure 4.18 AMI used with scrambling
4.32
Figure 4.19 Two cases of B8ZS scrambling technique
4.33
Note
4.34
Figure 4.20 Different situations in HDB3 scrambling technique
4.35
Note
4.36
ANALOG-TO-DIGITAL
CONVERSION
4.37
Pulse Code Modulation
(PCM)
3-step process
◦ Sampling – sample the analog signal every T
sec.
According to Nyquist, the sampling rate must be at
least twice the highest frequency in the original
signal.
◦ Quantization – convert the sample analog
value into integral values (L levels)
Mostly use a fixed interval, delta = (Vmax - Vmin) / L
◦ Encoding
Convert the quantized value into an n-bit code
n log 2 L
word, where
4.38
Figure 4.21 Components of PCM encoder
4.39
Figure 4.22 Three different sampling methods for PCM
4.40
Figure 4.23 Nyquist sampling rate for low-pass and bandpass signals
4.41
Example 4.6
4.42
Figure 4.24 Recovery of a sampled sine wave for different sampling rates
4.43
Example 4.7
4.44
Figure 4.25 Sampling of a clock with only one hand
4.45
Example 4.8
4.46
Example 4.9
4.47
Example 4.10
Solution
The bandwidth of a low-pass signal is between 0
and f, where f is the maximum frequency in the
signal. Therefore, we can sample this signal at 2
times the highest frequency (200 kHz). The
sampling rate is therefore 400,000 samples per
second.
4.48
Example 4.11
Solution
We cannot find the minimum sampling rate in this
case because we do not know where the bandwidth
starts or ends. We do not know the maximum
frequency in the signal.
4.49
Figure 4.26 Quantization and encoding of a sampled signal
4.50
Example 4.12
Solution
We can use the formula to find the quantization.
We have eight levels and 3 bits per sample, so
Solution
We can calculate the number of bits as
4.52
Example 4.14
Solution
The human voice normally contains frequencies
from 0 to 4000 Hz. So the sampling rate and bit
rate are calculated as follows:
4.53
PCM Decoder
2 steps
◦ Restore a pulse from a code word
◦ Low-pass filter
Cutoff frequency must be same as the sender’s
frequency
4.54
Figure 4.27 Components of a PCM decoder
4.55
Example 4.15
4.56
Delta Modulation (DM)
Findthe change from the previous
sample
Modulator - to record the positive or
negative change, delta
◦ If the delta is positive, record a 1.
◦ If the delta is negative, record a 0.
◦ Need a base
Demodulator
4.57
The process of delta
modulation
4.58
Delta modulation
components
4.59
Delta demodulation
components
4.60
TRANSMISSION
MODES
4.61
Data Transmission
Parallel transmission
Serial transmission
◦ Asynchronous
◦ Synchronous
◦ Isochronous
To guarantee that the data arrive at a fixed rate.
4.62
Parallel transmission
To use multiple wires
◦ Use n wires to send n bits at once.
High speed and high cost
4.63
Serial transmission
4.64
Asynchronous transmission
Each group (usually 8-bit) is sent as a unit. The sender
handles each group independently.
The receiver cannot predict when the next group will arrive.
◦ To alert the receiver for a new group coming and finishing, a start-
bit and stop-bit are used.
◦ There may be a gap between each byte.
Synchronous at the byte level, but the bits are still
synchronized; their durations are the same.
4.65
Synchronous transmission
The bit stream is combined into longer “frame” of
multiple bytes.
To send bits one after another without start or stop bits
or gaps. It is the responsibility of the receiver to group
the bits.
4.66