TY - GEN
T1 - An analysis into the loopy belief propagation algorithm over short cycles
AU - Raveendran, Nithin
AU - Srinivasa, Shayan Garani
PY - 2014
Y1 - 2014
N2 - We investigate into the loopy belief propagation algorithm for binary low density parity check (LDPC) codes having cycles of small girth. Independence assumption among messages passed, assumed reasonable in all configurations of graphs, fails the most in graphical structures with short cycles. We investigate into this limitation and propose a modified algorithm, by considering dependency in the probability domain. This improves the performance of decoding over such graphs when compared to the original message passing algorithm at higher signal-to-noise ratio (SNR), thereby, yielding lower error floors.
AB - We investigate into the loopy belief propagation algorithm for binary low density parity check (LDPC) codes having cycles of small girth. Independence assumption among messages passed, assumed reasonable in all configurations of graphs, fails the most in graphical structures with short cycles. We investigate into this limitation and propose a modified algorithm, by considering dependency in the probability domain. This improves the performance of decoding over such graphs when compared to the original message passing algorithm at higher signal-to-noise ratio (SNR), thereby, yielding lower error floors.
UR - https://www.scopus.com/pages/publications/84906993294
UR - https://www.scopus.com/pages/publications/84906993294#tab=citedBy
U2 - 10.1109/ICC.2014.6883618
DO - 10.1109/ICC.2014.6883618
M3 - Conference contribution
AN - SCOPUS:84906993294
SN - 9781479920037
T3 - 2014 IEEE International Conference on Communications, ICC 2014
SP - 2009
EP - 2014
BT - 2014 IEEE International Conference on Communications, ICC 2014
PB - IEEE Computer Society
T2 - 2014 1st IEEE International Conference on Communications, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -