Skip to main content

ASK, FSK, and PSK (with MATLAB + Online Simulator)


📘 ASK Theory 📘 FSK Theory 📘 PSK Theory 📊 Comparison 🧮 MATLAB Codes 🎮 Simulator

ASK or OFF ON Keying

ASK is a simple (less complex) Digital Modulation Scheme where we vary the modulation signal's amplitude or voltage by the message signal's amplitude or voltage. We select two levels (two different voltage levels) for transmitting modulated message signals.

Example: "+5 Volt" (upper level) and "0 Volt" (lower level). To transmit binary bit "1", the transmitter sends "+5 Volts", and for bit "0", it sends no power.

The receiver uses filters to detect whether a binary "1" or "0" was transmitted.

Output of ASK, FSK, and PSK modulation using MATLAB
Fig 1: Output of ASK, FSK, and PSK modulation using MATLAB for a data stream "1 1 0 0 1 0 1 0" (Get MATLAB Code)

FSK (Frequency Shift Keying)

In Frequency Shift Keying (FSK), the message signal is modulated using a high-frequency carrier. Binary "1" and "0" are represented by two different frequencies close to the carrier frequency.

For example, using frequencies f1 and f2 (where f1 > f2):

S₁(t) = A cos(2Ï€fc1t) for binary 1
S₂(t) = A cos(2Ï€fc2t) for binary 0

Here, fc1 is different from fc2.

PSK (Phase Shift Keying)

In Phase Shift Keying (PSK), the phase of the carrier signal is changed to represent data bits. Binary "1" is transmitted by shifting the signal’s phase by 180°, while binary "0" keeps the same phase.

s(t) = A cos(2πfct + π) for binary 1
s(t) = A cos(2Ï€fct) for binary 0

Bit Rate Comparison

PSK (Phase Shift Keying)

PSK can use various phase shifts to encode more bits per symbol (e.g., QPSK, 16-PSK). It is the most efficient for high bit rates.

FSK (Frequency Shift Keying)

FSK requires more bandwidth, making it less bit-efficient than PSK for high-speed applications.

ASK (Amplitude Shift Keying)

ASK is highly susceptible to noise and is typically less effective than PSK for high-speed transmission.

Conclusion: PSK can achieve the highest bit rates, especially using higher-order modulation techniques.

MATLAB Code: ASK, FSK, and PSK

This single script generates a random binary sequence and applies all three digital modulation techniques (Amplitude, Frequency, and Phase Shift Keying) for side-by-side comparison.

% DIGITAL MODULATION (ASK, FSK, PSK) 
% Source: SalimWireless.Com 

clc; clear all; close all;

% --- 1. Parameters Configuration ---
Fs = 1000;              % Sampling Frequency
Tb = 1;                 % Bit Duration (seconds)
N_bits = 8;             % Number of bits to transmit
fc = 10;                % Base Carrier Frequency (Hz)
fc2 = 30;               % Secondary Frequency for FSK (Hz)
Ts = 1/Fs;              % Sampling Period
t_bit = 0:Ts:Tb-Ts;     % Time vector for one bit
rng(42);                % For reproducible results

% Generate Random Binary Data
binary_data = randi([0, 1], 1, N_bits);

% --- 2. Signal Generation ---
message_sig = [];
ask_sig = [];
fsk_sig = [];
psk_sig = [];

for bit = binary_data
    % Message Signal (Square wave)
    m_segment = bit * ones(1, length(t_bit));
    message_sig = [message_sig m_segment];
    
    % ASK Logic: Bit 1 = Carrier ON, Bit 0 = Carrier OFF
    ask_seg = bit * sin(2*pi*fc*t_bit);
    ask_sig = [ask_sig ask_seg];
    
    % FSK Logic: Bit 1 = fc2 (High), Bit 0 = fc (Low)
    if bit == 1
        fsk_seg = sin(2*pi*fc2*t_bit);
    else
        fsk_seg = sin(2*pi*fc*t_bit);
    end
    fsk_sig = [fsk_sig fsk_seg];
    
    % PSK Logic: Bit 1 = 180 deg phase, Bit 0 = 0 deg phase
    if bit == 1
        psk_seg = sin(2*pi*fc*t_bit + pi);
    else
        psk_seg = sin(2*pi*fc*t_bit + 0);
    end
    psk_sig = [psk_sig psk_seg];
end

% Total Time Vector for Plotting
t_total = 0:Ts:(N_bits*Tb)-Ts;

% --- 3. Visualization ---
figure('Name', 'Digital Modulation Comparison', 'Color', 'w');

subplot(4,1,1);
plot(t_total, message_sig, 'LineWidth', 2, 'Color', 'k');
title(['Binary Message: ', num2str(binary_data)]); grid on; axis([0 N_bits*Tb -0.5 1.5]);

subplot(4,1,2);
plot(t_total, ask_sig, 'LineWidth', 1, 'Color', 'b');
title('ASK (Amplitude Shift Keying)'); grid on;

subplot(4,1,3);
plot(t_total, fsk_sig, 'LineWidth', 1, 'Color', 'r');
title('FSK (Frequency Shift Keying)'); grid on;

subplot(4,1,4);
plot(t_total, psk_sig, 'LineWidth', 1, 'Color', [0 0.5 0]);
title('PSK (Phase Shift Keying)'); grid on;
xlabel('Time (seconds)');

Interactive Modulation Simulator

Test your binary data (1,0,1,0) and adjust carrier frequencies in our web-based simulator tool.

Launch Full Simulator →

📚 Try Online Interactive Simulators

📚 Further Reading

📊 MATLAB & ONLINE SIMULATIONS (Web-Based)
🎓 GATE & UGC - NET SOLUTIONS
📡 WIRELESS & SIGNAL PROCESSING


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

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

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

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

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

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

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}...
Read more

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 >
Read more