SlideShare a Scribd company logo
LECTURE-4




              REFERENCE:
                  Chapter 4
            Digital Transmission


4.1      www.fida.com.bd
4-1 DIGITAL-TO-DIGITAL CONVERSION

  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.


 Topics discussed in this section:
 Line Coding
 Line Coding Schemes
 Block Coding
 Scrambling

4.2
Figure 4.1 Line coding and decoding




4.3
Figure 4.2 Signal element versus data element




4.4
Example 4.1

 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?

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




4.5
Note

        Although the actual bandwidth of a
        digital signal is infinite, the effective
                  bandwidth is finite.




4.6
Example 4.2

 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?

 Solution
 A 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




4.7
Figure 4.3 Effect of lack of synchronization




4.8
Example 4.3

 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?
 Solution
 At 1 kbps, the receiver receives 1001 bps instead of 1000
 bps.


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


4.9
Figure 4.4 Line coding schemes




4.10
Figure 4.5 Unipolar NRZ scheme




4.11
Figure 4.6 Polar NRZ-L and NRZ-I schemes




4.12
Note

              In NRZ-L the level of the voltage
              determines the value of the bit.
                   In NRZ-I the inversion
                  or the lack of inversion
               determines the value of the bit.




4.13
Note

       NRZ-L and NRZ-I both have an average
               signal rate of N/2 Bd.




4.14
Note

          NRZ-L and NRZ-I both have a DC
               component problem.




4.15
Example 4.4

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



 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.16
Figure 4.7 Polar RZ scheme




4.17
Figure 4.8 Polar biphase: Manchester and differential Manchester schemes




4.18
Note

            In Manchester and differential
         Manchester encoding, the transition
          at the middle of the bit is used for
                   synchronization.




4.19
Note

       The minimum bandwidth of Manchester
        and differential Manchester is 2 times
                     that of NRZ.




4.20
Note

       In bipolar encoding, we use three levels:
             positive, zero, and negative.




4.21
Figure 4.9 Bipolar schemes: AMI and pseudoternary




4.22
Note

        In mBnL schemes, a pattern of m data
        elements is encoded as a pattern of n
           signal elements in which 2m ≤ Ln.




4.23
Figure 4.10 Multilevel: 2B1Q scheme




4.24
Figure 4.11 Multilevel: 8B6T scheme




4.25
Figure 4.12 Multilevel: 4D-PAM5 scheme




4.26
Figure 4.13 Multitransition: MLT-3 scheme




4.27
Table 4.1 Summary of line coding schemes




4.28
Note

       Block coding is normally referred to as
                    mB/nB coding;
        it replaces each m-bit group with an
                     n-bit group.




4.29
Figure 4.14 Block coding concept




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




4.31
Table 4.2 4B/5B mapping codes




4.32
Figure 4.16 Substitution in 4B/5B block coding




4.33
Example 4.5

 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?

 Solution
 First 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.
4.34
Figure 4.17 8B/10B block encoding




4.35
Figure 4.18 AMI used with scrambling




4.36
Figure 4.19 Two cases of B8ZS scrambling technique




4.37
Note

         B8ZS substitutes eight consecutive
               zeros with 000VB0VB.




4.38
Figure 4.20 Different situations in HDB3 scrambling technique




4.39
Note

        HDB3 substitutes four consecutive
        zeros with 000V or B00V depending
       on the number of nonzero pulses after
                the last substitution.




4.40
4-2 ANALOG-TO-DIGITAL CONVERSION

  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 delta modulation.


 Topics discussed in this section:
 Pulse Code Modulation (PCM)
 Delta Modulation (DM)


4.41
Figure 4.21 Components of PCM encoder




4.42
Figure 4.22 Three different sampling methods for PCM




4.43
Note

       According to the Nyquist theorem, the
                sampling rate must be
       at least 2 times the highest frequency
               contained in the signal.




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




4.45
Example 4.6

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.
4.46
Figure 4.24 Recovery of a sampled sine wave for different sampling rates




4.47
Example 4.7

 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.
4.48
Figure 4.25 Sampling of a clock with only one hand




4.49
Example 4.8

 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.




4.50
Example 4.9

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




4.51
Example 4.10

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



 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.52
Example 4.11

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



 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.53
Figure 4.26 Quantization and encoding of a sampled signal




4.54
Example 4.12

 What is the SNRdB in the example of Figure 4.26?




 Solution
 We 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.
4.55
Example 4.13

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



 Solution
 We can calculate the number of bits as


 Telephone companies usually assign 7 or 8 bits per
 sample.

4.56
Example 4.14

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


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




4.57
Figure 4.27 Components of a PCM decoder




4.58
Example 4.15

 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.




4.59
Figure 4.28 The process of delta modulation




4.60
Figure 4.29 Delta modulation components




4.61
Figure 4.30 Delta demodulation components




4.62
4-3 TRANSMISSION MODES

  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.

 Topics discussed in this section:
 Parallel Transmission
 Serial Transmission

4.63
Figure 4.31 Data transmission and modes




4.64
Figure 4.32 Parallel transmission




4.65
Figure 4.33 Serial transmission




4.66
Note

       In asynchronous transmission, we send
        1 start bit (0) at the beginning and 1 or
         more stop bits (1s) at the end of each
          byte. There may be a gap between
                         each byte.


4.67
Note

             Asynchronous here means
         “asynchronous at the byte level,”
         but the bits are still synchronized;
            their durations are the same.




4.68
Figure 4.34 Asynchronous transmission




4.69
Note

       In synchronous transmission, we send
        bits one after another without start or
       stop bits or gaps. It is the responsibility
           of the receiver to group the bits.




4.70
Figure 4.35 Synchronous transmission




4.71

More Related Content

PPT
Chapter 4 digital transmission computer_network
PPT
Data Communication and Networking
PPT
Digital Transmission
PPT
Ch04
 
PPT
digital layer
PPT
Data Communication And Networking - DIGITAL TRANSMISSION
PPT
Ch4 1 v1
Chapter 4 digital transmission computer_network
Data Communication and Networking
Digital Transmission
Ch04
 
digital layer
Data Communication And Networking - DIGITAL TRANSMISSION
Ch4 1 v1

What's hot (20)

PDF
blake sample-problems
PPT
BANDWIDTH UTILIZATION
PPT
Chap4 d t-d conversion
PPT
PPT
DIGITAL TRANSMISSION
PPT
Unit 4
PDF
Data and signals
PPT
Chapter 4 - Digital Transmission
PPT
04 Digital Transmission
PPTX
3. digital transmission fundamentals
PPT
Ch6 1 v1
PDF
Physical Layer Numericals - Data Communication & Networking
PPT
Ch4 1 Data communication and networking by neha g. kurale
PPT
1432.encoding concepts
PDF
Data Communication & Computer Networks: Multi level, multi transition & block...
PPT
Chapter 4
PPT
Digital Transmission
PPT
03 Data and_Signals
PPT
blake sample-problems
BANDWIDTH UTILIZATION
Chap4 d t-d conversion
DIGITAL TRANSMISSION
Unit 4
Data and signals
Chapter 4 - Digital Transmission
04 Digital Transmission
3. digital transmission fundamentals
Ch6 1 v1
Physical Layer Numericals - Data Communication & Networking
Ch4 1 Data communication and networking by neha g. kurale
1432.encoding concepts
Data Communication & Computer Networks: Multi level, multi transition & block...
Chapter 4
Digital Transmission
03 Data and_Signals
Ad

Similar to LECTURE-4 (Data Communication) ~www.fida.com.bd (20)

PPTX
Chapter 4 -Digital Transmission.pptx with free trail
PPT
PPT
Line_Coding.ppt for engineering students for ug and pg
PPT
Lecture 3.ppt
PPT
lecture 6 ch04 digital to digital conversion
PPT
Ch3 Digital Transmission.ppt
DOC
Lecture7 encodingmodulation
 
PDF
Computer Networks/Computer Engineering.pdf
PDF
An Overview of Digital Communication and Transmission
PPT
Line Coding Scheme and digital transmission concept
PPT
analog_digital convers vvvvvvion1.ppt
PPT
line coding techniques, block coding and all type of coding
PPT
ch04-digital-transmission.ppt
PPT
Lecture 09
PPT
CCN
PPT
Digital transmission of the physical layer
PPT
Lecture notes eng - Line Coding New.ppt
PDF
Data Communication & Computer Networks : Unipolar & Polar coding
PPT
Ch4 2 v1
PDF
Computer Networks encoding techniques for cse stdents
Chapter 4 -Digital Transmission.pptx with free trail
Line_Coding.ppt for engineering students for ug and pg
Lecture 3.ppt
lecture 6 ch04 digital to digital conversion
Ch3 Digital Transmission.ppt
Lecture7 encodingmodulation
 
Computer Networks/Computer Engineering.pdf
An Overview of Digital Communication and Transmission
Line Coding Scheme and digital transmission concept
analog_digital convers vvvvvvion1.ppt
line coding techniques, block coding and all type of coding
ch04-digital-transmission.ppt
Lecture 09
CCN
Digital transmission of the physical layer
Lecture notes eng - Line Coding New.ppt
Data Communication & Computer Networks : Unipolar & Polar coding
Ch4 2 v1
Computer Networks encoding techniques for cse stdents
Ad

More from QUT (Queensland University of Technology) (20)

PPTX
Cognitive Internet of Vehicles (CIoV) Motivation, Layered Architecture and Se...
PPT
Lecture slide 08(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 10(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 09(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 03(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 07(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 05(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 04(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 06(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 02(electrical circuit)~www.fida.com.bd
PPT
Lecture slide 01(electrical circuit)~www.fida.com.bd
PPT
Lecture-9 Data Communication ~www.fida.com.bd
PPT
Lecture-8 Data Communication ~www.fida.com.bd
PPT
Lecture-6 Data Communication ~www.fida.com.bd
PPT
LECTURE-1 (Data Communication) ~www.fida.com.bd
PPT
LECTURE-10 (Data Communication) ~www.fida.com.bd
PPT
Lecture-7 Data Communication ~www.fida.com.bd
Cognitive Internet of Vehicles (CIoV) Motivation, Layered Architecture and Se...
Lecture slide 08(electrical circuit)~www.fida.com.bd
Lecture slide 10(electrical circuit)~www.fida.com.bd
Lecture slide 09(electrical circuit)~www.fida.com.bd
Lecture slide 03(electrical circuit)~www.fida.com.bd
Lecture slide 07(electrical circuit)~www.fida.com.bd
Lecture slide 05(electrical circuit)~www.fida.com.bd
Lecture slide 04(electrical circuit)~www.fida.com.bd
Lecture slide 06(electrical circuit)~www.fida.com.bd
Lecture slide 02(electrical circuit)~www.fida.com.bd
Lecture slide 01(electrical circuit)~www.fida.com.bd
Lecture-9 Data Communication ~www.fida.com.bd
Lecture-8 Data Communication ~www.fida.com.bd
Lecture-6 Data Communication ~www.fida.com.bd
LECTURE-1 (Data Communication) ~www.fida.com.bd
LECTURE-10 (Data Communication) ~www.fida.com.bd
Lecture-7 Data Communication ~www.fida.com.bd

LECTURE-4 (Data Communication) ~www.fida.com.bd

  • 1. LECTURE-4 REFERENCE: Chapter 4 Digital Transmission 4.1 www.fida.com.bd
  • 2. 4-1 DIGITAL-TO-DIGITAL CONVERSION 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. Topics discussed in this section: Line Coding Line Coding Schemes Block Coding Scrambling 4.2
  • 3. Figure 4.1 Line coding and decoding 4.3
  • 4. Figure 4.2 Signal element versus data element 4.4
  • 5. Example 4.1 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? Solution We assume that the average value of c is 1/2 . The baud rate is then 4.5
  • 6. Note Although the actual bandwidth of a digital signal is infinite, the effective bandwidth is finite. 4.6
  • 7. Example 4.2 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? Solution A 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 4.7
  • 8. Figure 4.3 Effect of lack of synchronization 4.8
  • 9. Example 4.3 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? Solution At 1 kbps, the receiver receives 1001 bps instead of 1000 bps. At 1 Mbps, the receiver receives 1,001,000 bps instead of 1,000,000 bps. 4.9
  • 10. Figure 4.4 Line coding schemes 4.10
  • 11. Figure 4.5 Unipolar NRZ scheme 4.11
  • 12. Figure 4.6 Polar NRZ-L and NRZ-I schemes 4.12
  • 13. Note In NRZ-L the level of the voltage determines the value of the bit. In NRZ-I the inversion or the lack of inversion determines the value of the bit. 4.13
  • 14. Note NRZ-L and NRZ-I both have an average signal rate of N/2 Bd. 4.14
  • 15. Note NRZ-L and NRZ-I both have a DC component problem. 4.15
  • 16. Example 4.4 A system is using NRZ-I to transfer 10-Mbps data. What are the average signal rate and minimum bandwidth? 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.16
  • 17. Figure 4.7 Polar RZ scheme 4.17
  • 18. Figure 4.8 Polar biphase: Manchester and differential Manchester schemes 4.18
  • 19. Note In Manchester and differential Manchester encoding, the transition at the middle of the bit is used for synchronization. 4.19
  • 20. Note The minimum bandwidth of Manchester and differential Manchester is 2 times that of NRZ. 4.20
  • 21. Note In bipolar encoding, we use three levels: positive, zero, and negative. 4.21
  • 22. Figure 4.9 Bipolar schemes: AMI and pseudoternary 4.22
  • 23. Note In mBnL schemes, a pattern of m data elements is encoded as a pattern of n signal elements in which 2m ≤ Ln. 4.23
  • 24. Figure 4.10 Multilevel: 2B1Q scheme 4.24
  • 25. Figure 4.11 Multilevel: 8B6T scheme 4.25
  • 26. Figure 4.12 Multilevel: 4D-PAM5 scheme 4.26
  • 27. Figure 4.13 Multitransition: MLT-3 scheme 4.27
  • 28. Table 4.1 Summary of line coding schemes 4.28
  • 29. Note Block coding is normally referred to as mB/nB coding; it replaces each m-bit group with an n-bit group. 4.29
  • 30. Figure 4.14 Block coding concept 4.30
  • 31. Figure 4.15 Using block coding 4B/5B with NRZ-I line coding scheme 4.31
  • 32. Table 4.2 4B/5B mapping codes 4.32
  • 33. Figure 4.16 Substitution in 4B/5B block coding 4.33
  • 34. Example 4.5 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? Solution First 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. 4.34
  • 35. Figure 4.17 8B/10B block encoding 4.35
  • 36. Figure 4.18 AMI used with scrambling 4.36
  • 37. Figure 4.19 Two cases of B8ZS scrambling technique 4.37
  • 38. Note B8ZS substitutes eight consecutive zeros with 000VB0VB. 4.38
  • 39. Figure 4.20 Different situations in HDB3 scrambling technique 4.39
  • 40. Note HDB3 substitutes four consecutive zeros with 000V or B00V depending on the number of nonzero pulses after the last substitution. 4.40
  • 41. 4-2 ANALOG-TO-DIGITAL CONVERSION 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 delta modulation. Topics discussed in this section: Pulse Code Modulation (PCM) Delta Modulation (DM) 4.41
  • 42. Figure 4.21 Components of PCM encoder 4.42
  • 43. Figure 4.22 Three different sampling methods for PCM 4.43
  • 44. Note According to the Nyquist theorem, the sampling rate must be at least 2 times the highest frequency contained in the signal. 4.44
  • 45. Figure 4.23 Nyquist sampling rate for low-pass and bandpass signals 4.45
  • 46. Example 4.6 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. 4.46
  • 47. Figure 4.24 Recovery of a sampled sine wave for different sampling rates 4.47
  • 48. Example 4.7 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. 4.48
  • 49. Figure 4.25 Sampling of a clock with only one hand 4.49
  • 50. Example 4.8 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. 4.50
  • 51. Example 4.9 Telephone companies digitize voice by assuming a maximum frequency of 4000 Hz. The sampling rate therefore is 8000 samples per second. 4.51
  • 52. Example 4.10 A complex low-pass signal has a bandwidth of 200 kHz. What is the minimum sampling rate for this signal? 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.52
  • 53. Example 4.11 A complex bandpass signal has a bandwidth of 200 kHz. What is the minimum sampling rate for this signal? 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.53
  • 54. Figure 4.26 Quantization and encoding of a sampled signal 4.54
  • 55. Example 4.12 What is the SNRdB in the example of Figure 4.26? Solution We 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. 4.55
  • 56. Example 4.13 A telephone subscriber line must have an SNRdB above 40. What is the minimum number of bits per sample? Solution We can calculate the number of bits as Telephone companies usually assign 7 or 8 bits per sample. 4.56
  • 57. Example 4.14 We want to digitize the human voice. What is the bit rate, assuming 8 bits per sample? Solution The human voice normally contains frequencies from 0 to 4000 Hz. So the sampling rate and bit rate are calculated as follows: 4.57
  • 58. Figure 4.27 Components of a PCM decoder 4.58
  • 59. Example 4.15 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. 4.59
  • 60. Figure 4.28 The process of delta modulation 4.60
  • 61. Figure 4.29 Delta modulation components 4.61
  • 62. Figure 4.30 Delta demodulation components 4.62
  • 63. 4-3 TRANSMISSION MODES 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. Topics discussed in this section: Parallel Transmission Serial Transmission 4.63
  • 64. Figure 4.31 Data transmission and modes 4.64
  • 65. Figure 4.32 Parallel transmission 4.65
  • 66. Figure 4.33 Serial transmission 4.66
  • 67. Note In asynchronous transmission, we send 1 start bit (0) at the beginning and 1 or more stop bits (1s) at the end of each byte. There may be a gap between each byte. 4.67
  • 68. Note Asynchronous here means “asynchronous at the byte level,” but the bits are still synchronized; their durations are the same. 4.68
  • 69. Figure 4.34 Asynchronous transmission 4.69
  • 70. Note In synchronous transmission, we send bits one after another without start or stop bits or gaps. It is the responsibility of the receiver to group the bits. 4.70
  • 71. Figure 4.35 Synchronous transmission 4.71