Skip to main content

Function of a Decision Feedback Equalizer (DFE) Equalizer (with MATLAB)

 

Decision Feedback Equalizer is the abbreviation for this. We know that in a typical wireless communication scenario, different multipath cause the signal to arrive at the receiver at different times after transmitting it from the transmitter. Our signal may show a slight spatial frequency shift as a result. By using several taps to receive signals with varying time delays or signals with a slight frequency shift, equalizers solve this problem by changing their tap weights.

Decision feedback equalizers continuously update their tap coefficient vectors by reducing the error between the desired signal and adaptive filter output.

Inter-symbol interference (ISI) happens in a typical wireless communication system when the modulation bandwidth exceeds the radio channel's coherence bandwidth. Equalization reduces the ISI produced by multipath within a time-dispersive channel.

** Coherence bandwidth is the bandwidth (range of frequencies) over which the channel is constant is called coherence bandwidth

Both feed-forward taps and feed-backward taps are used in a DFE equalizer. 

'Input' - Input signal, specified as a column vector
'Desired' - Training symbols (column vector). The vector length of the desired must be less than or equal to the length of the input.
'Train' - Train equalizer flag. It starts training when the value changes from 0 to 1.
'Error' - Error signal (column vector)
'Weight' - Tap weights

The error between the feedforward and feedback signal is used to adjust the tap weights. To recover the original signal, it also converges the tap weights. DFE uses an adaptive algorithm at the receiver side to track the changing channel and modifies the weight of its filter to recover the known pilot signal most of the time. The data bits are then appropriately corrected. Pilot signals are provided at short intervals and are known to the receiver to track the communication channel or medium's frequently changing characteristics.

 


QPSK + Multipath + Decision Feedback Equalizer (DFE)

20 BER Before: 0 | BER After: 0

Simulator Workflow & Mathematics

1 The Signal Path

  1. QPSK Modulation Random bits are grouped into pairs and mapped to complex symbols: s = exp(j * (π/4 + kπ/2)).
  2. Multipath Channel The signal is convolved with a multi-tap impulse response, simulating reflections that cause Inter-Symbol Interference (ISI).
  3. DFE Equalization A Feedforward Filter (FFF) suppresses precursor ISI, while a Feedback Filter (FBF) subtracts post-cursor ISI using previous symbol decisions.

2 The DFE Equations

// 1. Equalizer Output

y[n] = Σ(w_f[k] * x[n-k]) - Σ(w_b[k] * d[n-k])

(Feedforward Output - Feedback Correction)

// 2. Error Calculation

e[n] = d_known[n] - y[n]

// 3. LMS Weight Update

w_f[k] = w_f[k] + μ * e[n] * x*[n-k]

w_b[k] = w_b[k] - μ * e[n] * d*[n-k-1]

Where μ is the step size, x* is the conjugate of the received signal, and d are previous decisions.

Also read about

[2] Adaptive Equalizer to mitigate Channel Distortion (in MATLAB)

[3] Roll of an Equalizer in Channel Estimation




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

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

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