Skip to main content

FBMC vs FDM vs OFDM: Complete Comparison


FBMC vs FDM vs OFDM: Complete Comparison

A detailed comparison of FBMC, FDM, and OFDM waveforms covering spectral efficiency, orthogonality, multipath handling, and applications in modern wireless systems.

1. Basics and Concepts

Technique Full Form Concept
FDM Frequency Division Multiplexing Divides spectrum into non-overlapping bands; requires guard bands to avoid interference.
OFDM Orthogonal Frequency Division Multiplexing Uses orthogonal subcarriers allowing spectral overlap without interference.
FBMC Filter Bank Multicarrier Uses filtered subcarriers for excellent spectral containment and real-domain orthogonality.

2. Key Characteristics

  • Spectral Efficiency: FDM (low), OFDM (high), FBMC (very high)
  • Filtering: FDM uses bandpass filters, OFDM uses rectangular pulses, FBMC uses prototype filters
  • Orthogonality: FDM via separation, OFDM over symbol duration, FBMC in real domain
  • Multipath: FDM poor, OFDM uses cyclic prefix, FBMC handles ISI without CP
  • Complexity: FDM low, OFDM medium, FBMC high

FDMA vs FBMC Packets: Real Examples and Mathematics

1. FDMA Packets

FDMA assigns each user a separate frequency band. Each packet occupies a fixed frequency slot over time.

Mathematical Representation


x_k(t) = ∑ s_k[n] · rect((t − nT)/T) · e^{j2Ļ€f_k t}

    
  • rect(·) is a rectangular pulse of duration T
  • sā‚–[n] is the n-th symbol of user k
  • eʲ²Ļ€fā‚–t is the carrier

Graphical Idea


| User1: 1kHz |      |      |
| User2: 2kHz     |      |
| User3: 3kHz         |  |

    

2. FBMC Packets

FBMC uses filtered subcarriers allowing frequency overlap while suppressing interference.

Mathematical Representation


x(t) = ∑ ∑ s_m[n] · g(t − nT) · e^{j2Ļ€mĪ”f t}

    
  • g(t) is a smooth prototype filter
  • Ī”f = 1/T is subcarrier spacing

Conceptual View


| Sub0 |~~~~~~|
| Sub1   |~~~~~~|
| Sub2     |~~~~~~|

    

Subcarriers overlap in frequency but remain orthogonal due to filtering.

Guard Bands in FDMA

Guard bands are frequency gaps, not zero-padding in time.

User Assigned Band Guard Band
1 0–1 kHz 1–1.2 kHz
2 1.2–2.2 kHz 2.2–2.4 kHz

FBMC reduces or eliminates guard bands using spectral shaping.

Final Summary

  • FDM is simple but spectrally inefficient.
  • OFDM balances efficiency and complexity using cyclic prefix.
  • FBMC offers the best spectral containment for future wireless systems.


Contact Us

Name

Email *

Message *

Popular Posts

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

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

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

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2Ļ€f & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {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 k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →

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