Achieving Channel Capacity with Low Complexity RS-BTC Using QPSK over AWGN Channel

High code rate Block Turbo Codes (BTC) using Bose-Chaudhuri-Hocquenghem (BCH) codes have already demonstrated near Shannon performances for Quadrature Phase-Shift Keying (QPSK) over Additive White Gaussian Noise (AWGN) channel. We show here that reliable transmission can be achieved at less than 1 dB from Shannon limit with very low complexity Reed-Solomon (RS) BTC under the same transmission condition. This is due to a proper choice of RS component codes used to construct RS product codes. Furthermore the size of the coded blocks required for RS-BTC to achieve a given code rate is much smaller than for BCH-BTC which is very attractive for practical considerations.

[1]  Ramesh Pyndiah,et al.  New architecture for high data rate turbo decoding of product codes , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

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

[4]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

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

[6]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[7]  Ramesh Pyndiah,et al.  Performance of Reed-Solomon block turbo code , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[8]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .

[9]  Peter Elias,et al.  Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.

[10]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.