Skip to main content

MATLAB Code for QPSK Modulation and Demodulation


 

Quadrature Phase Shift Keying (QPSK) is a digital modulation scheme that conveys two bits per symbol by changing the phase of the carrier signal. Each pair of bits is mapped to one of four possible phase shifts: 0°, 90°, 180°, or 270°

00  ===> 0 degree phase shift of carrier signal

01  ===> 90 degree

11  ===> 180 degree

10  ===> 270 degree

 

MATLAB Script


 

Result

data
1
0
2
2
0
2
1
.
.
.

modData
-1.00000000000000 + 1.22464679914735e-16i
-1.83697019872103e-16 - 1.00000000000000i
1.00000000000000 + 0.00000000000000i
6.12323399573677e-17 + 1.00000000000000i
6.12323399573677e-17 + 1.00000000000000i
-1.83697019872103e-16 - 1.00000000000000i
1.00000000000000 + 0.00000000000000i
-1.00000000000000 + 1.22464679914735e-16i
6.12323399573677e-17 + 1.00000000000000i
-1.83697019872103e-16 - 1.00000000000000i
.
.
.


Fig 1: Constellation Diagram of Transmitted QPSK (or 4 PSK) Signal




Fig 2: Constellation Diagram of Received QPSK (or 4 PSK) Signal through Noisy Channel


Further Reading

  1. MATLAB Code for Constellation Diagram of QPSK
  2. Constellation Diagram of BPSK

QPSK (Passband) Signal Generation 

Choose QPSK as the modulation type in the simulation to visualize the QPSK signal.

Try the Online Simulator for QPSK Signal Generator (Click here)


Spectral Efficiency in QPSK

M = 4 Modulation

In Quadrature Phase Shift Keying (QPSK), the system transmits two bits per symbol. This allows for a significantly higher Spectral Efficiency (η) compared to binary modulation, doubling the data rate within the same frequency allocation.

Fundamental Measurement

η = Rb / B

For QPSK (M = 4), each symbol carries 2 bits. Therefore:

Rb = 2 × Rs

Where Rb is Bit Rate and Rs is Symbol Rate

Efficiency Benchmarks (η)

Nyquist Limit (B = Rs) 2.0 bps/Hz
Null-to-Null (B = 2Rs) 1.0 bps/Hz

The QPSK Calculation Logic

The measurement of efficiency in a QPSK system is driven by three core technical factors:

  1. 1
    Bit-to-Symbol Mapping: Because QPSK utilizes four distinct phases, it maps bit pairs (00, 01, 10, 11) to a single symbol. This means the Symbol Rate (Rs) is exactly half of the Bit Rate (Rb).
  2. 2
    Bandwidth Efficiency: The Required Bandwidth (B) of a signal is physically determined by the Symbol Rate. Since QPSK has a lower symbol rate than BPSK for the same bit rate, it consumes 50% less bandwidth to move the same amount of data.
  3. 3
The Sweet Spot Result: Under identical pulse-shaping conditions, QPSK provides an Efficiency (η) that is exactly double that of BPSK, reaching a theoretical max of 2 bits/s/Hz.

Why Engineers Choose QPSK

While 16-QAM or 64-QAM offer even higher efficiency, they are extremely fragile in noisy environments. QPSK is the industry's robust middle-ground, used extensively in Satellite Links (DVB-S) and LTE Control Channels where both speed and reliability are critical.

Read more: about Spectral Efficiency for various Modulation Schemes

QPSK Performance Analysis: Bit and Symbol Error Rates

Quadrature Phase Shift Keying (QPSK) is widely used due to its ability to carry twice the data rate of BPSK within the same bandwidth while maintaining the same bit error performance.

1. QPSK Bit Error Rate (BER)

For Gray-coded QPSK, the probability of bit error is identical to BPSK, as the quadrature components are independent:

\[ P_{b, QPSK} = Q\left(\sqrt{\frac{2E_b}{N_0}}\right) \]

2. QPSK Symbol Error Rate (SER)

A QPSK symbol consists of two bits. An error occurs if either (or both) bits are detected incorrectly. The approximation for SER is:

\[ P_{s, QPSK} \approx 2Q\left(\sqrt{\frac{2E_b}{N_0}}\right) \]

Note: The exact expression is \( P_s = 1 - [1 - P_b]^2 \).


Comparative BER Performance

How QPSK compares to other modulation formats in terms of \(P_b\):

BPSK (Same as QPSK)

\[ P_b = Q\left(\sqrt{\frac{2E_b}{N_0}}\right) \]

8-PSK (Higher Order)

\[ P_b \approx \frac{2}{3} Q\left( \sqrt{\frac{2E_s}{N_0}} \sin\left(\frac{\pi}{8}\right) \right) \]

16-QAM (Gray Coded)

\[ P_b \approx \frac{3}{4} Q\left( \sqrt{\frac{4}{5}\frac{E_b}{N_0}} \right) \]

64-QAM / 256-QAM

\[ P_{b, 64} \approx \frac{7}{12} Q\left( \sqrt{\frac{2}{7}\frac{E_b}{N_0}} \right), \quad P_{b, 256} \approx \frac{15}{32} Q\left( \sqrt{\frac{8}{85}\frac{E_b}{N_0}} \right) \]

Comparative Symbol Error Rate (SER)

Performance benchmarks for symbol detection:

8-PSK Approximation

\[ P_s \approx 2Q\left( \sqrt{\frac{2E_s}{N_0}} \sin\left(\frac{\pi}{8}\right) \right) \]

16-QAM Approximation

\[ P_s \approx 3Q\left( \sqrt{\frac{4}{5}\frac{E_b}{N_0}} \right) \]

Higher Order QAM (64 & 256)

\[ P_{s, 64} \approx \frac{7}{2} Q\left( \sqrt{\frac{2}{7}\frac{E_b}{N_0}} \right), \quad P_{s, 256} \approx \frac{15}{4} Q\left( \sqrt{\frac{8}{85}\frac{E_b}{N_0}} \right) \]
Technical Deep Dive: Q-function & SNR Calculation


Contact Us

Name

Email *

Message *

Popular Posts

Hybrid Beamforming | Page 1

Beamforming Techniques Hybrid Beamforming... Page 1 | Page 2 | Hybrid Beamforming: Hybrid beam formation was developed to address some of the limitations of digital pre-coding approaches. Every antenna element is connected to an RF chain in digital pre-coding (beam forming) method. We also know that each RF chain is in charge of providing a separate data stream between the transmitter and the receiver. We know that a larger number of independent data streams leads to higher data rates. It has a spatial multiplexing feature for MIMO. As a result, we may assume that switching from MIMO to massive MIMO will benefit us more in terms of spatial multiplexing in massive MIMO, where each antenna is coupled to a single RF chain. We'll proceed with a definition of hybrid beam forming. Overview of hybrid beam forming with example: Unlike digital beam forming, more than one antenna element is connected to a single RF chain in hybr...

MATLAB Code for 8-PSK, 16-PSK, ...

📘 Overview & Theory 🧮 MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK 🧮 Simulator for m-ary PSK 📚 Further Reading   MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK clc; clear all; close all; rng(10) M = 8; % M = 2, 4, 8, 16, 32, etc. N_Bits = 2520; Phase = 0; data_info_bit = randi([0,1],N_Bits,1); data_temp = bi2de(reshape(data_info_bit,N_Bits/log2(M),log2(M))); modData = pskmod(data_temp,M,Phase); figure(1); scatterplot(modData); channelAWGN = 15; rxData2 = awgn(modData, channelAWGN); figure(2); scatterplot(rxData2); demodData = pskdemod(rxData2,M,Phase);   for BPSK, Constellation Size, M = 2 for QPSK, M = 4 for 8-PSK, M = 8, and so on    Output Figure: 8-PSK Modulation Figure: 8-PSK Demodulation after adding AWGN Noise Using the above MATLAB code you'll able be to modulate and demodulate 2-PSK, 4-PSK, 8-PSK, 16-PSK, 32-PSK and so on.  16-PSK   Fig: 16-PSK In this above code ' M ' is the number of the conste...

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 Windowing Affects Your Periodogram

The windowed periodogram is a widely used technique for estimating the Power Spectral Density (PSD) of a signal. It enhances the classical periodogram by mitigating spectral leakage through the application of a windowing function. This technique is essential in signal processing for accurate frequency-domain analysis.   Power Spectral Density (PSD) The PSD characterizes how the power of a signal is distributed across different frequency components. For a discrete-time signal, the PSD is defined as the Fourier Transform of the signal’s autocorrelation function: S x (f) = FT{R x (Ï„)} Here, R x (Ï„)}is the autocorrelation function. FT : Fourier Transform   Classical Periodogram The periodogram is a non-parametric PSD estimation method based on the Discrete Fourier Transform (DFT): P x (f) = \(\frac{1}{N}\) X(f) 2 Here: X(f): DFT of the signal x(n) N: Signal length However, the classical periodogram suffers from spectral leakage due to abrupt truncation of the ...

Advanced M-ary Modulation Simulator: Constellation, min dist, Efficiency, SER, EVM (RMS)

Advanced M-ary Communication Lab Analytical & Statistical Performance of Digital Modulation Theoretical Probability of Error (\(P_s\)) \[ P_s = Q\left(\sqrt{\frac{2 E_b}{N_0}}\right) \] Modulation (M-ary) BPSK (M=2) QPSK (M=4) 8-PSK (M=8) 16-QAM (M=16) 64-QAM (M=64) 256-QAM (M=256) SNR (\(E_b/N_0\)): 12 dB Efficiency 2 bps/Hz Min Dist (\(d_{min}\)) 1.41 Symbol Error 1.2e-5 EVM (RMS) 0.0% Constellation Diagram Noise PDF & Decision Tail 1. Geometric Mapping ...

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

Galois Fields: GF(2) and GF(2m) and Primitive Polynomial

Galois Fields: GF(2) and GF(2 m ) 1. What is a Galois Field (GF)? A Galois Field (GF) is a finite set of elements in which the four basic arithmetic operations—addition, subtraction, multiplication, and division (except by zero)— are all well defined and closed. GF(q) ⇒ a field with exactly q elements 2. The Simplest Field: GF(2) GF(2) is the smallest possible finite field and forms the foundation of all digital systems. GF(2) = {0, 1} Addition in GF(2) Addition is performed modulo 2 (XOR operation): + 0 1 0 0 1 1 1 0 Multiplication in GF(2) × 0 1 0 0 0 1 0 1 GF(2) is used in binary logic, XOR operations, and simple error-control codes. 3. Meaning of GF(2 m ) GF(2 m ) is a finite field containing exactly 2 m elements . Each element represents an m-bit symbol . Field Number of Elements GF(2) 2 GF(2²) 4 GF(2³) 8 GF(2⁸) 256 Important: GF(2 m ) is not integer arithmetic modulo 2 m . It is polynomial-based arithmetic. 4....