Low-complexity MIMO detection based on belief propagation over pairwise graphs

Seokhyun Yoon, Chan-Byoung Chae

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

This paper considers a belief propagation algorithm over pairwise graphical models to develop low-complexity iterative multiple-input multiple-output (MIMO) detectors. The pairwise graphical model is a bipartite graph where a pair of variable nodes are related by an observation node represented by the bivariate Gaussian function obtained by marginalizing the posterior joint probability density under the Gaussian input assumption. Specifically, we consider two types of pairwise models: the fully connected and ring-type. The pairwise graphs are sparse, compared with the conventional graphical model introduced by Bickson et al., insofar as the number of edges connected to an observation node (edge degree) is only two. Consequently, the computations are much easier than those of maximum likelihood (ML) detection, which are similar to the belief propagation (BP) that is run over the fully connected bipartite graph. The link level performance for non-Gaussian input is evaluated via simulations, and the results show the validity of the proposed algorithms. We also customize the algorithm with Gaussian input assumption to obtain the Gaussian BP run over the two pairwise graphical models, and for the ring-type, we prove its convergence to the linear minimum mean square error (MMSE) estimates. Since the maximum a posterior (MAP) estimator for Gaussian input is equivalent to the linear MMSE estimator, it shows the optimality of the scheme for Gaussian input.

Original languageEnglish
Article number6665044
Pages (from-to)2363-2377
Number of pages15
JournalIEEE Transactions on Vehicular Technology
Volume63
Issue number5
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Belief Propagation
Multiple-input multiple-output (MIMO)
Low Complexity
Graphical Models
Pairwise
Graph in graph theory
Minimum Mean Square Error
Bipartite Graph
Mean square error
Vertex of a graph
Maximum Likelihood Detection
Ring
Gaussian Function
Error Estimator
Probability Density
Maximum likelihood
Connected graph
Error Estimates
Optimality
Detector

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{0231cd0503204ef0bbd59a6e4c0d72fd,
title = "Low-complexity MIMO detection based on belief propagation over pairwise graphs",
abstract = "This paper considers a belief propagation algorithm over pairwise graphical models to develop low-complexity iterative multiple-input multiple-output (MIMO) detectors. The pairwise graphical model is a bipartite graph where a pair of variable nodes are related by an observation node represented by the bivariate Gaussian function obtained by marginalizing the posterior joint probability density under the Gaussian input assumption. Specifically, we consider two types of pairwise models: the fully connected and ring-type. The pairwise graphs are sparse, compared with the conventional graphical model introduced by Bickson et al., insofar as the number of edges connected to an observation node (edge degree) is only two. Consequently, the computations are much easier than those of maximum likelihood (ML) detection, which are similar to the belief propagation (BP) that is run over the fully connected bipartite graph. The link level performance for non-Gaussian input is evaluated via simulations, and the results show the validity of the proposed algorithms. We also customize the algorithm with Gaussian input assumption to obtain the Gaussian BP run over the two pairwise graphical models, and for the ring-type, we prove its convergence to the linear minimum mean square error (MMSE) estimates. Since the maximum a posterior (MAP) estimator for Gaussian input is equivalent to the linear MMSE estimator, it shows the optimality of the scheme for Gaussian input.",
author = "Seokhyun Yoon and Chan-Byoung Chae",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TVT.2013.2291245",
language = "English",
volume = "63",
pages = "2363--2377",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

Low-complexity MIMO detection based on belief propagation over pairwise graphs. / Yoon, Seokhyun; Chae, Chan-Byoung.

In: IEEE Transactions on Vehicular Technology, Vol. 63, No. 5, 6665044, 01.01.2014, p. 2363-2377.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Low-complexity MIMO detection based on belief propagation over pairwise graphs

AU - Yoon, Seokhyun

AU - Chae, Chan-Byoung

PY - 2014/1/1

Y1 - 2014/1/1

N2 - This paper considers a belief propagation algorithm over pairwise graphical models to develop low-complexity iterative multiple-input multiple-output (MIMO) detectors. The pairwise graphical model is a bipartite graph where a pair of variable nodes are related by an observation node represented by the bivariate Gaussian function obtained by marginalizing the posterior joint probability density under the Gaussian input assumption. Specifically, we consider two types of pairwise models: the fully connected and ring-type. The pairwise graphs are sparse, compared with the conventional graphical model introduced by Bickson et al., insofar as the number of edges connected to an observation node (edge degree) is only two. Consequently, the computations are much easier than those of maximum likelihood (ML) detection, which are similar to the belief propagation (BP) that is run over the fully connected bipartite graph. The link level performance for non-Gaussian input is evaluated via simulations, and the results show the validity of the proposed algorithms. We also customize the algorithm with Gaussian input assumption to obtain the Gaussian BP run over the two pairwise graphical models, and for the ring-type, we prove its convergence to the linear minimum mean square error (MMSE) estimates. Since the maximum a posterior (MAP) estimator for Gaussian input is equivalent to the linear MMSE estimator, it shows the optimality of the scheme for Gaussian input.

AB - This paper considers a belief propagation algorithm over pairwise graphical models to develop low-complexity iterative multiple-input multiple-output (MIMO) detectors. The pairwise graphical model is a bipartite graph where a pair of variable nodes are related by an observation node represented by the bivariate Gaussian function obtained by marginalizing the posterior joint probability density under the Gaussian input assumption. Specifically, we consider two types of pairwise models: the fully connected and ring-type. The pairwise graphs are sparse, compared with the conventional graphical model introduced by Bickson et al., insofar as the number of edges connected to an observation node (edge degree) is only two. Consequently, the computations are much easier than those of maximum likelihood (ML) detection, which are similar to the belief propagation (BP) that is run over the fully connected bipartite graph. The link level performance for non-Gaussian input is evaluated via simulations, and the results show the validity of the proposed algorithms. We also customize the algorithm with Gaussian input assumption to obtain the Gaussian BP run over the two pairwise graphical models, and for the ring-type, we prove its convergence to the linear minimum mean square error (MMSE) estimates. Since the maximum a posterior (MAP) estimator for Gaussian input is equivalent to the linear MMSE estimator, it shows the optimality of the scheme for Gaussian input.

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

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

U2 - 10.1109/TVT.2013.2291245

DO - 10.1109/TVT.2013.2291245

M3 - Article

VL - 63

SP - 2363

EP - 2377

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 5

M1 - 6665044

ER -