### 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 language | English (US) |
---|---|

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

State | Published - Oct 20 2004 |

Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |

### Fingerprint

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

Research output: Contribution to journal › Conference article

}

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 -