A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

Raveendran, Nithin and Srinivasa, Shayan Garani (2014) A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles. In: IEEE International Symposium on Information Theory (ISIT), JUN 29-JUL 04, 2014, Honolulu, HI, pp. 2619-2623.

PDF iee_int_sym_inf_the_2619_2014.pdf - Published Version Restricted to Registered users only Download (419kB) | Request a copy

Abstract

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belongs to the IEEE International Symposium on Information Theory (ISIT), Honolulu, HI, JUN 29-JUL 04, 2014
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	05 Mar 2015 12:57
Last Modified:	05 Mar 2015 12:57
URI:	http://eprints.iisc.ac.in/id/eprint/51013

Actions (login required)

View Item