Soft-decision decoding of linear block codes using preprocessing

Abstract

Two universally applicable preprocessing rules to improve iterative recoding algorithms, which utilize the most reliable basis (MRB), while focusing on order-w reprocessing, was investigated. The first preprocessing rule effect the extended MRB which is composed of the MRB and the most reliable bits in the redundancy part. The processing of test error pattern (TEP) with weight w+2, using order -w reprocessing, shows that any TEP of weight w+2 can be decomposed into a STEP of weight w. The simulation results show that the proposed algorithm decodes the Reed-Solomon concatenated code in near optimal manner.