Skip to main content

Pulse Code Modulation (PCM)


Pulse Code Modulation (PCM)

Pulse Code Modulation (PCM) is a digital representation of an analog signal. It is the standard method used for converting analog audio, video, and other signals into a digital format for transmission, processing, or storage.

Block Diagram

The PCM process can be broken down into two main parts: the transmitter (analog-to-digital) and the receiver (digital-to-analog).

┌──────────────┐ │ Analog │ │ Message Signal│ └───────┬──────┘ │ ┌─────▼─────┐ │ LPF │ └─────┬─────┘ │ ┌─────▼─────┐ │ Sampler │ └─────┬─────┘ │ ┌─────▼─────┐ │ Quantizer │ └─────┬─────┘ │ ┌─────▼─────┐ │ Encoder │ └─────┬─────┘ │ PCM Output to Channel │ ┌─────────────────▼───────────────────┐ │ CHANNEL │ │ ┌─────────────────────────────┐ │ │ │ Regenerative Repeater │ │ │ └──────────────┬──────────────┘ │ │ ... │ │ ┌──────────────▼──────────────┐ │ │ │ Regenerative Repeater │ │ │ └─────────────────────────────┘ │ └─────────────────┬───────────────────┘ │ Channel Output │ ┌──────▼──────┐ │ Regeneration │ │ Circuit │ └──────┬──────┘ │ ┌──────▼──────┐ │ Decoder │ └──────┬──────┘ │ ┌──────▼──────┐ │Reconstruction│ │ Filter │ └──────┬──────┘ │ ┌──────▼──────┐ │ Destination │ └──────────────┘

Fig: Block Diagram of a PCM System

Transmitter (Analog-to-Digital Conversion)

  1. Low-Pass Filtering: Removes high-frequency components that could cause aliasing.
  2. Sampling: Converts continuous-time signal into discrete-time signal at rate \(f_s\).
  3. Quantization: Approximates sample amplitude to discrete levels.
  4. Encoding: Assigns unique binary codewords to levels.

Receiver (Digital-to-Analog Conversion)

  1. Regeneration: Prevents noise accumulation using repeaters.
  2. Decoding: Converts binary back to amplitude levels (staircase signal).
  3. Reconstruction Filtering: Smooths the signal back to analog form.

Interactive PCM Simulator

Test various sampling frequencies, quantization levels, and bit rates to visualize how signal quality changes in real-time.

Launch Simulator Tool

The Quantization Process

Quantization maps continuous-amplitude samples to a finite set of discrete levels. This is the main source of error in PCM systems.

Quantization Error (Noise)

The error \(e_q\) ranges from \(-\Delta/2 \le e_q \le \Delta/2\), where \(\Delta\) is the step size.

$$ \Delta = \frac{x_{\text{max}} - x_{\text{min}}}{L} = \frac{x_{\text{max}} - x_{\text{min}}}{2^n} $$

Types of Uniform Quantizers

  • Mid-Tread Quantizer: Origin lies on a tread (zero level exists).
  • Output ↑ 3Δ | ┌─────── | │ 2Δ | ┌──────┘ | │ Δ | ┌──────┘ | │ 0 ─┼─┼───────────→ Input | ┌─────┘ -Δ | │ | ┌────┘ -2Δ | │ └┘ -3Δ |
  • Mid-Rise Quantizer: Origin lies on a riser (no zero level).

Noise and Signal Quality (SQNR)

The quality is measured by the Signal-to-Quantization Noise Ratio (SQNR).

$$ \sigma_e^2 = \frac{\Delta^2}{12} \quad \text{and} \quad \text{SQNR} = \frac{P_s}{\sigma_e^2} $$

The 6dB Rule: For every additional bit, SQNR improves by ~6 dB.

$$ (\text{SQNR})_{\text{dB}} \approx 1.76 + 6.02n $$

Bit Rate (Rb)

$$ R_b = n \times f_s $$

Solved Example: TDM & Bandwidth

Question: Six signals are multiplexed using TDM, and the number of quantization levels is 256. Message frequency \(f_m = 5 \text{ KHz}\). Find Transmission Bandwidth.

Given: - N = 6 (Signals) - fm = 5 KHz - L = 256 levels → n = log₂(256) = 8 bits - fs = 2 × fm = 10 KHz Calculation: Bit Rate (Rb) = N × n × fs Rb = 6 × 8 × 10 = 480 kbps Bandwidth (B) = Rb / 2 B = 480 / 2 = 240 KHz

Deep Dive: Sampling Technique

Sampling is the bridge between analog and digital. It is essentially a switching approach. To prevent aliasing, we follow the Nyquist Criterion:

Sampling Illustration
The sampling frequency should be at least twice the message signal’s frequency.

Computers only comprehend binary ('0' and '1'). Quantization gives these samples meaning. For a 4-bit quantizer, we map signal values to 16 distinct levels (0000 to 1111).

Applications of PCM

  • Digital Telephony: Standard for PSTN and VoIP calls.
  • Digital Audio: Audio CDs (16-bit PCM @ 44.1 kHz), WAV, and AIFF files.
  • Space Communication: Robust against noise in deep space telemetry.
  • ISDN: Integrated services over digital telephone lines.


Contact Us

Name

Email *

Message *

Popular Posts

MIMO Channel Matrix | Rank and Condition Number

MIMO / Massive MIMO MIMO Channel Matrix | Rank and Condition...   The channel matrix in wireless communication is a matrix that describes the impact of the channel on the transmitted signal. The channel matrix can be used to model the effects of the atmospheric or underwater environment on the signal, such as the absorption, reflection or scattering of the signal by surrounding objects. When addressing multi-antenna communication, the term "channel matrix" is used. Let's assume that only one TX and one RX are in communication and there's no surrounding object. Here, in our case, we can apply the proper threshold condition to a received signal and get the original transmitted signal at the RX side. However, in real-world situations, we see signal path blockage, reflections, etc.,  (NLOS paths [↗]) more frequently. The obstruction is typically caused by building walls, etc. Multi-antenna communication was introduced to address this issue. It makes diversity app...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR Calculation What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figur...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...

How to Mount Google Drive in Google Colab

How to Mount Google Drive in Google Colab Google Colab provides temporary storage during a session. Any files stored in the /content directory will be deleted when the runtime disconnects. To store datasets, trained models, and results permanently, it is recommended to mount your Google Drive in Colab. Mounting Google Drive allows your notebook to access files directly from your Drive and save outputs there so they remain available even after the Colab session ends. Step 1: Import the Drive Module First import the Google Colab drive module. from google.colab import drive Step 2: Mount Google Drive Run the following command to mount your Google Drive. from google.colab import drive drive.mount('/content/drive') After running the command: A link will appear in the output. Click the link and log in to your Google account. Copy the authentication code provided. Paste the code back into the notebook. Or, a Google authentication page will a...

MATLAB Code for OTFS (Orthogonal Time Frequency Space)

MATLAB Code for OTFS (Orthogonal Time Frequency Space) %% Clear workspace clc; clear; close all ; %% Step 1: OTFS Parameters N_delay = 4; % Number of delay bins (rows) N_doppler = 4; % Number of Doppler bins (columns) N_sym = N_delay * N_doppler; modOrder = 4; % QPSK SNR_dB = 20; % Noise level %% Step 2: Generate random data symbols data = randi([0 modOrder-1], N_sym, 1); txSymbols = pskmod(data, modOrder, pi/4); disp( 'Transmitted Delay-Doppler symbols:' ); disp(reshape(txSymbols, N_delay, N_doppler)); %% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT) % ISFFT: Inverse Symplectic Finite Fourier Transform % 1. Take IDFT along Doppler (columns) % 2. Take DFT along Delay (rows) ddSymbols = reshape(txSymbols, N_delay, N_doppler); % Step 3a: IDFT along columns (Doppler) tfGrid = ifft(ddSymbols, N_doppler, 2); %IFFT (accross columns) along Doppler → spreads in time (Delay → Time) %FFT (accross rows)along Delay → spreads in frequency (Delay → Frequency) % Step 3b: DFT along ...

Wiener Filter in MATLAB

  MATLAB Code  % Wiener Filter Based on Wiener-Hopf Equation % This script demonstrates how to apply the Wiener filter to recover % a reference signal from a noisy signal using the Wiener-Hopf equation. % The filter minimizes the mean squared error between the noisy signal and the reference signal. clear; close all; clc; % Signal Parameters fs = 4000; % Sampling frequency (Hz) T = 1; % Total recording time (seconds) L = T * fs; % Signal length (samples) tt = (0:L-1) / fs; % Time vector ff = (0:L-1) * fs / L; % Frequency vector % Generate Reference Signal (a sinusoid) y = sin(2 * pi * 120 * tt); % Reference sinusoidal signal y = y(:); % Ensure column vector % Create Noisy Signal by Adding Gaussian Noise x = 0.50 * randn(L, 1) + y; % Noisy signal x = x(:); % Ensure column vector % Define Filter Order (Number of Coefficients) N = 200; % Apply Wiener Filter using custom function [xest, b, MSE] = wienerFilt(x, y, N); % Plot Results figure; subplot(411); plot(tt, x, 'k'), hold on, p...

Overmodulation & Distortion in AM

Overmodulation in AM and How It Causes Distortion 1. AM Signal Equation s(t) = A c [1 + μ m(t)] cos(2Ï€ f c t) A c = carrier amplitude m(t) = normalized modulating signal (|m(t)| ≤ 1) μ = modulation index 2. Modulation Index μ = A m / A c - Normal AM: 0 < μ ≤ 1 → no distortion - Overmodulation: μ > 1 → distortion occurs 3. Envelope and Overmodulation A(t) = A c [1 + μ m(t)] - For undistorted AM: 1 + μ m(t) ≥ 0 at all times - If μ > 1: 1 + μ m(t) < 0 at negative peaks → carrier flips Example: Let m(t) = cos(2Ï€ f m t), A c = 1 V, μ = 1.2 Minimum envelope: A min = A c [1 - 1.2] = -0.2 V Negative amplitude → envelope crosses zero → 180° phase flip 4. Mathematical Consequence -A c cos(θ) = A c cos(θ + Ï€) This phase reversal is what causes distortion in the demodulated signal. 5. Instantaneous AM Signal s...

QPSK Online Simulator (Signal Generation)

Simulator for QPSK Modulation Quadrature (4-PSK) Bitstream (Even length) Carrier Freq (Hz) Samples Per Symbol Run QPSK Simulation The Math Behind QPSK Quadrature Phase Shift Keying (QPSK) is a form of digital modulation that transmits two bits per symbol by changing the phase of a carrier wave. s(t) = A cos(2Ï€f c t + θ n ) Phase (θ n ): Each pair of bits (dibit) corresponds to a specific phase shift. In Gray coding, we use: "00" → Ï€/4 (45°) "01" → 3Ï€/4 (135°) "11" → 5Ï€/4 (225°) "10" → 7Ï€/4 (315°) Efficiency: Since 4 phases are used, QPSK carries double the data of BPSK in the same bandwidth. ...