A Comparison of Rate Compatible PCCC and SCCC for Next Generation Wireless Communication Systems

In this paper, we conduct performance comparison of rate compatible parallel concatenated convolutional code (PCCC) and serially concatenated convolutional code (SCCC) in additive white Gaussian noise (AWGN) and frequency selective fading channels. Series of computer simulation results show that the packet error rate (PER) performance of memory 2 SCCC is worse than that of memory 3 PCCC by 0.4-0.8 dB at 10-2 PER after the sufficient number of decoding iterations, whereas the complexity of SCCC is lower than that of PCCC by about 39%. Increasing the memory length in SCCC does not lead to performance gain. On the other hand, reducing memory length in PCCC leads to significant performance degradation. However, reducing the number of iterations to half in PCCC leads to lower complexity than SCCC and still offers better PER performance than SCCC in terms of the required Eb/N0 for 10-2 PER. Therefore, PCCC can achieve better trade-off between complexity and performance than SCCC.

[1]  S. S. Pietrobon,et al.  Rate compatible turbo codes , 1995 .

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

[3]  福井 章人,et al.  Radio transmission and reception method and a radio communication terminal device , 2008 .

[4]  P.H.-Y. Wu,et al.  On the complexity of turbo decoding algorithms , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[5]  Fulvio Babich,et al.  Partially systematic rate-compatible punctured SCCCs , 2004, IEEE Communications Letters.

[6]  F. Pollara,et al.  Serial concatenation of interleaved codes: performance analysis, design and iterative decoding , 1996, Proceedings of IEEE International Symposium on Information Theory.

[7]  J. Vogt,et al.  Improving the max-log-MAP turbo decoder , 2000 .