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

Nithin Raveendran; Shayan G. Srinivasa; Bane Vasić

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 proceeding › Conference 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 language	English (US)
Title of host publication	55th Annual International Telemetering Conference, ITC 2019
Subtitle of host publication	Cultivating the Next Generation of Range Engineers
Publisher	International Foundation for Telemetering
Pages	85-94
Number of pages	10
ISBN (Electronic)	9781713801887
State	Published - 2019
Event	55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019 - Las Vegas, United States Duration: Oct 21 2019 → Oct 24 2019

Publication series

Name	Proceedings of the International Telemetering Conference
Volume	55
ISSN (Print)	0884-5123

Conference

Conference	55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019
Country/Territory	United States
City	Las Vegas
Period	10/21/19 → 10/24/19

ASJC Scopus subject areas

Computer Networks and Communications
Signal Processing
Electrical and Electronic Engineering
Instrumentation

Cite this

Raveendran, N., Srinivasa, S. G., & Vasić, B. (2019). An improved log-domain belief propagation algorithm over graphs with short cycles. In 55th Annual International Telemetering Conference, ITC 2019: Cultivating the Next Generation of Range Engineers (pp. 85-94). (Proceedings of the International Telemetering Conference; Vol. 55). International Foundation for Telemetering.

An improved log-domain belief propagation algorithm over graphs with short cycles. / Raveendran, Nithin; Srinivasa, Shayan G.; Vasić, Bane.
55th Annual International Telemetering Conference, ITC 2019: Cultivating the Next Generation of Range Engineers. International Foundation for Telemetering, 2019. p. 85-94 (Proceedings of the International Telemetering Conference; Vol. 55).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Raveendran, N, Srinivasa, SG & Vasić, B 2019, An improved log-domain belief propagation algorithm over graphs with short cycles. in 55th Annual International Telemetering Conference, ITC 2019: Cultivating the Next Generation of Range Engineers. Proceedings of the International Telemetering Conference, vol. 55, International Foundation for Telemetering, pp. 85-94, 55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019, Las Vegas, United States, 10/21/19.

Raveendran, Nithin ; Srinivasa, Shayan G. ; Vasić, Bane. / An improved log-domain belief propagation algorithm over graphs with short cycles. 55th Annual International Telemetering Conference, ITC 2019: Cultivating the Next Generation of Range Engineers. International Foundation for Telemetering, 2019. pp. 85-94 (Proceedings of the International Telemetering Conference).

@inproceedings{b823911171c145569e5b340608e8b865,

title = "An improved log-domain belief propagation algorithm over graphs with short cycles",

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.",

author = "Nithin Raveendran and Srinivasa, {Shayan G.} and Bane Vasi{\'c}",

note = "Publisher Copyright: {\textcopyright} 2019 International Foundation for Telemetering. All rights reserved.; 55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019 ; Conference date: 21-10-2019 Through 24-10-2019",

year = "2019",

language = "English (US)",

series = "Proceedings of the International Telemetering Conference",

publisher = "International Foundation for Telemetering",

pages = "85--94",

booktitle = "55th Annual International Telemetering Conference, ITC 2019",

}

TY - GEN

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

AU - Raveendran, Nithin

AU - Srinivasa, Shayan G.

AU - Vasić, Bane

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85090941458&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85090941458&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85090941458

T3 - Proceedings of the International Telemetering Conference

SP - 85

EP - 94

BT - 55th Annual International Telemetering Conference, ITC 2019

PB - International Foundation for Telemetering

T2 - 55th Annual International Telemetering Conference: Cultivating the Next Generation of Range Engineers, ITC 2019

Y2 - 21 October 2019 through 24 October 2019

ER -

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this