Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 66-70
Abstract
The generalized iterative decoding concept offers attractive performance versus complexity trade-off opportunities in the spectrum between traditional iterative 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 other 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.Keywords
This publication has 13 references indexed in Scilit:
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given SizeIEEE Transactions on Information Theory, 2007
- Improved Upper Bounds on Stopping RedundancyIEEE Transactions on Information Theory, 2006
- On the Stopping Redundancy of Reed–Muller CodesIEEE Transactions on Information Theory, 2006
- Stopping Set Distributions of Some Linear Codes2006
- On the stopping distance and the stopping redundancy of codesIEEE Transactions on Information Theory, 2006
- Stopping set analysis for Hamming codes2005
- On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure ChannelIEEE Transactions on Information Theory, 2004
- Pseudocodeword weights and stopping sets2004
- Stopping sets and the girth of Tanner graphs2003
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002