Skip to main content

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 (aH En EnH 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 Model

Two complex exponential signals are generated as examples:

s1 = exp(1j*2*pi*0.05*t);
s2 = exp(1j*2*pi*0.1*t);

These represent two narrowband sources.

The signals received by the antenna array follow the standard array model:

X = A*S + N

Where:

  • X → received signal matrix
  • A → steering matrix
  • S → source signals
  • N → noise

Each column of A corresponds to a steering vector for one source direction.

3. Steering Vector

For a Uniform Linear Array (ULA), the steering vector is:

steering = exp(-1j*2*pi*d*(0:M-1)'*sin(theta));

Mathematically:

a(θ) = [
1
e^(-j2πd sin(θ))
e^(-j2π 2d sin(θ))
⋮
e^(-j2π (M-1) d sin(θ))
]

This vector represents the phase delays across sensors for a signal arriving from angle θ. Each element corresponds to the response of a specific antenna element.

4. Covariance Matrix

R = (X*X')/N;

Mathematically:

R = E[ X X^H ]

The covariance matrix contains information about:

  • signal correlations
  • noise characteristics
  • spatial structure of the received signals

5. Eigenvalue Decomposition

R = E Λ E^H

Where:

  • E → eigenvectors
  • Λ → eigenvalues

Large eigenvalues correspond to signal components, while smaller ones correspond to noise.

6. Signal and Noise Subspaces

Es = Evec_sorted(:,1:K);
En = Evec_sorted(:,K+1:end);

Key property:

E_n^H a(θ_i) = 0

for true signal directions. This means the steering vector is orthogonal to the noise subspace.

7. MUSIC Spectrum Computation

The pseudo-spectrum used in MUSIC is:

P(θ) = 1 / (a^H(θ) E_n E_n^H a(θ))

Implementation:

Pmusic(i) = 1/(steering'*(En*En')*steering);

8. Meaning of the Denominator

The denominator aH En EnH a measures the energy of the steering vector projected onto the noise subspace. Step by step:

  1. Projection matrix: En EnH projects any vector onto the noise subspace.
  2. Apply to steering vector: EnH a(θ) measures how much the steering vector lies in noise. If θ corresponds to a true signal, EnH a(θ) ≈ 0.
  3. Energy in noise subspace: aH En EnH a = ||P_n a(θ)||² = ||E_n^H a(θ)||².

9. Why Peaks Appear

If the tested angle equals a true signal direction:

E_n^H a(θ) ≈ 0
a^H E_n E_n^H a ≈ 0
P(θ) = 1 / 0 → large peak

These peaks indicate the Direction of Arrival (DOA).

10. Practical Interpretation

The denominator measures how much the steering vector looks like noise:

  • If it looks like noise → denominator large → spectrum small
  • If it looks like signal → denominator small → spectrum peak

MUSIC finds angles where the steering vector is orthogonal to the noise subspace.

11. Angle Scanning

Scan angles (e.g., -90° to 90°). For each angle:

  1. Generate steering vector
  2. Project onto noise subspace
  3. Compute pseudo-spectrum

The result is a spatial spectrum where peaks correspond to signal directions.

12. Final Result

The final plot shows:

  • x-axis → angle
  • y-axis → MUSIC spectrum

Sharp peaks appear at the true source angles.

13. Key Practical Insight

The MUSIC algorithm works because:

  • Signals occupy a low-dimensional subspace
  • Noise occupies the remaining orthogonal subspace
  • Steering vectors of real signals lie orthogonal to the noise space

The denominator aH En EnH a acts as a test measuring whether a steering vector belongs to the signal space or noise space.



Summary

The denominator aH En EnH a measures the projection energy of the steering vector onto the noise subspace, and MUSIC finds angles where this energy is nearly zero, indicating the presence of a signal.

Why Do We Need the Covariance Matrix and Eigen Vectors?

Received signal model:

For an array of M sensors and K narrowband sources:

X = A*S + N

Where:

  • X — M×N received data matrix (N snapshots)
  • A = [a(θ₁), …, a(θK)] — M×K steering matrix
  • S — K×N source signal matrix
  • N — noise, assumed white Gaussian

Covariance Matrix

We compute the sample covariance:

R = (1/N) * X * X^H

Why compute R?

  • R contains all correlations between sensors.
  • It separates the signal subspace (strong eigenvalues) from the noise subspace (small eigenvalues).
  • MUSIC requires eigen decomposition of R to identify the noise subspace.
  • Without R, we cannot identify the direction-independent noise subspace, which is crucial.

2. Eigen-decomposition

Decompose R:

R = E * Λ * E^H

Where:

  • E — eigenvectors
  • Λ — eigenvalues

Sort eigenvalues in descending order:

  • First K eigenvectors → signal subspace Es
  • Remaining M−K eigenvectors → noise subspace En

3. Why the Steering Vector is Orthogonal to Noise Eigenvectors

Key property: For a true signal from angle θi, the steering vector lies exactly in the signal subspace:

a(θ_i) ∈ span(E_s)

Since signal and noise subspaces are orthogonal:

E_s^H * E_n = 0

Thus:

E_n^H * a(θ_i) = 0

Mathematically:

  • E_n * E_n^H — projection onto noise subspace
  • a^H * E_n * E_n^H * a — energy of steering vector projected onto noise

If θ = θi (true signal angle):

E_n^H * a(θ_i) = 0

So the denominator of the MUSIC pseudo-spectrum goes to zero, producing a peak.

 

Further Reading

  1. 1. MATLAB Code for MUSIC 
  2. 2. Interactive MUSIC Simulator (Web-based)


Contact Us

Name

Email *

Message *

Popular Posts

CMOS Logic Gates: Inverter, NAND, and NOR

CMOS Logic Gates: Inverter, NAND, and NOR Complementary metal–oxide–semiconductor (CMOS) technology forms the backbone of modern digital IC design. Patented by Frank Wanlass in 1963 ( US patent 3,356,858 ), CMOS enables low-power, high-speed, and noise-immune logic circuits. CMOS gates, including inverters, NAND, and NOR, are widely used in both large-scale and small-scale integrated circuits due to their efficiency and versatility. CMOS Inverter A CMOS inverter consists of a complementary pair of PMOS and NMOS transistors. The PMOS transistor connects to the supply voltage V DD , while the NMOS connects to ground. The input voltage V IN controls both gates, and the output voltage V OUT is taken from the connected drains. CMOS inverters are highly energy-efficient and produce minimal heat due to their comple...

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

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

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 →

Design of CMOS XOR/XNOR Gates

Design of CMOS XOR/XNOR Gates The semiconductor industry has experienced rapid integration of multimedia applications into mobile electronics, leading to very high integration density in CMOS VLSI. As operating frequencies increase, power consumption, speed, silicon area, and reliability become critical considerations. The XOR-XNOR circuits are fundamental building blocks in arithmetic circuits (Full Adders, Multipliers), compressors, comparators, parity checkers, code converters, error-detecting/correcting codes, and phase detectors. Their performance directly impacts the complex circuits they are used in. Design goals include full output voltage swing, low power consumption, reduced transistor count, minimal delay, and simultaneous non-skewed outputs. Static Logic (Static CMOS) Stat...

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