On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms

Authors:
Tadao Kasami
Affiliations:
-
Venue:
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1999

Citing 5
Cited 2

An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

IEEE Transactions on Information Theory
An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

IEEE Transactions on Information Theory
A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes

IEEE Transactions on Information Theory
Soft-decision decoding of linear block codes based on ordered statistics

IEEE Transactions on Information Theory

An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider sufficient conditions for ruling out some useless iteration steps or all subsequent iteration steps without degradation of error performance in soft-decision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Then the derivation of such sufficient conditions and the selection of centers of search regions in iterative steps are formulated uniformly as a type of integer programming problems. Several techniques for reducing such an integer programming problem to a set of subprograms with smaller computational complexities are presented.