ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models

Som, Pritam and Datta, Tanumay and Srinidhi, N and Chockalingam, A and Rajan, Sundar B (2011) Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models. In: IEEE Journal of Selected Topics in Signal Processing, 5 (8). pp. 1497-1511.

[img] PDF
Low-Complexity.pdf - Published Version
Restricted to Registered users only

Download (2382Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...

Abstract

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov random field (MRF)-based graphical model with pairwise interaction, in conjunction with message damping, and 2) use of factor graph (FG)-based graphical model with Gaussian approximation of interference (GAI). The per-symbol complexities are O(K(2)n(t)(2)) and O(Kn(t)) for the MRF and the FG with GAI approaches, respectively, where K and n(t) denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large Kn(t). From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing Kn(t). Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of M-QAM symbol detection.

Item Type: Journal Article
Additional Information: Copyright 2011 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: Factor graphs;graphical models;large dimensions; low-complexity detection;Markov random fields; multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels;pairwise interaction;severe delay spreads
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 23 Dec 2011 11:38
Last Modified: 23 Dec 2011 11:38
URI: http://eprints.iisc.ernet.in/id/eprint/42845

Actions (login required)

View Item View Item