Skip to main content

Why is Time-bandwidth Product (TBP) Important?


📘Theory 📏Example 🧮Filter Code 📈Gaussian Code 📚Further Reading

Time-Bandwidth Product (TBP)

The time-bandwidth product (TBP) is defined as:

TBP = Δf ⋅ Δt
  • Δf (Bandwidth): The frequency bandwidth of the signal, representing the range of frequencies over which the signal is spread.
  • Δt (Time duration): The duration for which the signal is significant, i.e., the time interval during which the signal is non-zero.

The TBP is a measure of the "spread" of the signal in both time and frequency domains. A higher TBP means the signal is both spread over a larger time period and occupies a wider frequency range.

To calculate the period of a signal with finite bandwidth, Heisenberg’s uncertainty principle plays a vital role where the time-bandwidth product indicates the processing gain of the signal.

We apply spread spectrum techniques in wireless communication for various reasons, such as interference resilience, security, robustness in multipath, etc. But in spread spectrum techniques, we compromise some bandwidth.

The time-bandwidth product for Gaussian-shaped pulses is 0.44 (approx.).

If the time-bandwidth product of a signal is >> 1, then the signal bandwidth (B) is much greater than what is required for transmitting the data rate (Rb). So, in this case, we are unable to utilize the whole available bandwidth. For this case, spectrum efficiency will be less.

To your knowledge, the product of the variance of time and variance of bandwidth for a Gaussian signal is 0.25, and for a triangular-shaped signal, it is 0.3.

Example: Raised Cosine Filter

Let’s assume we have designed a raised cosine filter with a roll-off factor of 0.25. The symbol rate for transmission is 100 symbols per second, and the number of samples per symbol is 10. Also, assume the filter span is 2, meaning the duration is up to 2 symbol times.

Bandwidth Calculation:

The bandwidth of the raised cosine filter is calculated as:

Bandwidth = (Symbol Rate × (1 + Roll-off Factor)) / 2
Bandwidth = (100 × (1 + 0.25)) / 2 = 62.5 Hz

Time Duration (Filter Span = 2):

Filter Duration = Filter Span × One Symbol Duration
Filter Duration = 2 × 0.01 = 0.02 seconds

Time-Bandwidth Product (TBP):

TBP = 0.02 × 62.5 = 1.25

Time Duration (Filter Span = 6):

If the filter span is 6, then the time-bandwidth product will be:

TBP = 0.06 × 62.5 = 3.75

Conclusion: The raised cosine filter reduces the effect of intersymbol interference (ISI) during signal transmission. Increasing the bandwidth helps mitigate ISI to a greater extent, but it also increases the time-bandwidth product, making the system less bandwidth-efficient.

Ready to Simulate?

Use the professional MATLAB scripts below to visualize the Time-Bandwidth Product in real-time.

View MATLAB Scripts ↓

MATLAB: Raised Cosine Filter TBP

MATLAB Script 
% The code is developed by SalimWireless.Com
clc;
clear;
close all;

% Parameters
beta = 0.25; % Roll-off factor
span = 2; % Filter span in symbols
sps = 10; % Samples per symbol
symbolRate = 1e2; % Symbol rate in Hz

% Generate the Raised Cosine Filter
rcFilter = rcosdesign(beta, span, sps, 'sqrt');

% Plot the Impulse Response
t = (-span/2 : 1/sps : span/2) * (1/symbolRate);
figure;
subplot(3,1,1);
plot(t, rcFilter, 'LineWidth', 1.5);
title('Raised Cosine Filter Impulse Response');
xlabel('Time (s)');
ylabel('Amplitude');
grid on;

% Analyze Frequency Response
[H, F] = freqz(rcFilter, 1, 1024, sps * symbolRate);
subplot(3,1,2);
plot(F, abs(H), 'LineWidth', 1.5);
title('Raised Cosine Filter Frequency Response');
xlabel('Frequency (Hz)');
ylabel('Magnitude');
grid on;

% Time-Bandwidth Product Calculation
timeDuration = span * (1 / symbolRate); 
bandwidth = (1 + beta) * (symbolRate / 2); 
TBP = timeDuration * bandwidth; 

% Display Results
disp(['Time Duration (s): ', num2str(timeDuration)]);
disp(['Bandwidth (Hz): ', num2str(bandwidth)]);
disp(['Time-Bandwidth Product: ', num2str(TBP)]);

% Simulate Filtered Signal
numSymbols = 100;
data = randi([0 1], numSymbols, 1) * 2 - 1;
upsampledData = upsample(data, sps);
txSignal = conv(upsampledData, rcFilter, 'same');

subplot(3,1,3);
plot(txSignal(1:200), 'LineWidth', 1.5);
title('Filtered Transmitted Signal');
xlabel('Sample Index');
ylabel('Amplitude');
grid on;

Output Results

Time Duration (s): 0.02
Bandwidth (Hz): 62.5
Time-Bandwidth Product: 1.25

MATLAB: Gaussian Noise TBP

MATLAB Script 
% The code is developed by SalimWireless.Com
clc;
clear;
close all;

% Step 1: Generate Gaussian pulse
t = 0:0.01:1; % Time vector
sigma = 1; % Standard deviation
gaussian_pulse = exp(-t.^2 / (2 * sigma^2)); 

% Step 2: Calculate RMS time duration
power_signal = gaussian_pulse.^2;
rms_time = sqrt(sum(t.^2 .* power_signal) / sum(power_signal));

% Step 3: Calculate Frequency Bandwidth
Fs = 100; % Sampling frequency
N = length(gaussian_pulse);
f = (-N/2:N/2-1) * (Fs / N); % Frequency vector
G_f = fftshift(fft(gaussian_pulse)); % Fourier transform

power_spectrum = abs(G_f).^2;
rms_freq = sqrt(sum(f.^2 .* power_spectrum) / sum(power_spectrum));

% Step 4: Compute TBP
TBP_rms = rms_time * rms_freq;

% Display results
disp(['RMS Time Duration (Delta t): ', num2str(rms_time)]);
disp(['RMS Frequency Bandwidth (Delta f): ', num2str(rms_freq)]);
disp(['Time-Bandwidth Product (TBP): ', num2str(TBP_rms)]);

Output Results

RMS Time Duration (Delta t): 0.50383
RMS Frequency Bandwidth (Delta f): 0.98786
Time-Bandwidth Product (TBP): 0.49772

1. Simulator: Data Pulse (Raised Cosine)

This mimics how a single bit of data is shaped in modern wireless communication.

(Adjusts how "sharp" the filter is)

(How long the pulse lasts)

Calculated TBP: 1.25 Good Efficiency

2. Simulator: Gaussian Pulse (The Perfect Balance)

The Gaussian pulse is special because it achieves the minimum possible TBP. It is the "smoothest" possible signal.

(Widening in time automatically narrows frequency)

Calculated TBP: 0.44 Fundamental Minimum

3. The Math Behind the Simulators

The Time-Bandwidth Product (TBP) is like a "Space-Time" budget for signals. No matter how you design a signal, you cannot make it infinitely small in both time and frequency at once.

  • The Formula: TBP = Δt × Δf
  • The Limit: For any signal, TBP ≥ 0.5 (approx). You can never go below this limit. This is the Heisenberg Uncertainty Principle applied to signals.
  • The Trade-off:
    • If TBP ≈ 0.5 to 1.5: High Spectral Efficiency. Used in 5G, Wi-Fi, and Fiber Optics.
    • If TBP > 10: Spread Spectrum. Used in GPS and Radar to resist interference.

Real-world Applications of Different TBP

The choice of TBP is a strategic decision based on the application. It defines the "shape" of the energy in the time-frequency plane.

System Type Required TBP Primary Goal
Consumer Wireless (5G/Wi-Fi) $\approx 1.0$ High Spectral Efficiency; fitting max bits into narrow Hz.
GSM/GMSK (2G Mobile) $0.3$ (BT Product) Constant envelope for power-efficient amplifiers.
Radar Systems $> 10$ to $1000+$ Pulse Compression; High resolution with high energy.
Satellite Links High (>10) Robustness against deep space interference/fading.

Read More: about Time-Bandwidth Product and Pulse Shaping

GMSK Spectrum


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


Contact Us

Name

Email *

Message *

Popular Posts

MATLAB Code for MUSIC

  MATLAB Code clc; clear; close all ; %% Step 1: Define Parameters M = 8; % Number of array sensors d = 0.5; % Sensor spacing (lambda/2) K = 2; % Number of signals N = 200; % Number of snapshots theta = [-20 30]; % True signal angles (degrees) SNR = 10; % Signal-to-noise ratio (dB) fprintf( 'Step 1: Parameters Initialized\n' ); %% Step 2: Generate Signal Sources t = 1:N; s1 = exp(1j*2*pi*0.05*t); s2 = exp(1j*2*pi*0.1*t); S = [s1; s2]; figure; plot(real(S(1,:))) title( 'Signal 1 (Real Part)' ) xlabel( 'Samples' ) ylabel( 'Amplitude' ) figure; plot(real(S(2,:))) title( 'Signal 2 (Real Part)' ) xlabel( 'Samples' ) ylabel( 'Amplitude' ) fprintf( 'Step 2: Source Signals Generated\n' ); %% Step 3: Construct Steering Matrix A = zeros(M,K); for k = 1:K A(:,k) = exp(-1j*2*pi*d*(0:M-1)'*sin(theta(k)*pi/180)); end fprintf( 'Step 3: Steering Matr...
Read more

MATLAB code for BER vs SNR for M-QAM, M-PSK, QPSK, BPSK (with Simulation)

🧮 MATLAB Code for BPSK, M-ary PSK, and M-ary QAM Together 🧮 MATLAB Code for M-ary QAM 🧮 MATLAB Code for M-ary PSK 📚 Further Reading MATLAB Script for BER vs. SNR for M-QAM, M-PSK, QPSK, BPSK % Written by Salim Wireless clc; clear; close all; snr_db = -5:2:25; psk_orders = [2, 4, 8, 16, 32]; qam_orders = [4, 16, 64, 256]; ber_psk_results = zeros(length(psk_orders), length(snr_db)); ber_qam_results = zeros(length(qam_orders), length(snr_db)); for i = 1:length(psk_orders) ber_psk_results(i, :) = berawgn(snr_db, 'psk', psk_orders(i), 'nondiff'); end for i = 1:length(qam_orders) ber_qam_results(i, :) = berawgn(snr_db, 'qam', qam_orders(i)); end figure; semilogy(snr_db, ber_psk_results(1, :), 'o-', 'LineWidth', 1.5, 'DisplayName', 'BPSK'); hold on; for i = 2:length(psk_orders) semilogy(snr_db, ber_psk_results(i, :), 'o-', 'DisplayName', sprintf('%d-PSK', psk_or...
Read more

Theoretical BER vs SNR for BPSK

Theoretical Bit Error Rate (BER) vs Signal-to-Noise Ratio (SNR) for BPSK in AWGN Channel Let’s simplify the explanation for the theoretical Bit Error Rate (BER) versus Signal-to-Noise Ratio (SNR) for Binary Phase Shift Keying (BPSK) in an Additive White Gaussian Noise (AWGN) channel. Key Points Fig. 1: Constellation Diagrams of BASK, BFSK, and BPSK [↗] BPSK Modulation Transmits one of two signals: +√Eb or −√Eb , where Eb is the energy per bit. These signals represent binary 0 and 1 . AWGN Channel The channel adds Gaussian noise with zero mean and variance N₀/2 (where N₀ is the noise power spectral density). Receiver Decision The receiver decides if the received signal is closer to +√Eb (for bit 0) or −√Eb (for bit 1) . Bit Error Rat...
Read more

PSD Calculation with FFT: MATLAB Tutorial for Signal Analysis

  Implementation Steps 1. FFT Computes the Frequency Content of a Signal FFT converts a time-domain signal to the frequency domain. If: The signal is sampled at rate $f_s$ You compute an $N_{\text{FFT}}$-point FFT Then each FFT bin corresponds to a frequency resolution of: $$\Delta f = \frac{f_s}{N_{\text{FFT}}}$$ So the FFT gives you accurate frequency content, assuming the signal is stationary and adequately sampled (Nyquist criterion met).  2. Magnitude Squared Gives Power (Not Amplitude) $$P[k] = |X[k]|^2$$ This gives power at each frequency bin, not just amplitude. It represents how much energy is present at each frequency. It's a key step for PSD.  3. Normalization Makes the PSD Physically Meaningful The equation: $$\text{PSD}[k] = \frac{|X[k]|^2}{N_{\text{FFT}} \cdot f_s \cdot U}$$ is derived from first principles and ensures that the u...
Read more

Direction of Arrival (DoA) Online Simulator (using MUSIC)

Interactive DOA Simulator X-axis XY angle (deg): 45 XZ angle (deg): 30 Noise: 0.05 Y-axis XY angle (deg): 60 YZ angle (deg): 45 Noise: 0.05 Z-axis XZ angle (deg): 60 YZ angle (deg): 30 Noise: 0.05 Estimated DOA (deg): 0 Simulation Workflow and Mathematical Background This simulator demonstrates Direction of Arrival (DOA) estimation using three-axis sensor signals (X, Y, Z), Maximal Ratio Combining (MRC) , and the MUSIC algorithm . It allows interactive control of signal angles and noise for teaching purposes. 1. Signal Generation A pure sinewave signal of frequency f is projected onto three axes using user-defined angles in different planes: X-axis: θ XY , θ XZ Y-axis: θ XY , θ YZ Z-axis: θ XZ , θ YZ Mathematically, for each time sample t : x(t) = s(t) * cos(θ_xy_x) * cos(θ_xz_x) + n_x(t) y(t) = s(t) * sin(θ_xy_y) * cos(θ_yz_y) + n_y(t) z(t) = s(t) * sin(θ_xz_z) * sin(θ_yz_z) + n_z(t) wh...
Read more

Power Spectral Density Calculation Using FFT in MATLAB

📘 📘 Overview 🧮 🧮 Steps to calculate 💻 🧮 MATLAB Codes 📚 📚 Further Reading Power spectral density (PSD) tells us how the power of a signal is distributed across different frequency components, whereas Fourier Magnitude gives you the amplitude (or strength) of each frequency component in the signal. Steps to calculate the PSD of a signal Firstly, calculate the fast Fourier transform (FFT) of a signal. Then, calculate the Fourier magnitude (absolute value) of the signal. Square the Fourier magnitude to get the power spectrum. To calculate the Power Spectral Density (PSD), divide the squared magnitude by the product of the sampling frequency (fs) and the total number of samples (N). Formula: PSD = |FFT|^2 / (fs * N) Sampling frequency (fs): The rate at which the continuous-time signal is sampled (in Hz). ...
Read more

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

MUSIC Algorithm Explained (with MATLAB + Simulator)

Practical Implementation of the MUSIC Algorithm The focus is on how the algorithm works computationally , not just theory, and it explains the denominator (a H E n E n H a) mathematically and intuitively. 1. Introduction The MUSIC (Multiple Signal Classification) algorithm is a high-resolution method used in signal processing and array processing to estimate the Direction of Arrival (DOA) of signals received by a sensor array. Unlike classical beamforming methods, MUSIC uses eigenvector decomposition of the covariance matrix to separate the signal subspace and noise subspace , allowing it to achieve much higher angular resolution. In practical implementations, MUSIC works by: Simulating or collecting array signals Computing the covariance matrix Performing eigenvalue decomposition Separating signal and noise subspaces Scanning possible angles using a steering vector Constructing a pseudo-spectrum where peaks indicate signal directions 2. Signal Mo...
Read more