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

Dr. M. Flanagan
26 August 2009
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.
You should see the video here…
High quality
MP4 (iPod/small), 100.93 MB
MP4 (HD/large), 293.01 MB
RSS (iPod/small)
RSS (HD/large)

« Back to seminars
Other video recordings »