Multitree search decoding of linear codes
Maja Ostojic · Repository for Publications and Research Data (ETH Zurich) · 2010
improve the standard sum-product decoder for low-density parity check codes.When the sum-product decoder fails to find a codeword, a tree search is used to decode a subset of bits.The channel messages for these bits are then replaced by the decisions found in the tree search in an additional sum-product decoding attempt.This can be repeated multiple times for different subsets of bits.The resulting decoder significantly outperforms the sum-product decoder.