Asynchronous Decoding of LDPC Codes over BEC

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based on the information received from the check nodes in the previous round, and then 2) updating all the check nodes based on the information sent from variable nodes in the current round. However, in many applications, ranging from message passing in neural networks to hardware implementation of LDPC codes, assuming that all messages are sent and received at the same time is far from realistic. In this paper, we investigate the effect of asynchronous message passing on the decoding of LDPC codes over a BEC channel. We effectively assume that there is a random delay assigned to each edge of the factor graph that models the random propagation delay of a message along the edge. As a result, the output messages of a check/variable node are also asynchronously updated upon arrival of a new message in its input. We show, for the first time, that the asymptotic performance of the asynchronous message passing is fully characterized by a fixed point integral equation that takes into account both the temporal and the spatial feature of the factor graph. Our theoretical result is reminiscent of the fixed point equation in traditional BP decoding. Surprisingly, our simulation results show that asynchronous scheduling outperforms tremendously the traditional BP in the finite block length regime by avoiding standard trapping sets.


Presented at:
IEEE International Symposium on Information Theory (ISIT), Hong Kong, June 14-19, 2015
Year:
2015
Keywords:
Laboratories:




 Record created 2015-02-01, last modified 2018-11-17

The data used in the figures:
Download fulltextZIP
iPython Notebook:
Download fulltextIPYNB
n/a:
Download fulltextPDF
the Code used in the paper:
Download fulltextZIP
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)