Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Efficient Computation of the DelayOptimized FiniteLength MMSEDFE

Summary: Efficient Computation of the Delay­Optimized
Finite­Length MMSE­DFE
Naofal Al­Dhahir \Lambda , Member, IEEE, and John M. Cioffi, Senior Member, IEEE
We present new fast algorithms for computing the optimum settings of a finite--length minimum--
mean--square--error decision feedback equalizer (MMSE--DFE) from channel and noise estimates.
These algorithms are based on displacement structure theory [5, 8] and generalize the algorithms of
[2, 1] by including delay optimization. Both symbol--spaced and fractionally--spaced feedforward filters
are considered.
I. Introduction
The minimum--mean--square--error decision feedback equalizer (MMSE--DFE) is a popular receiver
structure on severe--ISI and noise channels [3]. Recently, there has been increased interest in channel--
estimate--based DFEs; as opposed to the more traditional adaptive DFEs; since the former exhibit
undeniable performance advantages over the latter (see [9] and the references therein). This perfor­
mance improvement arises mainly because of the avoidance of the large eigenvalue spread problem
that slows the convergence of LMS--based adaptive DFEs. Channel--estimate--based equalizers were
also demonstrated in [4] to have better tracking performance than least--squares methods. Never­
theless, they have not yet found wide spread application in practice mainly due to the formidable
computational complexity associated with computing the optimum settings of the DFE filters directly
from channel and noise estimates.


Source: Al-Dhahir, Naofal - Department of Electrical Engineering, University of Texas at Dallas


Collections: Engineering