66
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2000 Chapter 4 Chapter 4 Digital Transmission Digital Transmission Stephen Kim 4.1

Lecture Note Ch.4

Embed Size (px)

Citation preview

Page 1: Lecture Note Ch.4

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2000

Chapter 4Chapter 4Digital TransmissionDigital TransmissionStephen Kim

4.1

Page 2: Lecture Note Ch.4

DIGITAL-TO-DIGITAL DIGITAL-TO-DIGITAL CONVERSIONCONVERSION

In this section, we see how we can represent digital data by using digital signals. The conversion involves three techniques: line coding, block coding, and scrambling. Line coding is always needed; block coding and scrambling may or may not be needed.

4.2

Page 3: Lecture Note Ch.4

Line CodingLine CodingThe process of converting digital data to

digital signals◦ Digital data – sequences of bits

4.3

Page 4: Lecture Note Ch.4

Line coding and decodingLine coding and decoding

4.4

Page 5: Lecture Note Ch.4

Characteristics of Line Characteristics of Line CodingCoding 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

Page 6: Lecture Note Ch.4

4.6

Figure 4.2 Signal element versus data element

Page 7: Lecture Note Ch.4

4.7

A signal is carrying data in which one data element is encoded as one signal element ( r = 1). If the bit rate is 100 kbps, what is the average value of the baud rate if c is between 0 and 1?

SolutionWe assume that the average value of c is 1/2 . The baud rate is then

Example 4.1

Page 8: Lecture Note Ch.4

4.8

The maximum data rate of a channel (see Chapter 3) is Nmax = 2 × B × log2 L (defined by the Nyquist formula). Does this agree with the previous formula for Nmax?SolutionA signal with L levels actually can carry log2L bits per level. If each level corresponds to one signal element and we assume the average case (c = 1/2), then we have

Example 4.2

Page 9: Lecture Note Ch.4

4.9

Figure 4.3 Effect of lack of synchronization

Page 10: Lecture Note Ch.4

4.10

In a digital transmission, the receiver clock is 0.1 percent faster than the sender clock. How many extra bits per second does the receiver receive if the data rate is 1 kbps? How many if the data rate is 1 Mbps?SolutionAt 1 kbps, the receiver receives 1001 bps instead of 1000 bps.

Example 4.3

At 1 Mbps, the receiver receives 1,001,000 bps instead of 1,000,000 bps.

Page 11: Lecture Note Ch.4

Line Coding SchemesLine 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

Page 12: Lecture Note Ch.4

4.12

Figure 4.5 Unipolar NRZ scheme

Page 13: Lecture Note Ch.4

4.13

Figure 4.6 Polar NRZ-L and NRZ-I schemes

Page 14: Lecture Note Ch.4

4.14

A system is using NRZ-I to transfer 10-Mbps data. What are the average signal rate and minimum bandwidth?

SolutionThe average signal rate is S = N/2 = 500 kbaud. The minimum bandwidth for this average baud rate is Bmin = S = 500 kHz.

Example 4.4

Page 15: Lecture Note Ch.4

Line Coding Schemes, con’tLine 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

Page 16: Lecture Note Ch.4

4.16

Figure 4.7 Polar RZ scheme

Page 17: Lecture Note Ch.4

4.17

Figure 4.8 Polar biphase: Manchester and differential Manchester schemes

Page 18: Lecture Note Ch.4

Line Coding Schemes, con’tLine Coding Schemes, con’tBipolar. 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

Page 19: Lecture Note Ch.4

4.19

Figure 4.9 Bipolar schemes: AMI and pseudoternary

Page 20: Lecture Note Ch.4

4.20

Figure 4.10 Multilevel: 2B1Q scheme

Page 21: Lecture Note Ch.4

4.21

Figure 4.11 Multilevel: 8B6T scheme

Page 22: Lecture Note Ch.4

4.22

Figure 4.12 Multilevel: 4D-PAM5 scheme

Page 23: Lecture Note Ch.4

4.23

Figure 4.13 Multitransition: MLT-3 scheme

Page 24: Lecture Note Ch.4

4.24

Table 4.1 Summary of line coding schemes

Page 25: Lecture Note Ch.4

4.25

Block coding is normally referred to as mB/nB coding;

it replaces each m-bit group with an n-bit group.

Note

Page 26: Lecture Note Ch.4

4.26

Figure 4.14 Block coding concept

Page 27: Lecture Note Ch.4

4.27

Figure 4.15 Using block coding 4B/5B with NRZ-I line coding scheme

Page 28: Lecture Note Ch.4

4.28

Table 4.2 4B/5B mapping codes

Page 29: Lecture Note Ch.4

4.29

Figure 4.16 Substitution in 4B/5B block coding

Page 30: Lecture Note Ch.4

4.30

We need to send data at a 1-Mbps rate. What is the minimum required bandwidth, using a combination of 4B/5B and NRZ-I or Manchester coding?SolutionFirst 4B/5B block coding increases the bit rate to 1.25 Mbps. The minimum bandwidth using NRZ-I is N/2 or 625 kHz. The Manchester scheme needs a minimum bandwidth of 1 MHz. The first choice needs a lower bandwidth, but has a DC component problem; the second choice needs a higher bandwidth, but does not have a DC component problem.

Example 4.5

Page 31: Lecture Note Ch.4

4.31

Figure 4.17 8B/10B block encoding

Page 32: Lecture Note Ch.4

4.32

Figure 4.18 AMI used with scrambling

Page 33: Lecture Note Ch.4

4.33

Figure 4.19 Two cases of B8ZS scrambling technique

Page 34: Lecture Note Ch.4

4.34

B8ZS substitutes eight consecutive zeros with 000VB0VB.

Note

Page 35: Lecture Note Ch.4

4.35

Figure 4.20 Different situations in HDB3 scrambling technique

Page 36: Lecture Note Ch.4

4.36

HDB3 substitutes four consecutive zeros with 000V or B00V depending

on the number of nonzero pulses after the last substitution.

Note

Page 37: Lecture Note Ch.4

ANALOG-TO-DIGITAL ANALOG-TO-DIGITAL CONVERSIONCONVERSION

We have seen in Chapter 3 that a digital signal is superior to an analog signal. The tendency today is to change an analog signal to digital data. In this section we describe two techniques, pulse code modulation and

4.37

Page 38: Lecture Note Ch.4

Pulse Code Modulation Pulse Code Modulation (PCM)(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

word, where

4.38

Ln 2log

Page 39: Lecture Note Ch.4

4.39

Figure 4.21 Components of PCM encoder

Page 40: Lecture Note Ch.4

4.40

Figure 4.22 Three different sampling methods for PCM

Page 41: Lecture Note Ch.4

4.41

Figure 4.23 Nyquist sampling rate for low-pass and bandpass signals

Page 42: Lecture Note Ch.4

4.42

For an intuitive example of the Nyquist theorem, let us sample a simple sine wave at three sampling rates: fs = 4f (2 times the Nyquist rate), fs = 2f (Nyquist rate), and fs = f (one-half the Nyquist rate). Figure 4.24 shows the sampling and the subsequent recovery of the signal.

It can be seen that sampling at the Nyquist rate can create a good approximation of the original sine wave (part a). Oversampling in part b can also create the same approximation, but it is redundant and unnecessary. Sampling below the Nyquist rate (part c) does not produce a signal that looks like the original sine wave.

Example 4.6

Page 43: Lecture Note Ch.4

4.43

Figure 4.24 Recovery of a sampled sine wave for different sampling rates

Page 44: Lecture Note Ch.4

4.44

Consider the revolution of a hand of a clock. The second hand of a clock has a period of 60 s. According to the Nyquist theorem, we need to sample the hand every 30 s (Ts = T or fs = 2f ). In Figure 4.25a, the sample points, in order, are 12, 6, 12, 6, 12, and 6. The receiver of the samples cannot tell if the clock is moving forward or backward. In part b, we sample at double the Nyquist rate (every 15 s). The sample points are 12, 3, 6, 9, and 12. The clock is moving forward. In part c, we sample below the Nyquist rate (Ts = T or fs = f ). The sample points are 12, 9, 6, 3, and 12. Although the clock is moving forward, the receiver thinks that the clock is moving backward.

Example 4.7

Page 45: Lecture Note Ch.4

4.45

Figure 4.25 Sampling of a clock with only one hand

Page 46: Lecture Note Ch.4

4.46

An example related to Example 4.7 is the seemingly backward rotation of the wheels of a forward-moving car in a movie. This can be explained by under-sampling. A movie is filmed at 24 frames per second. If a wheel is rotating more than 12 times per second, the under-sampling creates the impression of a backward rotation.

Example 4.8

Page 47: Lecture Note Ch.4

4.47

Telephone companies digitize voice by assuming a maximum frequency of 4000 Hz. The sampling rate therefore is 8000 samples per second.

Example 4.9

Page 48: Lecture Note Ch.4

4.48

A complex low-pass signal has a bandwidth of 200 kHz. What is the minimum sampling rate for this signal?

SolutionThe 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.

Example 4.10

Page 49: Lecture Note Ch.4

4.49

A complex bandpass signal has a bandwidth of 200 kHz. What is the minimum sampling rate for this signal?

SolutionWe 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.

Example 4.11

Page 50: Lecture Note Ch.4

4.50

Figure 4.26 Quantization and encoding of a sampled signal

Page 51: Lecture Note Ch.4

4.51

What is the SNRdB in the example of Figure 4.26?

SolutionWe can use the formula to find the quantization. We have eight levels and 3 bits per sample, so

SNRdB = 6.02(3) + 1.76 = 19.82 dB

Increasing the number of levels increases the SNR.

Example 4.12

Page 52: Lecture Note Ch.4

4.52

A telephone subscriber line must have an SNRdB above 40. What is the minimum number of bits per sample?

SolutionWe can calculate the number of bits as

Example 4.13

Telephone companies usually assign 7 or 8 bits per sample.

Page 53: Lecture Note Ch.4

4.53

We want to digitize the human voice. What is the bit rate, assuming 8 bits per sample?

SolutionThe human voice normally contains frequencies from 0 to 4000 Hz. So the sampling rate and bit rate are calculated as follows:

Example 4.14

Page 54: Lecture Note Ch.4

PCM DecoderPCM Decoder2 steps

◦ Restore a pulse from a code word◦ Low-pass filter

Cutoff frequency must be same as the sender’s frequency

4.54

Page 55: Lecture Note Ch.4

4.55

Figure 4.27 Components of a PCM decoder

Page 56: Lecture Note Ch.4

4.56

We have a low-pass analog signal of 4 kHz. If we send the analog signal, we need a channel with a minimum bandwidth of 4 kHz. If we digitize the signal and send 8 bits per sample, we need a channel with a minimum bandwidth of 8 × 4 kHz = 32 kHz.

Example 4.15

Page 57: Lecture Note Ch.4

4.57

Delta Modulation (DM)Delta Modulation (DM)Find the change from the previous

sampleModulator - 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

Page 58: Lecture Note Ch.4

The process of delta The process of delta modulationmodulation

4.58

Page 59: Lecture Note Ch.4

Delta modulation Delta modulation componentscomponents

4.59

Page 60: Lecture Note Ch.4

Delta demodulation Delta demodulation componentscomponents

4.60

Page 61: Lecture Note Ch.4

TRANSMISSION TRANSMISSION MODESMODES

The transmission of binary data across a link can be accomplished in either parallel or serial mode. In parallel mode, multiple bits are sent with each clock tick. In serial mode, 1 bit is sent with each clock tick. While there is only one way to send parallel data, there are three subclasses of serial transmission: asynchronous, synchronous, and isochronous.

4.61

Page 62: Lecture Note Ch.4

Data Transmission Data Transmission Parallel transmissionSerial transmission

◦ Asynchronous◦ Synchronous◦ Isochronous

To guarantee that the data arrive at a fixed rate.

4.62

Page 63: Lecture Note Ch.4

Parallel transmissionParallel transmissionTo use multiple wires

◦ Use n wires to send n bits at once.High speed and high cost

4.63

Page 64: Lecture Note Ch.4

Serial transmissionSerial transmission

4.64

Page 65: Lecture Note Ch.4

Asynchronous transmissionAsynchronous 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

Page 66: Lecture Note Ch.4

Synchronous transmissionSynchronous 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