Skip to main content

Equalizer to reduce Multi-path Effects using MATLAB

 

Steps

1. Convert Bit Stream to Bipolar Format. Converts the bit stream from binary (0, 1) to bipolar format (-1, 1).

2. Define Channel Impulse Response

3. Pass Signal Through the Channel. Convolves the bipolar signal with the channel impulse response to simulate the channel effect.

4. Adds Gaussian noise to the received signal based on the specified SNR.

5. Initialize Adaptive Filter Parameters. 

  • w: Initializes the adaptive filter coefficients.
  • x_buf: Initializes the buffer for the input to the adaptive filter.
  • equalized_signal: Initializes the array to store the equalized signal.
  • P: Initializes the inverse correlation matrix.

    • 6. Adaptive Equalization Using RLS Algorithm

    Loops through each sample to perform adaptive equalization:

    • Update Input Buffer: Adds the current sample to the input buffer.
    • Calculate Gain Vector: Computes the gain vector k for the adaptive filter.
    • Calculate Error Signal: Computes the error between the original signal and the filter output.
    • Update Filter Coefficients: Updates the adaptive filter coefficients based on the error signal.
    • Update Inverse Correlation Matrix: Updates the inverse correlation matrix for the RLS algorithm.
    • Store Equalized Output: Stores the equalized signal in the output array.

    7. Plot Original and Equalized Signals 

     

    MATLAB Script

    clc;
    clear;
    close all;

    % Parameters
    bit_stream = [1, 1, 0, 0, 1, 0, 1, 1, 1, 0]; % Original bit stream
    N = length(bit_stream); % Number of samples
    filter_order = 10; % Order of the adaptive filter
    lambda = 0.99; % Forgetting factor for RLS algorithm
    delta = 1; % Initial value for the inverse correlation matrix
    SNR = 15; % SNR value in dB

    % Convert bit stream to bipolar format (-1, 1)
    original_signal = bit_stream * 2 - 1;

    % Channel impulse response
    h = [0.75, 0.05, 0.02];

    % Pass the signal through the channel
    received_signal = filter(h, 1, original_signal);

    % Add some noise
    received_signal_noisy = awgn(received_signal, SNR, 'measured');

    % Initialize the adaptive filter coefficients
    w = zeros(filter_order, 1);

    % Initialize buffer for the input to the adaptive filter
    x_buf = zeros(filter_order, 1);

    % Initialize output
    equalized_signal = zeros(N, 1);

    % Initialize the inverse correlation matrix
    P = delta * eye(filter_order);

    % Adaptive equalization using RLS
    for n = 1:N
        % Update the input buffer
        x_buf = [received_signal_noisy(n); x_buf(1:end-1)];

        % Calculate the gain vector
        k = (P * x_buf) / (lambda + x_buf' * P * x_buf);

        % Calculate the error signal
        e = original_signal(n) - w' * x_buf;

        % Update the filter coefficients
        w = w + k * e;

        % Update the inverse correlation matrix
        P = (P - k * x_buf' * P) / lambda;

        % Store the equalized output
        equalized_signal(n) = w' * x_buf;
    end

    % Plot original and equalized signals
    figure;
    subplot(2, 1, 1);
    stem(original_signal, 'filled');
    title('Original Signal');
    xlabel('Sample Index');
    ylabel('Amplitude');
    grid on;

    subplot(2, 1, 2);
    stem(equalized_signal, 'filled');
    title('Equalized Signal');
    xlabel('Sample Index');
    ylabel('Amplitude');
    grid on;
     

    Output


     

    Copy the MATLAB Code from here

     

    Further Reading

    📊 MATLAB & ONLINE SIMULATIONS
    🎓 GATE SOLUTIONS
    📡 WIRELESS & THEORY

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

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

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

    FM Bandwidth and FM Band Explained

    FM radio uses the frequency band from 88 MHz to 108 MHz , which is a 20 MHz-wide spectrum . This is the range of carrier frequencies available to stations. 108 MHz − 88 MHz = 20 MHz However, a single FM station occupies only about 200 kHz . This is the bandwidth of the modulated FM signal. 1. Why One FM Station Needs ~200 kHz FM uses frequency modulation . The bandwidth depends on how far the carrier swings. Carson's Rule gives the approximate FM bandwidth: B = 2 ( Δf + f m ) ...
    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

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

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