Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes

Thomas R. Halford, K.M. Chugg

Published Jul 1, 2006• 49 citations
Publisher

Abstract

A number of authors have recently considered iterative soft-in soft-out (SISO) decoding algorithms for classical linear block codes that utilize redundant Tanner graphs. Jiang and Narayanan presented a practically realizable algorithm that applies only to cyclic codes while Kothiyal et al. presented an algorithm that, while applicable to arbitrary linear block codes, does not imply a low-complexity implementation. This work first presents the aforementioned algorithms in a common framework and then presents a related algorithm - random redundant iterative decoding - that is both practically realizable and applicable to arbitrary linear block codes. Simulation results illustrate the successful application of the random redundant iterative decoding algorithm to the extended binary Golay code. Additionally, the proposed algorithm is shown to outperform Jiang and Narayanan's algorithm for a number of Bose-Chaudhuri-Hocquenghem (BCH) codes

DOI
10.1109/isit.2006.261947

Related papers

Transactions Letters - Random Redundant Iterative Soft-in Soft-out Decoding

Thomas R. Halford, K.M. Chugg

This letter presents an iterative soft-in soft-out (SISO) decoding algorithm based on redundant Tanner graphs that is applicable to arbitrary linear block codes. The proposed algorithm utilizes the permutation group of a code in order to efficiently and randomly generate redundant parity-checks.

IEEE Transactions on Communications•Apr 1, 2008•26 citations

Iterative soft decoding of binary linear codes using a generalized Tanner graph

Eirik Rosnes

In this work, we consider iterative soft-decision decoding of binary linear codes using a generalized Tanner graph. A generalized Tanner graph is constructed from the code's Tanner graph representation under the objective of mitigating the effect of small cycles. Then, iterative decoding is applied to the generalized Tanner graph using trellis-based soft-input soft-output decoding in the generalized check nodes. When combined with the stochastic shifting algorithm of Jiang and Narayanan (IEEE Commun. Letters, 2004), the proposed decoding method provides both improved error rate performance and reduced average decoding complexity, without increasing the worst-case decoding complexity.

IEEE Information Theory Workshop (ITW)•Oct 1, 2011•0 citations

Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes

Thomas R. Halford, K.M. Chugg

Generalized Tanner graphs have been implicitly studied by a number of authors under the rubric of generalized parity-check matrices. This work considers the conditioning of binary hidden variables in such models in order to break all cycles and thus derive optimal soft-in soft-out (SISO) decoding algorithms. Conditionally cycle-free generalized Tanner graphs are shown to imply optimal SISO decoding algorithms for the first order Reed-Muller codes and their duals - the extended Hamming codes - which are substantially less complex than conventional bit-level trellis decoding. The study of low-complexity optimal SISO decoding algorithms for the family of extended Hamming codes is practically motivated. Specifically, it is shown that exended Hamming codes offer an attractive alternative to high- rate convolutional codes in terms of both performance and complexity for use in very high-rate, very low-floor, serially concatenated coding schemes.

arXiv:cs/0611097•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•2 citations

Soft-Output ORDEPT Iterative Decoding of Generalized LDPC and Product Codes

Reza Hadavian, Dmitri V. Truhachev, Michael Lentmaier

We present a soft-input soft-output (SISO) decoding algorithm for binary block codes, based on ordered reliability direct error-pattern testing (ORDEPT) and extended covered space approximation. The method can be used for iterative decoding of product-like and generalized low-density parity-check (GLDPC) codes. Our results obtained for product and GLDPC codes with extended Bose-Chaudhuri-Hocquenghem (BCH) component codes show that the proposed decoder demonstrates improved performance, often achieved with much smaller complexity compared to the state-of-the-art SISO decoders.

IEEE Communications Letters•Jan 1, 2026•0 citations

Efficient Decoding of Short Length Linear Cyclic Codes

Mohamed Ismail, Stojan Z. Denic, Justin P. Coon

Iterative soft decision decoding of linear block codes is a practical necessity when working with even modest block lengths. A number of algorithms have been proposed in the literature which use the permutation group of a code and the belief propagation (BP) algorithm for decoding. A novel soft-input, soft-output algorithm is presented that can be used for efficiently decoding of linear cyclic codes. Utilising the automorphism property of cyclic codes the permutation is incorporated into the belief propagation algorithm resulting in faster convergence and better error correcting performance. Performance of the new approach is analysed using a (63,45) BCH code and a (72,36) quadratic residue code. Simulation results show significant reduction in the average number of required decoding iterations and some improvement in error correcting performance over published algorithms.

IEEE Communications Letters•Jan 14, 2015•7 citations

Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach

S. Sankaranarayanan, Bane V. Vasic

It is widely accepted that short cycles in Tanner graphs deteriorate the performance of message-passing algorithms. This discourages the use of these algorithms on Tanner graphs (TGs) of well-known algebraic codes such as Hamming codes, Bose-Chaudhuri-Hocquenghem codes, and Reed-Solomon codes. Yedidia et al. presented a method to generate code representations suitable for message-passing algorithms. This method does not guarantee a representation free of four-cycles. In this correspondence, we present an algorithm to convert an arbitrary linear block into a code with orthogonal parity-check equations. A combinatorial argument is used to prove that the algorithm guarantees a four-cycle free representation for any linear code. The effects of removing four-cycles on the performance of a belief propagation decoder for the binary erasure channel are studied in detail by analyzing the structures in different representations. Finally, we present bit-error rate (BER) and block-error rate (BLER) performance curves of linear block codes under belief propagation algorithms for the binary erasure channel and the additive white Gaussian noise (AWGN) channel in order to demonstrate the improvement in performance achieved with the help of the proposed algorithm.

IEEE Transactions on Information Theory•Aug 24, 2005•56 citations
A number of authors have recently considered iterative soft-in soft-out (SISO) decoding algorithms for classical linear block codes that utilize redundant Tanner graphs. Jiang and Narayanan presented a practically realizable algorithm that applies only to cyclic codes while Kothiyal et al. presented an algorithm that, while applicable to arbitrary linear block codes, does not imply a low-complexity implementation. This work first presents the aforementioned algorithms in a common framework and then presents a related algorithm - random redundant iterative decoding - that is both practically realizable and applicable to arbitrary linear block codes. Simulation results illustrate the successful application of the random redundant iterative decoding algorithm to the extended binary Golay code. Additionally, the proposed algorithm is shown to outperform Jiang and Narayanan's algorithm for a number of Bose-Chaudhuri-Hocquenghem (BCH) codes
In this work, we consider iterative soft-decision decoding of binary linear codes using a generalized Tanner graph. A generalized Tanner graph is constructed from the code's Tanner graph representation under the objective of mitigating the effect of small cycles. Then, iterative decoding is applied to the generalized Tanner graph using trellis-based soft-input soft-output decoding in the generalized check nodes. When combined with the stochastic shifting algorithm of Jiang and Narayanan (IEEE Commun. Letters, 2004), the proposed decoding method provides both improved error rate performance and reduced average decoding complexity, without increasing the worst-case decoding complexity.
Generalized Tanner graphs have been implicitly studied by a number of authors under the rubric of generalized parity-check matrices. This work considers the conditioning of binary hidden variables in such models in order to break all cycles and thus derive optimal soft-in soft-out (SISO) decoding algorithms. Conditionally cycle-free generalized Tanner graphs are shown to imply optimal SISO decoding algorithms for the first order Reed-Muller codes and their duals - the extended Hamming codes - which are substantially less complex than conventional bit-level trellis decoding. The study of low-complexity optimal SISO decoding algorithms for the family of extended Hamming codes is practically motivated. Specifically, it is shown that exended Hamming codes offer an attractive alternative to high- rate convolutional codes in terms of both performance and complexity for use in very high-rate, very low-floor, serially concatenated coding schemes.
We present a soft-input soft-output (SISO) decoding algorithm for binary block codes, based on ordered reliability direct error-pattern testing (ORDEPT) and extended covered space approximation. The method can be used for iterative decoding of product-like and generalized low-density parity-check (GLDPC) codes. Our results obtained for product and GLDPC codes with extended Bose-Chaudhuri-Hocquenghem (BCH) component codes show that the proposed decoder demonstrates improved performance, often achieved with much smaller complexity compared to the state-of-the-art SISO decoders.
Iterative soft decision decoding of linear block codes is a practical necessity when working with even modest block lengths. A number of algorithms have been proposed in the literature which use the permutation group of a code and the belief propagation (BP) algorithm for decoding. A novel soft-input, soft-output algorithm is presented that can be used for efficiently decoding of linear cyclic codes. Utilising the automorphism property of cyclic codes the permutation is incorporated into the belief propagation algorithm resulting in faster convergence and better error correcting performance. Performance of the new approach is analysed using a (63,45) BCH code and a (72,36) quadratic residue code. Simulation results show significant reduction in the average number of required decoding iterations and some improvement in error correcting performance over published algorithms.
It is widely accepted that short cycles in Tanner graphs deteriorate the performance of message-passing algorithms. This discourages the use of these algorithms on Tanner graphs (TGs) of well-known algebraic codes such as Hamming codes, Bose-Chaudhuri-Hocquenghem codes, and Reed-Solomon codes. Yedidia et al. presented a method to generate code representations suitable for message-passing algorithms. This method does not guarantee a representation free of four-cycles. In this correspondence, we present an algorithm to convert an arbitrary linear block into a code with orthogonal parity-check equations. A combinatorial argument is used to prove that the algorithm guarantees a four-cycle free representation for any linear code. The effects of removing four-cycles on the performance of a belief propagation decoder for the binary erasure channel are studied in detail by analyzing the structures in different representations. Finally, we present bit-error rate (BER) and block-error rate (BLER) performance curves of linear block codes under belief propagation algorithms for the binary erasure channel and the additive white Gaussian noise (AWGN) channel in order to demonstrate the improvement in performance achieved with the help of the proposed algorithm.