Student: 

Jalal Etesami

Advisor:
Prof. Dr.-Ing. Werner Henkel

Time frame:
Fall 2008

 

 

 

 

Description:

We introduce a new algorithm for constructing LDPC codes based on a Protograph. With Protographs, we have a base graph (mother graph), which is duplicated a number of times followed by a special edge permutation obtaining the largest possible girth. This report presents an algorithm for choosing the permutations for girth maximization given a degree distribution and the corresponding mother graph.

  • +Documents

    [Report] A Protograph Construction for LDPC Unequal Error Protection Codes

 

Status: Completed