LDPC decoding using multiple representations

Abstract

For a particular block code, a multitude of different parity check matrices could be chosen to represent the code constraints. We demonstrate that belief propagation decoders based on different parity check matrices often respond in different ways, and that for a given complexity, it may be preferable to use several decoders for fewer iterations, than to run a single decoder for many iterations. We also propose some additional decoder architectures that use multiple representations of the parity constraints.