Fast algorithm for finite-length MMSE equalizers with application to discrete multitone systems

Navid Lashkarian, Sayfe Kiaei

Research output: Chapter in Book/Report/Conference proceedingChapter

7 Scopus citations

Abstract

This paper presents a new, fast algorithm for finite-length minimum mean square error (MMSE) equalizers. The research exploits asymptotic equivalence of Toeplitz and circuit matrices to estimate Hessian matrix of a quadratic form. Research shows that the Hessian matrix exhibits a specific structure. As a result, when combined with the Rayleigh minimization algorithm, it provides an efficient method to obtain the global minimum of constrained optimization problem. A salient feature of this algorithm is that extreme eigenvector of the Hessian matrix can be obtained without direct computation of the matrix. In comparison to the previous methods, the algorithm is more computationally efficient and highly parallelizable, which makes the algorithm more attractive for real time applications. The algorithm is applied for equalization of discrete multitone (DMT) systems for asynchronous digital subscriber line (ADSL) applications.

Original languageEnglish (US)
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
PublisherIEEE
Pages2753-2756
Number of pages4
Volume5
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-99) - Phoenix, AZ, USA
Duration: Mar 15 1999Mar 19 1999

Other

OtherProceedings of the 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-99)
CityPhoenix, AZ, USA
Period3/15/993/19/99

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Acoustics and Ultrasonics

Fingerprint

Dive into the research topics of 'Fast algorithm for finite-length MMSE equalizers with application to discrete multitone systems'. Together they form a unique fingerprint.

Cite this