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

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

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

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

MATLAB Code for BER performance of QPSK with BPSK, 4-QAM, 16-QAM, 64-QAM, 256-QAM, etc

📘 Overview 🧮 MATLAB Codes 🧮 Online Simulator for Calculating BER of M-ary PSK and QAM 🧮 QPSK vs BPSK and QAM: A Comparison of Modulation Schemes in Wireless Communication 🧮 Are QPSK and 4-PSK same? 📚 Further Reading   QPSK offers double the data rate of BPSK while maintaining a similar bit error rate at low SNR when Gray coding is used. It shares spectral efficiency with 4-QAM and can outperform 4-QAM or 16-QAM in very noisy channels. QPSK is widely used in practical wireless systems, often alongside QAM in adaptive modulation schemes [Read more...] What is the Gray Code? Gray Code: Gray code is a binary numeral system where two successive values differ in only one bit. This property is called the single-bit difference or unit distance code. It is also known as reflected binary code. Let's convert binary 111 to Gray code: Binary bits: B = 1 1 1 Apply the rule: G[0] = B[0] = 1...

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics 1. ASK (Amplitude Shift Keying) Simulat...

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

FFT Butterfly Method Explained (with Simulations)

4-Point FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {x[0], x[2]} = {0, 2} Odd indices: x o = {x[1], x[3]} = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part (E): {0+2, 0-2} = {2, -2} Odd Part (O): {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W 4 k O[k] X[k + 2] = E[k] - W 4 k O[k] Twiddle Factors (N=4): W 4 0 = 1, W 4 1 = -j Final Calculations: X[0] = E[0] + W 4 0 O[0] = 2 + (1)(4) = 6 X[2] = E[0] - W 4 0 O[0] = 2 - (1)(4) = -2 X[1] = E[1] + W 4 1 O[1] = -2 + (-j)(-2) = -2 + 2j X[3] = E[1] - W 4 1 O[1] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} 8-Point FFT Using Butterfly Method Given: x[n] = {0,1,2,3,4,5,6,7} Step 1: Split into Bit-Reversed Order To perform DIT-FFT, split the 8 points into pairs of two: Group A: {x[0], x[4]} = {0, 4}...

Online Pulse Code Modulation (PCM) Simulator

Instructions for Pulse Code Modulation (PCM) Note: Use the input fields to enter values. Step 1: Generate Message Step 2: Plot Quantized Signal Step 3: Generate PCM Signal Message Frequency (Hz): Sampling Frequency (Hz): Quantization Levels: Generate Message Quantized PCM Quantization SNR (dB): Demodulation Cut-off Frequency Demodulate PCM Quantization Table Calculate Bits Levels Step Min Mid Max SNR Print Online Signal Processing Simulations Home Page >