LDPC Codes on Finite Fields PDF Download

Author: Juane Li
Publisher:
ISBN: 9781369201024
Category :
Languages : en
Pages :

Get Book

Book Description
Due to their capacity-approaching performance which can be achieved with practically implementable iterative decoding algorithms devised based on belief-propagation, low-density parity-check (LDPC) codes have rapid dominance in the applications requiring error control coding. This dissertation is intended to address certain important aspects of the aforementioned issues about LDPC codes. Subjects to be investigated include: (1) flexible and systematic methods for constructing binary LDPC codes with quasi-cyclic structure based on finite fields; (2) construction of high-rate and low-rate quasi-cyclic (QC) LDPC codes to achieve very low error rates without error-floor and with high rate of decoding convergence; (3) construction of binary QC-LDPC codes whose Tanner graphs have girth 8 or larger and contain minimum number of short cycles; (4) developing effective algorithms for enumerating short cycles in the Tanner graph of LDPC codes; (5) devising reduced-complexity decoding schemes and algorithms for binary QC-LDPC codes; (6) effective matrix-theoretic methods for constructing nonbinary (NB) LDPC codes; and (7) reduced-complexity decoding schemes and algorithms for NB LDPC codes. The dissertation presents a simple, flexible and systematic method to construct both binary and nonbinary LDPC codes with quasi-cyclic (QC) structure based on two arbitrary subsets of a finite field. One technique for constructing QC-LDPC codes whose Tanner graphs have girth 8 or larger is also proposed. Simulation results show that these constructed codes perform well over both the additive white Gaussian noise and the binary erasure channels. Also presented in this dissertation is a reduced-complexity decoding scheme to decode binary QC-LDPC codes. The decoding scheme is devised based on the section-wise cyclic structure of the parity-check matrix of a QC-LDPC code. The proposed decoding scheme combined with iterative decoding algorithms of LDPC codes results in no or a relative small performance degradation. Two efficient algorithms for enumerating short cycles in the Tanners graph of LDPC codes are presented. One algorithm is devised based on iterative message-passing algorithm by introducing messages in term of monomials, which is an improvement of the work of Karimi and Banihashemi. The other one is based on the trellis of an LDPC code by finding the partial paths which can form cycles. By removing certain number of cycles, a new code whose Tanner graph has a smaller number of short cycles, a larger girth, or both can be constructed. An algorithm to count and find cycles of lengths four and six in a class of QC-LDPC codes is also proposed. In this dissertation, we also briefly investigate one of the algebraic-based constructions of LDPC code, namely superposition (SP) construction, and one of the graph-based constructions, namely protograph-based (PTG-based) construction. The SP-construction method is re-interpreted in a broader scope from both the algebraic and the graph-theoretic perspectives. From the graph-theoretic point of view, it is shown that the PTG-based construction of LDPC codes is a special case of the SP-construction. An algebraic method for constructing PTG-based QC-LDPC codes through decomposing a small matrix is proposed. Several methods for constructing QC-LDPC codes through the SP-construction are also presented.