Adaptive and iterative list decoding

Abstract

This thesis presents an efficient iterative list-decoding algorithm for Reed-Solomon (RS) codes by adaptively adjust its list size. Specially, we propose a stop criterion for iterative decoder. Once it is met, the iterative decoder stops and generates desirable decoded output. Simulation results show that our decoding algorithm improves the BER and reduces the computation complexity as well. Furthermore, we propose the modified adaptive list decoder, which is better than the adaptive list decoder. In addition, we describe iterative list decoder by applying the turbo structure to it. We also combine the adaptive list decoder and iterative list decoder together to achieve better BER performance.