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.

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
๐ŸŽ“ UGC NET SOLUTIONS
๐Ÿ“ก WIRELESS & THEORY

Contact Us

Name

Email *

Message *

Popular Posts

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

UGC NET Electronic Science June 2025 Question Paper with Answer Key & Detailed Solutions

Home / UGC NET PYQ / June 2025 Solved UGC NET Electronic Science June 2025 Question Paper with Answer Key and Full Explanations ๐Ÿ“ฅ Download Question Paper (PDF) 2025 2024 2023 2022 2021 2020 Explanations 1.  Answer: Option (3) For forming a p-type semiconductor, the dopant must be a trivalent impurity (three valence electrons) so that it creates acceptor levels and holes become the majority carriers. Among the given elements, boron (B) is a group-III element (trivalent). Arsenic (As) and phosphorus (P) are group-V (pentavalent) donors that produce n-type material, and germanium (Ge) is a group-IV element usually used as the semiconductor, not as an acceptor dopant. Hence, doping an intrinsic semiconductor with B produces a p-type semiconductor. 2.  Answer: Option (4) The ohmic resistance of a JFET at zero gate bias is given by the standard relation: R DS(on) = V P / I DSS ...
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 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 figure of merit f...
Read more

Q-function in BER vs SNR Calculation

Q-function in BER vs. SNR Calculation | Interactive Guide 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 Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) ...
Read more

MATLAB Code for ASK, FSK, and PSK (with Online Simulator)

MATLAB Code for ASK, FSK, and PSK Comprehensive implementation of digital modulation and demodulation techniques with simulation results. ๐Ÿ“˜ Theory ๐Ÿ“ก ASK Code ๐Ÿ“ถ FSK Code ๐ŸŽš️ PSK Code ๐Ÿ•น️ Simulator ๐Ÿ“š Further Reading Amplitude Shift Frequency Shift Phase Shift Live Simulator ASK, FSK & PSK HomePage MATLAB Code MATLAB Code for ASK Modulation and Demodulation COPY % The code is written by SalimWireless.Com clc; clear all; close all; % Parameters Tb = 1; fc = 10; N_bits = 10; Fs = 100 * fc; Ts = 1/Fs; samples_per_bit = Fs * Tb; rng(10); binar...
Read more

Which of the following statements are correct? A. If the intermediate frequency is too high, poor selectivity results even if sharp cutoff filters are used in the IF stage.

  61) Which of the following statements are correct?  A. If the intermediate frequency is too high, poor selectivity results even if sharp cutoff filters are used in the IF stage.  B. A high value of intermediate frequency increases tracking difficulties.  C. As the intermediate frequency is lowered, image frequency rejection becomes better.  D. A very low intermediate frequency can make the selectivity too sharp.  Choose the correct answer from the options given below:  1. A and B only [Option ID = 3073]  2. B and C only [Option ID = 3074]  3. C and D only [Option ID = 3075]  4. B and D only [Option ID = 3076 Answer: 4  Previous yr Question papers with Full Explanations → Electronics and Communiaction Study Materials → Try Interactive Online Simulator Run the Simulation The Superheterodyne Principle The...
Read more

Shannon Limit Explained: Negative SNR, Eb/No and Channel Capacity

Understanding Negative SNR and the Shannon Limit An explanation of Signal-to-Noise Ratio (SNR), its behavior in decibels, and how Shannon's theorem defines the ultimate communication limit. Signal-to-Noise Ratio in Shannon’s Equation In Shannon's equation, the Signal-to-Noise Ratio (SNR) is defined as the signal power divided by the noise power: SNR = S / N Since both signal power and noise power are physical quantities, neither can be negative. Therefore, the SNR itself is always a positive number. However, engineers often express SNR in decibels: SNR(dB) When SNR = 1, the logarithmic value becomes: SNR(dB) = 0 When the noise power exceeds the signal power (SNR < 1), the decibel representation becomes negative. Behavior of Shannon's Capacity Equation Shannon’s channel capacity formula is: C = B log₂(1 + SNR) For SNR = 0: log₂(1 + SNR) = 0 When SNR becomes smaller (including negative values in dB), the expression approache...
Read more

Reed–Solomon Coding and Decoding

Reed–Solomon Coding and Decoding 1. Input Bitstream to Symbols Given input bitstream: 101011000… Choose symbol size: m = 3 ⇒ symbols in GF(2³) Grouping bits: 101 | 011 | 000 Binary to decimal symbols: [5, 3, 0] 2. Finite Field Construction GF(2³) Primitive polynomial: p(x) = x³ + x + 1 Element Polynomial Binary Decimal ฮฑ⁰ 1 001 1 ฮฑ¹ ฮฑ 010 2 ฮฑ² ฮฑ² 100 4 ฮฑ³ ฮฑ + 1 011 3 ฮฑ⁴ ฮฑ² + ฮฑ 110 6 ฮฑ⁵ ฮฑ² + ฮฑ + 1 111 7 ฮฑ⁶ ฮฑ² + 1 101 5 3. Message Polynomial Choose RS(7,3): n = 7, k = 3 Message symbols: [5, 3, 0] Message polynomial: m(x) = 5 + 3x + 0x² 4. Generator Polynomial Number of parity symbols: n − k = 4 Generator polynomial: g(x) = (x − ฮฑ)(x − ฮฑ²)(x − ฮฑ³)(x − ฮฑ⁴) Expanded form: g(x) = x⁴ + 6x³ + x² + 6x + 1 5. RS Encoding (Polynomial Division) Multiply message by x⁴: x⁴m(x) = 5x⁴ + 3x⁵ Divide by generator polynomial: r(x) = 6 + 4x + 2x² + 5x³ Codeword polynomial: c(x) = x⁴m(x) + r(x) Final codeword symbols: [...
Read more