Skip to main content

Adaptive Equalizer to mitigate Channel Distortion - in MATLAB

 

Adaptive equalizer adjusts its parameters based on the characteristics of the communication channel. It uses adaptive algorithms to continuously estimate and correct for channel distortion, aiming to minimize errors in the received signal. Adaptive equalizers are versatile and effective in varying channel conditions.

 

MATLAB Code

clc;
clear;
close all;

% Parameters
N = 100000; % 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_range = -20:1:20; % SNR range in dB
ber = zeros(length(SNR_range), 1); % Initialize BER array

% Generate a random signal
original_signal = randi([0, 1], N, 1) * 2 - 1; % Bipolar signal (-1, 1)

% Channel impulse response
h = [0.8, 0.5, 0.2];

% Loop over SNR values
for snr_idx = 1:length(SNR_range)
    SNR = SNR_range(snr_idx); % Current SNR value
    
    % Pass the signal through the channel
    received_signal = filter(h, 1, original_signal);
    
    % Add some noise
    received_signal = 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(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
    
    % Decode the equalized signal using threshold 0
    decoded_signal = equalized_signal > 0;
    decoded_signal = decoded_signal * 2 - 1; % Convert from (0, 1) to (-1, 1)
    
    % Calculate BER
    num_errors = sum(original_signal ~= decoded_signal);
    ber(snr_idx) = num_errors / N;
end

% Plot BER vs SNR
figure;
semilogy(SNR_range, ber, 'b-o');
xlabel('SNR (dB)');
ylabel('Bit Error Rate (BER)');
title('BER vs SNR');
grid on;
 

Output


 Fig 1: BER vs SNR for Adaptive Equalizer (to mitigate the channel distortion)


Copy the Code from here



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

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

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} \] ...

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 →

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):