Analysis and comparison of decoding algorithms on repeat accumulate code

This paper presents some decoding methods based on Tanner graph for the analysis of the repeat accumulate code which has been proved to be linear time encoding and linear time decoding. We study the structure of the repeat accumulate code and make a detail derivation of the procedure of these iterative algorithms. The extensive simulation results show that these efficient decoding methods based on the message passing algorithm are suitable for the repeat accumulate code both in performance and complexity.