Soft-decision decoding of binary linear block codes based on an iterative search algorithm

摘要

This paper presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm using a purged trellis diagram. The scheme achieves near optimum error performance with a significant reduction in computational complexity.