Posted by: atri | November 14, 2007

Lecture 34: Iterative Message Passing Algorithm for BEC

In today’s lecture we saw the full description of an iterative message passing algorithm for BEC_{\alpha}. We then proved the crucial claim that the random variables corresponding to messages received by a node in the factor graph (in any round of the decoding algorithm) are independent.

Next lecture, we will continue with the analysis of the algorithm.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: