An improved log-domain belief propagation algorithm over graphs with short cycles

Raveendran, N and Srinivasa, SG and Vasic, B (2019) An improved log-domain belief propagation algorithm over graphs with short cycles. In: 55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019, 21-24 October 2019, Las Vegas; United States, pp. 85-94.

PDF pro_int_tel_con_55_85-94_2019.pdf Restricted to Registered users only Download (529kB) | Request a copy

Abstract

We present a modified belief propagation (BP) algorithm for decoding low density parity check codes having graphs with short cycles. The modified algorithm in log domain is superior in terms of numerical stability, precision, computational complexity and ease of implementation when compared to the algorithm in the probability domain. Simulation results show improvement in decoding performance for the modified BP compared to the original algorithm. The modified approach is also generalized for graphs with isolated cycles of arbitrary length by considering the statistical dependency among messages passed in such cycles. © 2019 International Foundation for Telemetering. All rights reserved.

Item Type:	Conference Paper
Publication:	Proceedings of the International Telemetering Conference
Publisher:	International Foundation for Telemetering
Additional Information:	The copyright of this article belongs to International Foundation for Telemetering
Keywords:	Channel coding; Decoding; Graph theory, Belief propagation algorithm; Decoding performance; Log-domain; Low-density parity-check (LDPC) codes; Modified algorithms; Original algorithms; Short cycle; Statistical dependencies, Graph algorithms
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	16 Nov 2020 04:46
Last Modified:	30 Aug 2022 07:01
URI:	https://eprints.iisc.ac.in/id/eprint/66715

Actions (login required)

View Item