Abstract

We apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs to this problem is a recent extension. Here we use a factor graph model for the specific estimation problem of equalization and use the sum-product algorithm to obtain the desired estimate. We derive reduced complexity message passing update equations and detail the complexity of the resulting algorithms.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2004
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

Fingerprint

Factor Graph
Equalization
Message passing
Decision Feedback
Factor Models
Graph Model
Message Passing
Gaussian Process
Low Complexity
Feedback
Update
Estimate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Linear equalization via factor graphs. / Drost, Robert J.; Singer, Andrew Carl.

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2004.

Research output: Contribution to journalConference article

@article{3bd3e77599ad41048a8b247a2d88bce3,
title = "Linear equalization via factor graphs",
abstract = "We apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs to this problem is a recent extension. Here we use a factor graph model for the specific estimation problem of equalization and use the sum-product algorithm to obtain the desired estimate. We derive reduced complexity message passing update equations and detail the complexity of the resulting algorithms.",
author = "Drost, {Robert J.} and Singer, {Andrew Carl}",
year = "2004",
month = "10",
day = "20",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Linear equalization via factor graphs

AU - Drost, Robert J.

AU - Singer, Andrew Carl

PY - 2004/10/20

Y1 - 2004/10/20

N2 - We apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs to this problem is a recent extension. Here we use a factor graph model for the specific estimation problem of equalization and use the sum-product algorithm to obtain the desired estimate. We derive reduced complexity message passing update equations and detail the complexity of the resulting algorithms.

AB - We apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs to this problem is a recent extension. Here we use a factor graph model for the specific estimation problem of equalization and use the sum-product algorithm to obtain the desired estimate. We derive reduced complexity message passing update equations and detail the complexity of the resulting algorithms.

UR - http://www.scopus.com/inward/record.url?scp=5044241372&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5044241372&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:5044241372

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -