Factor Graph Based LMMSE Filtering for Colored Gaussian Processes
We propose a reduced complexity, graph based linear minimum mean square error (LMMSE) filter in which the non-white statistics of a random noise process are taken into account. Our method corresponds to block LMMSE filtering, and has the advantage of complexity linearly increasing with the block len...
Gespeichert in:
Veröffentlicht in: | IEEE signal processing letters 2014-10, Vol.21 (10), p.1206-1210 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We propose a reduced complexity, graph based linear minimum mean square error (LMMSE) filter in which the non-white statistics of a random noise process are taken into account. Our method corresponds to block LMMSE filtering, and has the advantage of complexity linearly increasing with the block length and the ease of incorporating the a priori information of the input signals whenever possible. The proposed method can be used with any random process with a known autocorrelation function by use of an approximation to an autoregressive (AR) process. We show through extensive simulations that our method performs identical with the optimal block LMMSE filtering for Gaussian input signals. |
---|---|
ISSN: | 1070-9908 1558-2361 |
DOI: | 10.1109/LSP.2014.2330630 |