Conference Paper

LDPC decoding using multiple representations

Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
DOI: 10.1109/ISIT.2002.1023728 Conference: Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Source: IEEE Xplore

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.

0 Followers
 · 
68 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: We describe the application of edge-local complementation (ELC) to a Tanner graph associated with a binary linear code, C. Various properties of ELC are described, mainly the special case of isomorphic ELC operations and the relationship to the automorphism group of the code, Aut(C), and the generalization of ELC to weight-bounding ELC (WB-ELC) operations under which the number of edges remains upper-bounded. ELC generates all systematic parity-check matrices (the orbit) of the code, so WB-ELC facilitates a restriction to low-weight matrices of this orbit. We propose using ELC and WB-ELC as a source of diversity, to improve iterative soft-input soft-output decoding of high-density parity-check (HDPC) codes, with the sum-product algorithm (SPA). A motivation of ELC-enhanced SPA decoding is locality; that diversity is achieved by local graph action, and is well-suited to the local actions that constitute the SPA and allows for parallel software implementation. Simulation data on the error-rate performance of the proposed SPA-ELC and SPA-WBELC iterative decoding algorithms is shown for several HDPC codes. A gain is reported over SPA decoding, and over a recently proposed algorithm to decode HDPC codes using permutations from Aut(C). ELC-enhanced decoding extends the scope of iterative decoding to codes with trivial Aut(C).
    IEEE Transactions on Communications 10/2012; 60(10):2796-2808. DOI:10.1109/TCOMM.2012.081012.110406 · 1.98 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: For cyclic LDPC codes, we propose to use their automorphism groups to improve the iterative decoding performance. The basic idea is to construct nonequivalent parity-check matrices via column permutations. Three types of iterative decoders are devised to take advantage of the code's automorphism group. In this paper we focus on cyclic LDPC codes defined by a circulant parity-check matrix and consider two known subgroups of the automorphism group of a cyclic code. For the large class of idempotent-based cyclic LDPC codes in the literature, we show that the two subgroups only provide equivalent parity-check matrices and thus cannot be harnessed for iterative decoding. Towards exploiting the automorphism group of a code, we propose a new class of cyclic LDPC codes based on pseudo-cyclic MDS codes with two information symbols, for which nonequivalent parity-check matrices are obtained. Simulation results show that for our constructed codes of short lengths, the automorphism group can significantly enhance the iterative decoding performance.
    IEEE Transactions on Communications 06/2013; 61(6):2128-2137. DOI:10.1109/TCOMM.2013.032713.120050 · 1.98 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Multiple-bases belief-propagation is a parallel decoding setup which allows for improved decoding performance when compared to standard belief-propagation. Originally designed for decoding of high-density parity-check codes in an iterative manner, this method also shows good decoding results for well-designed low-density parity-check codes when signaling over the AWGN channel. We show the applicability of this scheme to channel codes defined in the IEEE WiMAX standard. It is challenging to find sets of well-performing parity-check matrices for these codes, all of them differing from each other. We propose an algorithm which makes use of the special structure of an underlying base matrix to accomplish this task. The results are compared to codes constructed by the progressive edge-growth algorithm and to bounds from information theory.
    Source and Channel Coding (SCC), 2010 International ITG Conference on; 02/2010