Skip to main content

ASK, FSK, and PSK (with MATLAB + Online 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



Contact Us

Name

Email *

Message *

Popular Posts

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. ๐Ÿ“˜ Overview ๐Ÿงฎ Encoding ๐Ÿงฉ Decoding ๐Ÿ“š Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

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 Demodulation More Topics 1. ASK (Ampli...

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2ฯ€)) ∫โ‚“∞ e^(-t² / 2) dt The Role of the Q-function in BER vs. SNR The Q-function is the standard tool for calculating BER in systems like BPSK or QPSK over AWGN (Additive White Gaussian Noise) channels. For BPSK: In BPSK, we transmit +√E b (bit 1) and -√E b (bit 0). The decision boundary is set at 0 . If -√E b was sent, an error occurs if noise r > √...

Online Simulator for Frequency Modulatiuon and Demodulation

FM Modulation Simulator Frequency Modulation (FM) In Frequency Modulation, the frequency of the carrier signal varies in accordance with the message signal's amplitude. s FM (t) = A c cos(ฯ‰ c t + k f ∫m(t)dt) where ฯ‰ = 2ฯ€f & k f = Frequency Sensitivity Modulation index, ฮฒ = (k f * A m ) / f m Change the parameter values to see the effect. Message Freq (Hz) 1 Carrier Freq (Hz) Message Amplitude (Am) Kf (sensitivity): 50 Perform FM Demodulation ๐Ÿงช Experiment for Students: ...

Gaussian minimum shift keying (GMSK)

๐Ÿ“˜ Overview & Theory ๐Ÿงฎ Simulator for GMSK ๐Ÿงฎ MSK and GMSK: Understanding the Relationship ๐Ÿงฎ MATLAB Code for GMSK ๐Ÿ“š Simulation Results for GMSK ๐Ÿ“š Q & A and Summary ๐Ÿ“š Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed signal to produce a continuous phase signal. For GMSK, the modulation index is $h=0.5$, meaning a bit '1' results in a phase shift of $\pi/2$: ฮธ(t) = 2ฯ€h ∫ 0 t m filtered (ฯ„) dฯ„ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Mo...