Tree-Structured algorithm applied to LDPC decoding
Event details
| Date | 24.06.2011 |
| Hour | 11:15 |
| Speaker | Prof. Juan José Murillo Fuentes, Universidad de Sevilla |
| Location | |
| Category | Conferences - Seminars |
Very much effort has been devoted to the design of LDPC codes to achieve capacity under BP decoding. In this work we rather focus on the decoder design. We borrow from the tree-structured expectation propagation (TEP) algorithm to propose novel decoders that improve the BP performance. We first develop the TEP as a general decoder. Then, we deeply study the impact of this decoding on the BEC. We prove that it can achieve a better threshold at linear complexity with the length of the code. And, for short codes, it exhibits a good performance. The codes can also be designed to improve the threshold. To achieve capacity, we go further and develop decoders with no linear complexity that achieve the MAP solution. We end this talk by presenting some present lines of research. Prof. Murillo-Fuentes' homepage
Practical information
- General public
- Free