Skip to main content

Comparing Baseband and Passband Implementations of ASK, FSK, and PSK


 

Baseband modulation techniques are methods used to encode information signals onto a baseband signal (a signal with frequencies close to zero). Passband techniques shift these signals to higher carrier frequencies for transmission. Here are the common implementations:

Amplitude Shift Keying (ASK) [↗] :

In ASK, the amplitude of the signal is varied to represent different symbols.
Binary ASK (BASK) is a common implementation where two different amplitudes represent binary values (0 and 1).
ASK is simple but susceptible to noise.

ASK Baseband (Digital Bits)


ASK Passband (Modulated Carrier)

 
Fig 1:  ASK Passband Modulation (Get MATLAB Code)

In Figure 1 above, you can see binary information bits are used to switch a high-frequency carrier signal on and off. That's why this result is called a passband signal.


Frequency Shift Keying (FSK) [↗] :

FSK modulates the frequency of a carrier to represent digital data.
In binary FSK (BFSK), two different frequencies represent binary values.
FSK is less susceptible to noise compared to ASK but requires more bandwidth.


FSK Baseband (Mapping)


FSK Passband

For passband FSK modulation, we modulate bit '0' with a lower frequency carrier signal and bit '1' with a higher frequency carrier signal to prepare it for wireless transmission.

 

 
Fig 2: Frequency Modulation (Passband) (Get MATLAB Code from here)

In Figure 2 above, you can see binary information bits '1's and '0's are represented by high-frequency carrier oscillations. This is the passband signal.

Phase Shift Keying (PSK) [↗] :

PSK varies the phase of a carrier signal to represent symbols. For example, we can map binary bit '0' to '-1' and bit '1' to '+1' in baseband before shifting to a carrier.
Binary PSK (BPSK) uses two different phase shifts (usually 180 degrees apart) to represent binary values.
PSK is robust against noise and more bandwidth-efficient than ASK and FSK.

PSK Baseband


PSK Passband 

Fig 3: BPSK Modulation (Passband) 

In Figure 3 above, the binary information bits '1's and '0's are represented by phase shifts of a high-frequency carrier signal. A '0' might correspond to a carrier with 0° phase, while a '1' corresponds to a carrier with 180° phase. This results in the passband BPSK signal, where the amplitude remains constant but the phase flips according to the input bits.


Baseband vs. Passband QAM

Quadrature Amplitude Modulation (QAM) [↗] :

QAM combines ASK and PSK by varying both amplitude and phase of a carrier signal.
In QAM, each symbol represents a combination of amplitude and phase, allowing for higher data rates.
Higher-order QAM (e.g., 16-QAM, 64-QAM) increases the number of symbols and data rates but requires more complex receiver designs.

Pulse Amplitude Modulation (PAM) [↗] :

PAM encodes information in the amplitude of pulses in the baseband signal.
PAM is often used in digital communication systems where digital data is encoded into pulse amplitudes.

Orthogonal Frequency Division Multiplexing (OFDM) [↗] :

OFDM divides the baseband data into multiple narrowband subcarriers, each modulated using PSK or QAM.


OFDM is widely used in modern communication systems such as Wi-Fi, LTE, and digital television (DVB, ATSC) due to its robustness against frequency-selective fading and ability to mitigate intersymbol interference.

These modulation techniques play crucial roles in various communication systems, each with its advantages and limitations depending on the specific application requirements such as bandwidth efficiency, spectral efficiency, robustness against noise, and complexity of implementation. 

 

Further Reading

  1.  Comparing Baseband and Passband Implementations of m-ary QAM

Contact Us

Name

Email *

Message *

Popular Posts

Q-function in BER vs SNR Calculation

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) x = 1.0 Q(x) = 0.1587 ...

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

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

RMS Delay Spread, Excess Delay Spread and Multi-path ...(with MATLAB + Simulator)

📘 Overview of Delay Spread and Multi-path 🧮 Excess Delay spread 🧮 Power delay Profile 🧮 RMS Delay Spread 📚 Further Reading 📂 Other Topics on RMS Delay Spread, Excess Delay ... 🧮 Multipath Components or MPCs 🧮 Online Simulator for Calculating RMS Delay Spread 🧮 Why is there significant multipath in the case of very high frequencies? 🧮 Why RMS Delay Spread is essential for wireless communication? 🧮 Why the Power Delay Profile is essential? 🧮 MATLAB Codes for Calculating Different Types of delay Spreads Delay Spread, Excess Delay Spread, and Multipath (MPCs) The fundamental distinction between wireless and wired connections is that in wireless connections signal reaches at receiver thru multipath signal propagation rather than directed transmission like co-axial cable. Wireless Communication has no set communication path between the transmitter and the receiver. The line...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

Intel 8086 Transistor Count: Architecture, Specifications, and Comparison with Other Microprocessors

Intel 8086 Transistor Count: Architecture, Specifications, and Comparison with Other Microprocessors Intel 8086 Transistor Count: Complete Guide with Architecture and Processor Comparison The Intel 8086 microprocessor is one of the most important processors in computer history. Released in 1978 , it introduced the x86 architecture that still influences modern CPUs. One of the most frequently asked questions in computer architecture and microprocessor courses is: How many transistors are present in the Intel 8086? The commonly accepted answer is approximately 29,000 transistors . However, reverse-engineering studies have shown that the actual number of physical transistors is closer to 19,618 , while Intel's published figure includes programmable transistor locations used in ROM and PLA structures. Intel 8086 Transistor Count Metric Value Published transistor count ~29,000 Physical transistor count ~19,618 Release year 1978 Word ...

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