Basics and Optimization of LDPC codes

Tutor: Carsten Bockelmann
Type of Thesis: Project (MSc)
date of end: 11/2008
Student: Wu Meng
Status: finished
ANT-shelfmark: P-11/08-2

Optimization of Low Density Parity Check (LDPC) codes for given check and variable node distributions is especially hard for small to medium code lengths. On the one hand one has to enhance the code topology to avoid cycles or to achieve well connect cycles and on the other hand one has to adhere to a given distribution fixing the number of check and variable nodes of a certain degree.

This work focusses on the implementation of a set of algorithms, which optimize regular and irregular LDPC codes.

Last change on 20.03.2009 by C. Bockelmann
AIT ieee GOC tzi ith Fachbereich 1
© Department of Communications Engineering - University of BremenImprint / Contact