Soft-decision decoding of linear block codes using preprocessing
Yingquan Wu, R. Koetter, Christoforos N. Hadjicostis · 2004
In this paper, two universally applicable preprocessing rules are developed to improve iterative receding algorithms that utilize the most reliable basis (MRB), while focusing on order-w reprocessing. Simulation results show that the proposed algorithm successfully decodes the Reed-Solomon concatenated code in near optimal manner at a block-error-rate with the maximum number of candidate codewords.