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.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

[3]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[4]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[5]  Stephan ten Brink,et al.  Design of repeat-accumulate codes for iterative detection and decoding , 2003, IEEE Trans. Signal Process..

[6]  S. Weller,et al.  Interleaver and Accumulator Design for Systematic Repeat-Accumulate Codes , 2005, 2005 Australian Communications Theory Workshop.

[7]  Joseph J. Boutros,et al.  Turbo code at 0.03 dB from capacity limit , 2002, Proceedings IEEE International Symposium on Information Theory,.

[8]  Hui Jin,et al.  Analysis and design of turbo-like codes , 2001 .

[9]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .