Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear codes are derived. Instead of checking only error patterns yielding a codeword when added to the rounded-off version of the received vector, these implementations principally consider all possible column patterns. Compared to known implementations, this allows a more efficient use of branching and bounding techniques
Published in:
Information Theory, IEEE Transactions on
(Volume:39
,
Issue:
1
)
Date of Publication: Jan 1993