【摘要】 提出了一种基于Koetter Vardy算法的软GMD算法,根据每个内插点子集的可靠度,进行连续纠错删译码.仿真结果表明,与Koetter Vardy算法相比,在译码性能相同的条件下,对于长度为15的RS码,则降低了90%～98.5%;对于RS(255,239)码,软GMD算法的复杂度降低了约46%.更多还原

【Abstract】 A list-decoding-based soft-GMD algorithm is provided. Based on the Koetter-Vardy algorithm, the proposed algorithm performs sucessive erasure-and-error decoding according to the reliability metric of each interpolation points subset. Simulation results show that to obtain the same coding gains, the soft-GMD algorithm leads to a factor of 90%~98.5% reduction in complexity for RS codes of length 15 and a factor of about 46% reduction in complexity for RS(255, 239) code, as compared with the Koetter-Vardy algorithm.更多还原