One sweep algorithm for optimal APP symbol decoding

This paper proposes a one sweep algorithm able to deliver both optimal maximum likelihood (ML) hard-output sequence and optimal maximum a posteriori (MAP) symbol-by-symbol soft-output values. The proofs of the optimality is given. Two reduced complexity versions based on the log and log-max approximations are also proposed.