Exact and Approximated Factor Graph Methods for MIMO Detection

Bernhard Etzlinger; Werner Haselmayr; Andreas Springer

Exact and Approximated Factor Graph Methods for MIMO Detection

Department of Communications Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Abstract

Factor graphs (FG) are a tool to derive efficient algorithms for complex systems by graphically displaying the structure of the mathematical model. The construction of the graph and the choice of the messages which are passed over its edges significantly determine the derived algorithm. In our work we show the application of a FG to a MIMO detector and the derivation of three different algorithms by applying different message passing methods, such as an exact, an exact relaxed and a particle algorithm. Further on, we discuss the bit error performance depending on message passing methods and the computational complexity depending on message representation and graph construction.

Original language	English
Title of host publication	Proc. of the JNCW 2011 - NEWCOM++/COST 2100 joint Workshop
Number of pages	6
Publication status	Published - Mar 2011

Fields of science

202037 Signal processing

JKU Focus areas

Mechatronics and Information Processing

Cite this

@inproceedings{88a543bc855440799f1a247e7ddb8c60,

title = "Exact and Approximated Factor Graph Methods for MIMO Detection",

abstract = "Factor graphs (FG) are a tool to derive efficient algorithms for complex systems by graphically displaying the structure of the mathematical model. The construction of the graph and the choice of the messages which are passed over its edges significantly determine the derived algorithm. In our work we show the application of a FG to a MIMO detector and the derivation of three different algorithms by applying different message passing methods, such as an exact, an exact relaxed and a particle algorithm. Further on, we discuss the bit error performance depending on message passing methods and the computational complexity depending on message representation and graph construction.",

author = "Bernhard Etzlinger and Werner Haselmayr and Andreas Springer",

year = "2011",

month = mar,

language = "English",

booktitle = "Proc. of the JNCW 2011 - NEWCOM++/COST 2100 joint Workshop",

}

TY - GEN

T1 - Exact and Approximated Factor Graph Methods for MIMO Detection

AU - Etzlinger, Bernhard

AU - Haselmayr, Werner

AU - Springer, Andreas

PY - 2011/3

Y1 - 2011/3

N2 - Factor graphs (FG) are a tool to derive efficient algorithms for complex systems by graphically displaying the structure of the mathematical model. The construction of the graph and the choice of the messages which are passed over its edges significantly determine the derived algorithm. In our work we show the application of a FG to a MIMO detector and the derivation of three different algorithms by applying different message passing methods, such as an exact, an exact relaxed and a particle algorithm. Further on, we discuss the bit error performance depending on message passing methods and the computational complexity depending on message representation and graph construction.

AB - Factor graphs (FG) are a tool to derive efficient algorithms for complex systems by graphically displaying the structure of the mathematical model. The construction of the graph and the choice of the messages which are passed over its edges significantly determine the derived algorithm. In our work we show the application of a FG to a MIMO detector and the derivation of three different algorithms by applying different message passing methods, such as an exact, an exact relaxed and a particle algorithm. Further on, we discuss the bit error performance depending on message passing methods and the computational complexity depending on message representation and graph construction.

UR - http://www.newcom-project.eu/jncw2011/jncw-2011-newcom-cost-2100-joint-workshop

M3 - Conference proceedings

BT - Proc. of the JNCW 2011 - NEWCOM++/COST 2100 joint Workshop

ER -

Exact and Approximated Factor Graph Methods for MIMO Detection

Abstract

Fields of science

JKU Focus areas

Other files and links

Cite this