SlideShare a Scribd company logo
1 of 17
Pulse Code Modulation




                                         4.#                                                   1
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
ANALOG-TO-DIGITAL CONVERSION

 A digital signal is superior to an analog signal because
 it is more robust to noise and can easily be recovered,
 corrected and amplified. For this reason, 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.#                            2
PCM
       PCM consists of three steps to digitize an
        analog signal:
    n     Sampling
    n     Quantization
    n     Binary encoding
       Before we sample, we have to filter the signal
        to limit the maximum frequency of the signal as
        it affects the sampling rate.
       Filtering should ensure that we do not distort
        the signal, ie remove high frequency
        components that affect the signal shape.


                             4.#                          3
Figure 4.21 Components of PCM encoder




                               4.#      4
Sampling
   Analog signal is sampled every TS secs.
   Ts is referred to as the sampling interval.
   fs = 1/Ts is called the sampling rate or sampling
    frequency.
   There are 3 sampling methods:
       Ideal - an impulse at each sampling instant
       Natural - a pulse of short width with varying amplitude
       Flattop - sample and hold, like natural but with single
        amplitude value
   The process is referred to as pulse amplitude
    modulation PAM and the outcome is a signal with
    analog (non integer) values

                                 4.#                              5
Figure 4.22 Three different sampling methods for PCM




                                  4.#                  6
Note

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



                  4.#                    7
Figure 4.23 Nyquist sampling rate for low-pass and bandpass signals




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




                                    4.#                                    10
Quantization
   Sampling results in a series of pulses of varying
    amplitude values ranging between two limits: a
    min and a max.
   The amplitude values are infinite between the
    two limits.
   We need to map the infinite amplitude values
    onto a finite set of known values.
   This is achieved by dividing the distance
    between min and max into L zones, each of
    height ∆.
                    ∆ = (max - min)/L

                           4.#                          11
Quantization Levels

   The midpoint of each zone is assigned a
    value from 0 to L-1 (resulting in L values)
   Each sample falling in a zone is then
    approximated to the value of the midpoint.




                        4.#                       12
Quantization Zones
   Assume we have a voltage signal with
    amplitutes Vmin=-20V and Vmax=+20V.
   We want to use L=8 quantization levels.
   Zone width ∆ = (20 - -20)/8 = 5
   The 8 zones are: -20 to -15, -15 to -10, -10
    to -5, -5 to 0, 0 to +5, +5 to +10, +10 to
    +15, +15 to +20
   The midpoints are: -17.5, -12.5, -7.5, -2.5,
    2.5, 7.5, 12.5, 17.5

                        4.#                        13
Assigning Codes to Zones
   Each zone is then assigned a binary code.
   The number of bits required to encode the zones,
    or the number of bits per sample as it is
    commonly referred to, is obtained as follows:
                      nb = log2 L
   Given our example, nb = 3
   The 8 zone (or level) codes are therefore: 000,
    001, 010, 011, 100, 101, 110, and 111
   Assigning codes to zones:
       000 will refer to zone -20 to -15
       001 to zone -15 to -10, etc.


                                 4.#                   14
Figure 4.26 Quantization and encoding of a sampled signal




                                   4.#                      15
Quantization Error
   When a signal is quantized, we introduce an
    error - the coded signal is an approximation of
    the actual amplitude value.
   The difference between actual and coded value
    (midpoint) is referred to as the quantization error.
   The more zones, the smaller ∆ which results in
    smaller errors.
   BUT, the more zones the more bits required to
    encode the samples -> higher bit rate




                            4.#                            16
Bit rate and bandwidth requirements of
PCM
   The bit rate of a PCM signal can be calculated form the
    number of bits per sample x the sampling rate
                         Bit rate = nb x fs
   The bandwidth required to transmit this signal depends on
    the type of line encoding used. Refer to previous section for
    discussion and formulas.
   A digitized signal will always need more bandwidth than the
    original analog signal. Price we pay for robustness and other
    features of digital transmission.




                                4.#                                 17

More Related Content

What's hot

Digital communication
Digital communicationDigital communication
Digital communication
meashi
 
Pulse amplitude modulation
Pulse amplitude modulationPulse amplitude modulation
Pulse amplitude modulation
Vishal kakade
 
D ecimation and interpolation
D ecimation and interpolationD ecimation and interpolation
D ecimation and interpolation
Suchi Verma
 

What's hot (20)

Digital modulation techniques...
Digital modulation techniques...Digital modulation techniques...
Digital modulation techniques...
 
Dcom ppt(en.39) dpcm
Dcom ppt(en.39) dpcmDcom ppt(en.39) dpcm
Dcom ppt(en.39) dpcm
 
Digital communication
Digital communicationDigital communication
Digital communication
 
Pulse code modulation
Pulse code modulationPulse code modulation
Pulse code modulation
 
Multirate digital signal processing
Multirate digital signal processingMultirate digital signal processing
Multirate digital signal processing
 
Dc unit iii final ppt
Dc unit iii final pptDc unit iii final ppt
Dc unit iii final ppt
 
Error Control Coding -Introduction
Error Control Coding -IntroductionError Control Coding -Introduction
Error Control Coding -Introduction
 
7 convolutional codes
7 convolutional codes7 convolutional codes
7 convolutional codes
 
Base band transmission
Base band transmissionBase band transmission
Base band transmission
 
Pulse modulation
Pulse modulationPulse modulation
Pulse modulation
 
Dpcm ( Differential Pulse Code Modulation )
Dpcm ( Differential Pulse Code Modulation )Dpcm ( Differential Pulse Code Modulation )
Dpcm ( Differential Pulse Code Modulation )
 
Pulse amplitude modulation
Pulse amplitude modulationPulse amplitude modulation
Pulse amplitude modulation
 
Detection and Binary Decision in AWGN Channel
Detection and Binary Decision in AWGN ChannelDetection and Binary Decision in AWGN Channel
Detection and Binary Decision in AWGN Channel
 
Companding & Pulse Code Modulation
Companding & Pulse Code ModulationCompanding & Pulse Code Modulation
Companding & Pulse Code Modulation
 
Convolution codes - Coding/Decoding Tree codes and Trellis codes for multiple...
Convolution codes - Coding/Decoding Tree codes and Trellis codes for multiple...Convolution codes - Coding/Decoding Tree codes and Trellis codes for multiple...
Convolution codes - Coding/Decoding Tree codes and Trellis codes for multiple...
 
Pulse Modulation ppt
Pulse Modulation pptPulse Modulation ppt
Pulse Modulation ppt
 
Mimo
MimoMimo
Mimo
 
1 PCM & Encoding
1  PCM & Encoding1  PCM & Encoding
1 PCM & Encoding
 
D ecimation and interpolation
D ecimation and interpolationD ecimation and interpolation
D ecimation and interpolation
 
Pulse code modulation and Quantization
Pulse code modulation and QuantizationPulse code modulation and Quantization
Pulse code modulation and Quantization
 

Viewers also liked (9)

PULSE CODE MODULATION (PCM)
PULSE CODE MODULATION (PCM)PULSE CODE MODULATION (PCM)
PULSE CODE MODULATION (PCM)
 
Koding
KodingKoding
Koding
 
pulse code modulation pcm | Communication Systems
pulse code modulation pcm | Communication Systemspulse code modulation pcm | Communication Systems
pulse code modulation pcm | Communication Systems
 
30 CHL PCM PDH SDH BY SKG
30 CHL PCM PDH SDH BY SKG30 CHL PCM PDH SDH BY SKG
30 CHL PCM PDH SDH BY SKG
 
PCM (Pulse Code Modulation)
PCM (Pulse Code Modulation)PCM (Pulse Code Modulation)
PCM (Pulse Code Modulation)
 
Chapter 6m
Chapter 6mChapter 6m
Chapter 6m
 
Digital Communication 1
Digital Communication 1Digital Communication 1
Digital Communication 1
 
Pulse code modulation
Pulse code modulationPulse code modulation
Pulse code modulation
 
Pulse modulation
Pulse modulationPulse modulation
Pulse modulation
 

Similar to Pulse code mod

Digital Transmission
Digital TransmissionDigital Transmission
Digital Transmission
anuragyadav94
 
4. Analog to digital conversation (1).ppt
4. Analog to digital conversation (1).ppt4. Analog to digital conversation (1).ppt
4. Analog to digital conversation (1).ppt
test22333
 
Ch04
Ch04Ch04
Ch04
H K
 
Lecture7 encodingmodulation
Lecture7 encodingmodulationLecture7 encodingmodulation
Lecture7 encodingmodulation
H K
 

Similar to Pulse code mod (20)

PCM and delta modulation.ppt
PCM and delta modulation.pptPCM and delta modulation.ppt
PCM and delta modulation.ppt
 
Ch4 2 v1
Ch4 2 v1Ch4 2 v1
Ch4 2 v1
 
DIGITAL TRANSMISSION
DIGITAL TRANSMISSIONDIGITAL TRANSMISSION
DIGITAL TRANSMISSION
 
Ch4 1 Data communication and networking by neha g. kurale
Ch4 1 Data communication and networking by neha g. kuraleCh4 1 Data communication and networking by neha g. kurale
Ch4 1 Data communication and networking by neha g. kurale
 
Digital Transmission
Digital TransmissionDigital Transmission
Digital Transmission
 
TeleCom Lecture 07.ppt
TeleCom Lecture 07.pptTeleCom Lecture 07.ppt
TeleCom Lecture 07.ppt
 
4. Analog to digital conversation (1).ppt
4. Analog to digital conversation (1).ppt4. Analog to digital conversation (1).ppt
4. Analog to digital conversation (1).ppt
 
ch4_2_v1.ppt
ch4_2_v1.pptch4_2_v1.ppt
ch4_2_v1.ppt
 
Analog_to_Digital.pdf
Analog_to_Digital.pdfAnalog_to_Digital.pdf
Analog_to_Digital.pdf
 
Ch04
Ch04Ch04
Ch04
 
_Pulse-Modulation-Techniqnes.pdf
_Pulse-Modulation-Techniqnes.pdf_Pulse-Modulation-Techniqnes.pdf
_Pulse-Modulation-Techniqnes.pdf
 
Te 4 pulse_modulation
Te 4 pulse_modulationTe 4 pulse_modulation
Te 4 pulse_modulation
 
Unit 3.pptx
Unit 3.pptxUnit 3.pptx
Unit 3.pptx
 
Digitization
DigitizationDigitization
Digitization
 
EC6651 COMMUNICATION ENGINEERING UNIT 2
EC6651 COMMUNICATION ENGINEERING UNIT 2EC6651 COMMUNICATION ENGINEERING UNIT 2
EC6651 COMMUNICATION ENGINEERING UNIT 2
 
Chapter 4
Chapter 4Chapter 4
Chapter 4
 
Chapter 4 - Digital Transmission
Chapter 4 - Digital TransmissionChapter 4 - Digital Transmission
Chapter 4 - Digital Transmission
 
Ch04
Ch04Ch04
Ch04
 
Lecture7 encodingmodulation
Lecture7 encodingmodulationLecture7 encodingmodulation
Lecture7 encodingmodulation
 
Line_Coding.ppt for engineering students for ug and pg
Line_Coding.ppt for engineering students for ug and pgLine_Coding.ppt for engineering students for ug and pg
Line_Coding.ppt for engineering students for ug and pg
 

Recently uploaded

Structuring Teams and Portfolios for Success
Structuring Teams and Portfolios for SuccessStructuring Teams and Portfolios for Success
Structuring Teams and Portfolios for Success
UXDXConf
 
Breaking Down the Flutterwave Scandal What You Need to Know.pdf
Breaking Down the Flutterwave Scandal What You Need to Know.pdfBreaking Down the Flutterwave Scandal What You Need to Know.pdf
Breaking Down the Flutterwave Scandal What You Need to Know.pdf
UK Journal
 
Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...
Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...
Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...
panagenda
 
Harnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptx
Harnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptxHarnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptx
Harnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptx
FIDO Alliance
 
Tales from a Passkey Provider Progress from Awareness to Implementation.pptx
Tales from a Passkey Provider  Progress from Awareness to Implementation.pptxTales from a Passkey Provider  Progress from Awareness to Implementation.pptx
Tales from a Passkey Provider Progress from Awareness to Implementation.pptx
FIDO Alliance
 

Recently uploaded (20)

Structuring Teams and Portfolios for Success
Structuring Teams and Portfolios for SuccessStructuring Teams and Portfolios for Success
Structuring Teams and Portfolios for Success
 
Your enemies use GenAI too - staying ahead of fraud with Neo4j
Your enemies use GenAI too - staying ahead of fraud with Neo4jYour enemies use GenAI too - staying ahead of fraud with Neo4j
Your enemies use GenAI too - staying ahead of fraud with Neo4j
 
Overview of Hyperledger Foundation
Overview of Hyperledger FoundationOverview of Hyperledger Foundation
Overview of Hyperledger Foundation
 
Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...
Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...
Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...
 
Simplified FDO Manufacturing Flow with TPMs _ Liam at Infineon.pdf
Simplified FDO Manufacturing Flow with TPMs _ Liam at Infineon.pdfSimplified FDO Manufacturing Flow with TPMs _ Liam at Infineon.pdf
Simplified FDO Manufacturing Flow with TPMs _ Liam at Infineon.pdf
 
Breaking Down the Flutterwave Scandal What You Need to Know.pdf
Breaking Down the Flutterwave Scandal What You Need to Know.pdfBreaking Down the Flutterwave Scandal What You Need to Know.pdf
Breaking Down the Flutterwave Scandal What You Need to Know.pdf
 
The Metaverse: Are We There Yet?
The  Metaverse:    Are   We  There  Yet?The  Metaverse:    Are   We  There  Yet?
The Metaverse: Are We There Yet?
 
Intro to Passkeys and the State of Passwordless.pptx
Intro to Passkeys and the State of Passwordless.pptxIntro to Passkeys and the State of Passwordless.pptx
Intro to Passkeys and the State of Passwordless.pptx
 
ERP Contender Series: Acumatica vs. Sage Intacct
ERP Contender Series: Acumatica vs. Sage IntacctERP Contender Series: Acumatica vs. Sage Intacct
ERP Contender Series: Acumatica vs. Sage Intacct
 
Collecting & Temporal Analysis of Behavioral Web Data - Tales From The Inside
Collecting & Temporal Analysis of Behavioral Web Data - Tales From The InsideCollecting & Temporal Analysis of Behavioral Web Data - Tales From The Inside
Collecting & Temporal Analysis of Behavioral Web Data - Tales From The Inside
 
Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...
Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...
Easier, Faster, and More Powerful – Alles Neu macht der Mai -Wir durchleuchte...
 
Harnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptx
Harnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptxHarnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptx
Harnessing Passkeys in the Battle Against AI-Powered Cyber Threats.pptx
 
Tales from a Passkey Provider Progress from Awareness to Implementation.pptx
Tales from a Passkey Provider  Progress from Awareness to Implementation.pptxTales from a Passkey Provider  Progress from Awareness to Implementation.pptx
Tales from a Passkey Provider Progress from Awareness to Implementation.pptx
 
Event-Driven Architecture Masterclass: Engineering a Robust, High-performance...
Event-Driven Architecture Masterclass: Engineering a Robust, High-performance...Event-Driven Architecture Masterclass: Engineering a Robust, High-performance...
Event-Driven Architecture Masterclass: Engineering a Robust, High-performance...
 
Secure Zero Touch enabled Edge compute with Dell NativeEdge via FDO _ Brad at...
Secure Zero Touch enabled Edge compute with Dell NativeEdge via FDO _ Brad at...Secure Zero Touch enabled Edge compute with Dell NativeEdge via FDO _ Brad at...
Secure Zero Touch enabled Edge compute with Dell NativeEdge via FDO _ Brad at...
 
Continuing Bonds Through AI: A Hermeneutic Reflection on Thanabots
Continuing Bonds Through AI: A Hermeneutic Reflection on ThanabotsContinuing Bonds Through AI: A Hermeneutic Reflection on Thanabots
Continuing Bonds Through AI: A Hermeneutic Reflection on Thanabots
 
TEST BANK For, Information Technology Project Management 9th Edition Kathy Sc...
TEST BANK For, Information Technology Project Management 9th Edition Kathy Sc...TEST BANK For, Information Technology Project Management 9th Edition Kathy Sc...
TEST BANK For, Information Technology Project Management 9th Edition Kathy Sc...
 
Extensible Python: Robustness through Addition - PyCon 2024
Extensible Python: Robustness through Addition - PyCon 2024Extensible Python: Robustness through Addition - PyCon 2024
Extensible Python: Robustness through Addition - PyCon 2024
 
FDO for Camera, Sensor and Networking Device – Commercial Solutions from VinC...
FDO for Camera, Sensor and Networking Device – Commercial Solutions from VinC...FDO for Camera, Sensor and Networking Device – Commercial Solutions from VinC...
FDO for Camera, Sensor and Networking Device – Commercial Solutions from VinC...
 
Microsoft CSP Briefing Pre-Engagement - Questionnaire
Microsoft CSP Briefing Pre-Engagement - QuestionnaireMicrosoft CSP Briefing Pre-Engagement - Questionnaire
Microsoft CSP Briefing Pre-Engagement - Questionnaire
 

Pulse code mod

  • 1. Pulse Code Modulation 4.# 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
  • 2. ANALOG-TO-DIGITAL CONVERSION A digital signal is superior to an analog signal because it is more robust to noise and can easily be recovered, corrected and amplified. For this reason, 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.# 2
  • 3. PCM  PCM consists of three steps to digitize an analog signal: n Sampling n Quantization n Binary encoding  Before we sample, we have to filter the signal to limit the maximum frequency of the signal as it affects the sampling rate.  Filtering should ensure that we do not distort the signal, ie remove high frequency components that affect the signal shape. 4.# 3
  • 4. Figure 4.21 Components of PCM encoder 4.# 4
  • 5. Sampling  Analog signal is sampled every TS secs.  Ts is referred to as the sampling interval.  fs = 1/Ts is called the sampling rate or sampling frequency.  There are 3 sampling methods:  Ideal - an impulse at each sampling instant  Natural - a pulse of short width with varying amplitude  Flattop - sample and hold, like natural but with single amplitude value  The process is referred to as pulse amplitude modulation PAM and the outcome is a signal with analog (non integer) values 4.# 5
  • 6. Figure 4.22 Three different sampling methods for PCM 4.# 6
  • 7. Note According to the Nyquist theorem, the sampling rate must be at least 2 times the highest frequency contained in the signal. 4.# 7
  • 8. Figure 4.23 Nyquist sampling rate for low-pass and bandpass signals 4.# 8
  • 9. 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.# 9
  • 10. Figure 4.24 Recovery of a sampled sine wave for different sampling rates 4.# 10
  • 11. Quantization  Sampling results in a series of pulses of varying amplitude values ranging between two limits: a min and a max.  The amplitude values are infinite between the two limits.  We need to map the infinite amplitude values onto a finite set of known values.  This is achieved by dividing the distance between min and max into L zones, each of height ∆. ∆ = (max - min)/L 4.# 11
  • 12. Quantization Levels  The midpoint of each zone is assigned a value from 0 to L-1 (resulting in L values)  Each sample falling in a zone is then approximated to the value of the midpoint. 4.# 12
  • 13. Quantization Zones  Assume we have a voltage signal with amplitutes Vmin=-20V and Vmax=+20V.  We want to use L=8 quantization levels.  Zone width ∆ = (20 - -20)/8 = 5  The 8 zones are: -20 to -15, -15 to -10, -10 to -5, -5 to 0, 0 to +5, +5 to +10, +10 to +15, +15 to +20  The midpoints are: -17.5, -12.5, -7.5, -2.5, 2.5, 7.5, 12.5, 17.5 4.# 13
  • 14. Assigning Codes to Zones  Each zone is then assigned a binary code.  The number of bits required to encode the zones, or the number of bits per sample as it is commonly referred to, is obtained as follows: nb = log2 L  Given our example, nb = 3  The 8 zone (or level) codes are therefore: 000, 001, 010, 011, 100, 101, 110, and 111  Assigning codes to zones:  000 will refer to zone -20 to -15  001 to zone -15 to -10, etc. 4.# 14
  • 15. Figure 4.26 Quantization and encoding of a sampled signal 4.# 15
  • 16. Quantization Error  When a signal is quantized, we introduce an error - the coded signal is an approximation of the actual amplitude value.  The difference between actual and coded value (midpoint) is referred to as the quantization error.  The more zones, the smaller ∆ which results in smaller errors.  BUT, the more zones the more bits required to encode the samples -> higher bit rate 4.# 16
  • 17. Bit rate and bandwidth requirements of PCM  The bit rate of a PCM signal can be calculated form the number of bits per sample x the sampling rate Bit rate = nb x fs  The bandwidth required to transmit this signal depends on the type of line encoding used. Refer to previous section for discussion and formulas.  A digitized signal will always need more bandwidth than the original analog signal. Price we pay for robustness and other features of digital transmission. 4.# 17