Efficient decoding of block turbo codes

Block turbo codes (BTCs) under iterative decoding are product codes showing excellent performance with reasonable complexity, whose component codes are conventionally decoded in two stages. The Chase algorithm is employed in the first stage to make a list of candidate codewords from the received vector, while the extrinsic information for iterative decoding is generated in the second stage. In this paper, we propose an efficient decoding algorithm for BTCs. The proposed algorithm can avoid a number of unnecessary hard-decision decoding operations by imposing two conditions on the Chase algorithm. Also, it simply computes the extrinsic information for the decision codeword. Numerical results demonstrate that the proposed algorithm has not only much lower computational complexity, but also a little better performance than the conventional decoding scheme based on the Chase algorithm. Furthermore, it can provide a trade-off between the performance and the computational complexity of BTCs by properly selecting a decoding parameter.

[1]  Sang G. Kim,et al.  The softest handoff design using iterative decoding (Turbo coding) , 2000, Journal of Communications and Networks.

[2]  Ramesh Pyndiah,et al.  New Approach to Order Statistics Decoding of Long Linear Block Codes , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[3]  Mohammed Benaissa,et al.  Iterative decoding with a hamming threshold for block turbo codes , 2004, IEEE Communications Letters.

[4]  Lei Cao,et al.  On the performance of turbo codes-based hybrid ARQ with segment selective repeat in WCDMA , 2006, Journal of Communications and Networks.

[5]  Desmond P. Taylor,et al.  On adaptive reduced-complexity iterative decoding , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[6]  J. J. O'Reilly,et al.  Novel near maximum likelihood soft decision decoding algorithm for linear block codes , 1999 .

[7]  Lei Cao,et al.  Test-pattern-reduced decoding for turbo product codes with multi-error-correcting eBCH codes , 2009, IEEE Transactions on Communications.

[8]  Ramesh Pyndiah,et al.  Adapted iterative decoding of product codes , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[9]  Mathini Sellathurai,et al.  Approaching near-capacity on a multi-antenna channel using successive decoding and interference cancellation receivers , 2003, Journal of Communications and Networks.

[10]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[11]  Shu Lin,et al.  Chase-type and GMD coset decodings , 2000, IEEE Trans. Commun..

[12]  Yousef R. Shayan,et al.  Distance-based-decoding of block turbo codes , 2005, IEEE Communications Letters.

[13]  Desmond P. Taylor,et al.  Distance based adaptive scaling in suboptimal iterative decoding , 2002, IEEE Trans. Commun..

[14]  Peter J. McLane,et al.  Error control coding and space-time MMSE multiuser detection in DS-CDMA systems , 2003, Journal of Communications and Networks.

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

[16]  Ivan J. Fair,et al.  PAPR reduction of OFDM signals using partial transmit sequence: an optimal approach using sphere decoding , 2005, IEEE Communications Letters.

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

[18]  Bayan S. Sharif,et al.  A Hybrid Decoder for Block Turbo Codes , 2009, IEEE Transactions on Communications.

[19]  Ying-Chang Liang,et al.  A low complexity decoding algorithm for extended turbo product codes , 2008, IEEE Transactions on Wireless Communications.

[20]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.

[21]  Kyungwhoon Cheun,et al.  Low-Complexity Decoding of Block Turbo Codes Based on the Chase Algorithm , 2017, IEEE Communications Letters.

[22]  Benoit Geller,et al.  A low complexity block turbo decoder architecture - [transactions letters] , 2008, IEEE Transactions on Communications.

[23]  Keshab K. Parhi,et al.  On the performance/complexity tradeoff in block turbo decoder design , 2004, IEEE Transactions on Communications.

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

[25]  Benoit Geller,et al.  A Low Complexity Block Turbo Decoder Architecture , 2016 .

[26]  Bahram Honary,et al.  Fast Chase algorithm with an application in turbo decoding , 2001, IEEE Trans. Commun..

[27]  Steven W. McLaughlin,et al.  An efficient Chase decoder for turbo product codes , 2004, IEEE Transactions on Communications.

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

[29]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..