Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation

DOI10.1007/978-3-540-87448-5_10zbMATH Open1166.94358arXiv0905.4164OpenAlexW2099802192MaRDI QIDQ3540924FDOQ3540924

Authors: Joakim Grahl Knudsen, Constanza Riera, Matthew G. Parker, Eirik Rosnes 

Publication date: 25 November 2008

Published in: Coding Theory and Applications (Search for Journal in Brave)

Abstract: In this paper, we propose to enhance the performance of the sum-product algorithm (SPA) by interleaving SPA iterations with a random local graph update rule. This rule is known as edge local complementation (ELC), and has the effect of modifying the Tanner graph while preserving the code. We have previously shown how the ELC operation can be used to implement an iterative permutation group decoder (SPA-PD)--one of the most successful iterative soft-decision decoding strategies at small blocklengths. In this work, we exploit the fact that ELC can also give structurally distinct parity-check matrices for the same code. Our aim is to describe a simple iterative decoder, running SPA-PD on distinct structures, based entirely on random usage of the ELC operation. This is called SPA-ELC, and we focus on small blocklength codes with strong algebraic structure. In particular, we look at the extended Golay code and two extended quadratic residue codes. Both error rate performance and average decoding complexity, measured by the average total number of messages required in the decoding, significantly outperform those of the standard SPA, and compares well with SPA-PD. However, in contrast to SPA-PD, which requires a global action on the Tanner graph, we obtain a performance improvement via local action alone. Such localized algorithms are of mathematical interest in their own right, but are also suited to parallel/distributed realizations.

Full work available at URL: https://arxiv.org/abs/0905.4164

Recommendations

• Iterative decoding of LDPC codes: some bounds and properties
• Signal-space characterization of iterative decoding
• Graph-based iterative decoding algorithms for parity-concatenated trellis codes
• Algebraic coding for iterative decoding
• Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach

Mathematics Subject Classification ID

Decoding (94B35)

Cites Work

• Title not available (Why is that?)
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Good codes based on very sparse matrices
• Factor graphs and the sum-product algorithm
• The capacity of low-density parity-check codes under message-passing decoding
• Isotropic systems
• On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Edge local complementation and equivalence of binary linear codes
• Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix

Cited In (1)

• On graphs and codes preserved by edge local complementation

This page was built for publication: Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540924)