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

2D Linear Detector Based on Generalized Belief Propagation Algorithm

Matcha, CK and Garani, SS (2019) 2D Linear Detector Based on Generalized Belief Propagation Algorithm. In: 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, 2-5 October 2018, Allerton Park and Retreat CenterMonticello; United States, pp. 981-988.

[img] PDF
56th_Ann_All_Con_981-988_2019.pdf - Published Version
Restricted to Registered users only

Download (373kB) | Request a copy
Official URL: https://doi.org/10.1109/ALLERTON.2018.8636002


Various ideas have been borrowed from 1D inter symbol interference (ISI) detectors towards approximation of near maximum likelihood (ML) detection over 2D ISI channels. Generalized belief propagation (GBP) algorithm is a graph based algorithm different from these algorithms and is observed to give the best bit error rate (BER) performance by minimizing KL-distance metric. GBP algorithm passes messages between regions instead of messages between nodes in an iterative fashion. However, GBP algorithm has a very high computational complexity and is not suitable for practical deployment. In this paper, we propose a GBP based signal detection algorithm using a quadratic approximation of the KL-distance metric. This allows us to minimize the cost function by solving a set of linear equations i.e., obtain a one shot solution instead of the iterative message passing in the GBP algorithm. We also provide an intuition into the nature of the hard decisions given by the algorithm. The idea opens up various approximations of the GBP algorithm using different convex approximations of the cost function with the desired nature of obtaining the solution. We show the efficacy of the proposed algorithm by detecting 5�5 pages of binary data over a chosen channel with 3�3 ISI span. The quadratic approximation is observed to give 1.5 dB inferior performance in signal-to-noise ratio (SNR) as compared to the GBP algorithm. © 2018 IEEE.

Item Type: Conference Paper
Publication: 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: Copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords: Bit error rate; Cost functions; Graphic methods; Intersymbol interference; Iterative methods; Maximum likelihood; Message passing; Signal detection; Signal to noise ratio, Bit error rate (BER) performance; Generalized belief propagation; Generalized belief propagation algorithms; Graph-based algorithms; Iterative message passing; Maximum-likelihood detection; Quadratic approximation; Signal detection algorithm, Approximation algorithms
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited: 09 Apr 2019 05:34
Last Modified: 09 Apr 2019 05:34
URI: http://eprints.iisc.ac.in/id/eprint/62162

Actions (login required)

View Item View Item