Reduced-complexity decoding for concatenated codes based on rectangular parity-check codes and turbo codes

We compare the performance of several different decoding strategies for concatenated codes based on a serial concatenation of a rectangular parity-check code (RPCC) with a turbo code. These concatenated codes are referred to as RPCC+turbo codes. RPCC+turbo codes have been shown to outperform turbo codes significantly in several scenarios (see Shea, J.M., Proc. 2001 IEEE Int. Symp. Information Theory, p.144, 2001; Shea and Wong, T.F., Proc. 2001 IEEE Military Commun. Conf., 2001). One particularly useful application is to replace a turbo code with an RPCC+turbo code based on constituent codes of smaller memory. This combination can provide comparable or better performance while also achieving a lower decoder complexity (see Shea and Wong, 2001). However, the complexity of the iterative MAP decoder for such a code is still relatively high. We compare several different decoding strategies for the RPCC+turbo code that offer various trade-offs between performance and complexity.

[1]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[2]  Dariush Divsalar,et al.  Transfer function bounds on the performance of turbo codes Pasadena , 1995 .

[3]  Laurence B. Milstein,et al.  On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes , 2000, IEEE Trans. Commun..

[4]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[5]  Lajos Hanzo,et al.  Performance of the turbo hybrid automatic repeat request system type II , 1999, 1999 Information Theory and Networking Workshop (Cat. No.99EX371).

[6]  John M. Shea.  Improving the performance of turbo codes through concatenation with rectangular parity check codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[7]  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.

[8]  D. N. Rowitch.  Rate compatible punctured turbo (RCPT) codes in hybrid FEC/ARQ system , 1997 .

[9]  Matthew C. Valenti,et al.  An ARQ technique using related parallel and serial concatenated convolutional codes , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[10]  Frank R. Kschischang,et al.  A capacity-approaching hybrid ARQ scheme using turbo codes , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

[12]  Gordon L. Stüber,et al.  A novel ARQ technique using the turbo coding principle , 1997, IEEE Communications Letters.

[13]  John M. Shea,et al.  Concatenated codes based on multidimensional parity-check codes and turbo codes , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[14]  W. E. Stark,et al.  Concatenated punctured turbo Reed-Solomon codes in a hybrid FEC/ARQ DS/SSMA data network , 1999, 1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363).

[15]  Wai-Chung Chan,et al.  An adaptive hybrid FEC/ARQ protocol using turbo codes , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[16]  Wayne E. Stark,et al.  Turbo-coded ARQ schemes for DS-CDMA data networks over fading and shadowing channels: throughput, delay, and energy efficiency , 2000, IEEE Journal on Selected Areas in Communications.