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

Nithin Raveendran, Shayan G. Srinivasa, Bane Vasić

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication55th Annual International Telemetering Conference, ITC 2019
Subtitle of host publicationCultivating the Next Generation of Range Engineers
PublisherInternational Foundation for Telemetering
Pages85-94
Number of pages10
ISBN (Electronic)9781713801887
StatePublished - 2019
Event55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019 - Las Vegas, United States
Duration: Oct 21 2019Oct 24 2019

Publication series

NameProceedings of the International Telemetering Conference
Volume55
ISSN (Print)0884-5123

Conference

Conference55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019
CountryUnited States
CityLas Vegas
Period10/21/1910/24/19

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Electrical and Electronic Engineering
  • Instrumentation

Fingerprint Dive into the research topics of 'An improved log-domain belief propagation algorithm over graphs with short cycles'. Together they form a unique fingerprint.

Cite this