Generalized parallel concatenated block codes based on BCH and RS codes, construction and Iterative decoding

In this paper, a generalization of parallel concatenated block GPCB codes based on BCH and RS codes is presented.

[1]  Ramesh Pyndiah,et al.  Performance and complexity of block turbo decoder circuits , 1996, Proceedings of Third International Conference on Electronics, Circuits, and Systems.

[2]  S. Benedetto,et al.  Average performance of parallel concatenated block codes , 1995 .

[3]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[4]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[5]  M. Belkasmi,et al.  Iterative decoding of parallel concatenated block codes , 2008, 2008 International Conference on Computer and Communication Engineering.

[6]  R. Pyndiah,et al.  Performance of concatenated Reed-Solomon/convolutional codes with iterative decoding , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[7]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[8]  R Kotter,et al.  Iterative Decoding of Product Code Constructions , 1994 .

[9]  Martin Pilgram,et al.  Consultative Committee For Space Data Systems , 2009 .

[10]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[11]  Ramesh Pyndiah,et al.  Near optimum decoding of product codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.