Adaptive and iterative soft-decision list decoding

An efficient adaptive list decoder for Reed-Solomon (RS) codes by adaptively adjusting the list size is presented. Simulations show that it performs better than the Koetter-Vardy decoder (KVD) for small list sizes, with only a marginal increase in complexity. For larger list sizes, we propose an iterative decoder which, when applied to a parallel concatenated RS code, performs significantly better than the KVD, applied to an RS code of the same rate.

[1]  Hatsukazu Tanaka,et al.  Soft-decision decoding of Reed-Solomon codes , 2000 .

[2]  Venkatesan Guruswami.  6 Reed-Solomon and Algebraic-Geometric Codes , 2004 .

[3]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[4]  Paul H. Siegel,et al.  Soft-decision Reed-Solomon decoding on partial response channels , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[6]  Paul H. Siegel,et al.  Iterative soft-decision Reed-Solomon decoding on partial response channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[7]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).