Generalized iteratieve decoding for linear block codes on the binary erasure channel

Conference paper (2007)

Authors

KAS Abdel-Ghaffar External organisation
J.H. Weber Wireless and Mobile Communications
Research Group
Wireless and Mobile Communications
More Info
expand_more

Published Date

2007

Language

Undefined/Unknown

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Wireless and Mobile Communications

Abstract

The generalized iterative decoding concept offers attractive performances versus complexity trade-off oppurtunities in the spectrum between traditional iteratieve decoding and optimal decoding for linear block codes over the binary erasure channel. In each iteration, a system of equations is solved. The maximum number of equations to be solved in one iteration is called the order of the decoder. In case the order is just one, the generalized iterative decoder reduces to the traditional iterative decoder. On the ohter hand, if the order is set to the redundancy of the codes, the generalized iterative decoder gives the same performance as the optimal decoder. Varying the order between these two extremes allows for a better match to the system specifications. In this paper, we consider aspects regarding the implementation of generalized iterative decoding and we determine the minimum order (as a function of the girth) that can potentially lead to improvement over traditional iterative decoding.