Compound codes based on irregular graphs and their iterative decoding.

UKZN ResearchSpace

Show simple item record

dc.contributor.author Nkouatchah, Telex Magloire Ngatched.
dc.date.accessioned 2011-11-10T10:32:44Z
dc.date.available 2011-11-10T10:32:44Z
dc.date.created 2004
dc.date.issued 2004
dc.identifier.uri http://hdl.handle.net/10413/4252
dc.description Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2004. en
dc.description.abstract Low-density parity-check (LDPC) codes form a Shannon limit approaching class of linear block codes. With iterative decoding based on their Tanner graphs, they can achieve outstanding performance. Since their rediscovery in late 1990's, the design, construction, and decoding of LDPC codes as well as their generalization have become one of the focal research points. This thesis takes a few more steps in these directions. The first significant contribution of this thesis is the introduction of a new class of codes called Generalized Irregular Low-Density (GILD) parity-check codes, which are adapted from the previously known class of Generalized Low-Density (GLD) codes. GILD codes are generalization of irregular LDPC codes, and are shown to outperform GLD codes. In addition, GILD codes have a significant advantage over GLD codes in terms of encoding and decoding complexity. They are also able to match and even beat LDPC codes for small block lengths. The second significant contribution of this thesis is the proposition of several decoding algorithms. Two new decoding algolithms for LDPC codes are introduced. In principle and complexity these algorithms can be grouped with bit flipping algorithms. Two soft-input soft-output (SISO) decoding algorithms for linear block codes are also proposed. The first algorithm is based on Maximum a Posteriori Probability (MAP) decoding of low-weight subtrellis centered around a generated candidate codeword. The second algorithm modifies and utilizes the improved Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft-decisions using reliability calculations. Simulation results indicate that the proposed algorithms provide a significant improvement in error performance over Chase-based algorithm and achieve practically optimal performance with a significant reduction in decoding complexity. An analytical expression for the union bound on the bit error probability of linear codes on the Gilbert-Elliott (GE) channel model is also derived. This analytical result is shown to be accurate in establishing the decoder performance in the range where obtaining sufficient data from simulation is impractical. en
dc.language.iso en en
dc.subject Theses--Electrical engineering. en
dc.title Compound codes based on irregular graphs and their iterative decoding. en
dc.type Thesis en
dc.contributor.supervisor Takawira, Fambirai.

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UKZN ResearchSpace


Advanced Search

Browse

My Account