Skip to content
On the Design of Doubly-Generalized Low-Density Parity-Check Code episode artwork

Aug 26, 2009 52 min

On the Design of Doubly-Generalized Low-Density Parity-Check Code

from Hamilton Institute Seminars (iPod / small) Hosted by Hamilton Institute

Speaker: Dr. M. Flanagan Abstract: Doubly-generalized low-density parity-check (D-GLDPC) codes offer an attractive compromise between algebraic and random code design philosophies. In this talk we introduce the concept of D-GLDPC codes,and then provide a solution for the asymptotic growth rate of the weight distribution of any D-GLDPC ensemble. This tool is then used for detailed analysis of a case study, namely, a rate-1/2 D-GLDPC ensemble where all the check nodes are (7,4) Hamming codes and all the variable nodes are length-7 single parity-check codes. It is illustrated how the variable node representations can heavily affect the code properties and how different variable node representations can be combined within the same graph to enhance some of the code parameters. The analysis is conducted over the binary erasure channel. Interesting features of the new codes include the capability of achieving a good compromise between waterfall and error floor performance while preserving graphical regularity, and values of threshold outperforming LDPC counterparts.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

On the Design of Doubly-Generalized Low-Density Parity-Check Code

0:00 52:55

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Hamilton Institute Seminars (iPod / small)?

This episode is 52 minutes long.

When was this Hamilton Institute Seminars (iPod / small) episode published?

This episode was published on August 26, 2009.

Can I download this Hamilton Institute Seminars (iPod / small) episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.