Posted by: atri | November 19, 2007

Lecture 36: LDPC codes round-up

In today’s lecture we saw the Peeling decoder, which is a linear time implementation of the message passing decoding algorithm that we have seen so far. We then saw a very high level overview of irregular LDPC codes and expander codes.

In the next lecture, we will start with algorithms for list decoding.

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: