A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes

Authors:
T. Fujiwara;H. Yamamoto;T. Kasami;Shu Lin
Affiliations:
Graduate Sch. of Eng. Sci., Osaka Univ.;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Coarse-to-Fine Dynamic Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
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
On Viterbi-like algorithms and their application to Reed-Muller codes

Journal of Complexity - Special issue on coding and cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper presents an efficient trellis-based maximum-likelihood decoding algorithm for binary linear block codes. This algorithm is recursive in nature and is devised based on the structural properties and optimum sectionalization of a code trellis. The complexity of the proposed decoding algorithm is analyzed. Numerical results show that the proposed decoding algorithm significantly reduces the decoding complexity. A recursive method for finding the optimum sectionalization of a trellis in terms of computational complexity is given