Skip to main content

Power Spectral Density Calculation Using FFT in MATLAB


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

  1. Firstly, calculate the fast Fourier transform (FFT) of a signal.
  2. Then, calculate the Fourier magnitude (absolute value) of the signal.
  3. Square the Fourier magnitude to get the power spectrum.
  4. 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).
Total number of samples (N): The number of samples in the time-domain signal used for the DFT/FFT.

Suppose:
    Sampling frequency = 1000 Hz
    Number of samples = 500
Then the frequency resolution is:
Δf = 1000 / 500 = 2 Hz
This means the FFT result will contain frequency components spaced 2 Hz apart: 0 Hz, 2 Hz, 4 Hz, ..., up to fs.

  • Increasing the number of samples (N) → improves frequency resolution
  • Increasing the sampling frequency (fs) → worsens frequency resolution, but increases the total frequency range analyzed (Nyquist limit)

MATLAB Script

matlab_script.m

% The code is written by SalimWireless.com
clear
close all
clc

fs = 1000; % sampling frequency
T = 1; % total recording time
L = T .* fs; % signal length
tt = (0:L-1)/fs; % time vector
ff = (0:L-1)*fs/L;
y = sin(2*pi*50 .* tt) + sin(2*pi*80 .* tt); y = y(:); % reference sinusoid

% Allow user to input SNR in dB
snr_db = input('Enter the SNR (in dB): '); % User input for SNR
snr_linear = 10^(snr_db / 10); % Convert SNR from dB to linear scale

% Calculate noise variance based on SNR
signal_power = mean(y.^2); % Calculate signal power
noise_variance = signal_power / snr_linear; % Calculate noise variance

% Multiply by standard deviation (sqrt of variance) for correct noise power
x = sqrt(noise_variance)*randn(L,1) + y; x = x(:); % sinusoid with additive Gaussian noise

% Plot results
figure

% Time-domain plot of the original signal
subplot(311)
plot(tt, y,'r')
title('Original Message signal sin(2Ï€ * 50)t + sin(2Ï€ * 80)t (Time Domain)')
legend('Original signal')
xlabel('Time (s)')
ylabel('Amplitude')

% Manual Power Spectral Density plots
subplot(312)
[psd_y, f_y] = manualPSD(y, fs); % PSD of the original signal
plot(f_y,10*log10(psd_y),'r')
title('Power Spectral Density')
legend('Original signal PSD')
xlabel('Frequency (Hz)')
ylabel('Power/Frequency (dB/Hz)')

% Manual Power Spectral Density plots
subplot(313)
[psd_x, f_x] = manualPSD(x, fs); % PSD of the noisy signal
plot(f_x,10*log10(psd_x),'k')
title('Power Spectral Density')
legend('Noisy signal PSD')
xlabel('Frequency (Hz)')
ylabel('Power/Frequency (dB/Hz)')
web('https://www.salimwireless.com/search?q=psd%20fourier%20transform', '-browser'); 

% Manual Periodogram PSD calculation function
function [psd, f] = manualPSD(signal, fs)
 N = length(signal); % Signal length
 fft_signal = fft(signal); % FFT of the signal
 fft_signal = fft_signal(1:N/2+1); % Take only the positive frequencies
 psd = (1/(fs*N)) * abs(fft_signal).^2; % Compute the power spectral density
 psd(2:end-1) = 2*psd(2:end-1); % Adjust the PSD for the one-sided spectrum
 f = (0:(N/2))*fs/N; % Frequency vector
end

Output

Power Spectral Density Periodogram output plot

Power Spectral Density output visualization

Interactive PSD Simulator

Experiment with signal parameters and visualize the Power Spectral Density in real-time below.

Parameters


Base Signal



Input Signal

Magnitude Plot

Phase Plot



10
rectangular


Contact Us

Name

Email *

Message *

Popular Posts

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 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 2026 - Question Paper Download PDF June 202...

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

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Interactive Rayleigh Fading Simulator Want to see Rayleigh fading in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

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): Interactive AM Demodulation Online Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Interactive AM Power Simulator Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

Theoretical BER vs SNR for binary ASK, FSK, and PSK (with MATLAB Code + Simulator)

📘 Overview & Theory 🧮 MATLAB Codes 🧮 Q-function 📚 Further Reading Bit Error Rate (BER) Equations In ASK, noise directly affects the signal amplitude, making it the most vulnerable since the data is carried in amplitude changes. In FSK, data is represented by frequency variations, and because noise typically impacts amplitude more than frequency, FSK is more robust than ASK. In PSK, data is encoded in the signal phase, and BPSK specifically uses 180-degree phase shifts, creating the greatest separation between signal points and therefore achieving the lowest bit error rate (BER) for the same power level. BER formulas for ASK, FSK, and PSK modulation schemes. ASK BER = 0.5 × erfc(0.5 × √SNR) FSK BER = 0.5 × erfc(√(SNR / 2)) PSK BER = 0.5 × erfc(√SNR) ...

Chirp Signal Simulator

Chirp Signal Simulator Starting Frequency (Hz) Ending Frequency (Hz) Amplitude phase Up-Chirp (unchecked = Down-Chirp) Generate Chirp Demodulate Return to DSP Simulations Main Page →

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. 📘 Overview 🧮 Simulator ⚖️ Theory 📈 Q-function 📚 Resources BASK Modulation Transmits one of two signals: 0 or $\sqrt{E_b}$, representing binary 0 and 1. Simple but sensitive to noise. BFSK Modulation Transmits one of two signals: $\sqrt{E_b}$ on the Y-axis or $\sqrt{E_b}$ on the X-axis. These are orthogonal signals. BPSK Modulation Transmits $+\sqrt{E_b}$ or $-\sqrt{E_b}$ (antipodal signaling). Most efficient binary scheme. ...

Linear vs Circular Convolution

Linear vs Circular Convolution Linear convolution vs circular convolution Linear convolution (what nature does) If: x[n] = transmitted signal h[n] = channel impulse response (multipath) Then the received signal is: y[n] = x[n] * h[n] This means: Past symbols spill into future symbols Causes inter-symbol interference (ISI) DFT of y[n] is not a simple product Circular convolution (what DFT assumes) The DFT assumes periodic signals : y[n] = x[n] ⊛ h[n], where indices wrap around modulo N Only under circular convolution does the DFT satisfy: Y[k] = X[k] · H[k] This is what enables one-tap frequency-domain equalization . What happens in the real channel (linear convolution) The channel performs linear convolution: y[n] = Σ l=0 Lh−1 h[l] x[n-l] But because: CP absorbs the “spillover” Receiver discards CP before DFT The useful part of the received symbol becomes: y[n] = Σ l=0 Lh−1 h[l] x[(n-l) mod N] Modulo inde...