We found that the iterative decoding of analog concatenated codes may be described as iterative projections realizing a least-mean-square solution. This allows for a very intuitive understanding of the iterative Turbo-like decoding procedures. Furthermore, we investigate the correction of bursty noise in additional background noise.
Posts Categorized / Analog Codes and Iterative Decoding
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
Student: David Kronmüller Advisor: Prof. Dr.-Ing. Werner Henkel, Neele von Deetzen Time frame: Spring 2008 Description: The demand for higher communication data rates is immense in the era of high quality multimedia content. The issue at hand is to increase data transfer rates while improving error tolerance lev- els. Turbo codes
Student: Behrouz Touri Advisor: Prof. Dr.-Ing. Werner Henkel Time frame: Spring 2008 Description: Binary linear codes are one of the main tools for error-control coding over telecommunication channels and data storage devices. However, despite of having very simple encoder structures, their optimum decoding is usually a hard problem in practice. In
Student: Neele von Deetzen (diploma student of the University of Bremen and now PhD student at Jacobs University) Advisor: Prof. Dr.-Ing. Werner Henkel, Prof. Dr.-Ing. Karl Dirk Kammeyer Time frame: August 31, 2004, February 28, 2005 Description: In this work, we discussed possible solutions for achieving unequal error protection based on