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

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