Iterative decoding of multi-dimensional concatenated single parity check codes

This paper is concerned with the decoding technique and performance of multi-dimensional concatenated single-parity-check (SPC) code. A very efficient sub-optimal soft-in-soft-out decoding rule is presented for the SPC code, costing only 3 addition-equivalent-operations per information bit. Multi-dimensional concatenated coding and decoding principles are investigated. Simulation results of rate 5/6 and 4/5 3-dimensional concatenated SPC codes are provided. Performance of BER=10/sup -4/-10/sup -5/ can be achieved by the MAP and max-log-MAP decoders, respectively, with E/sub b//N/sub 0/ only 1 and 1.5 dB away from the theoretical limits.

[1]  Li Ping,et al.  Max-Log-MAP filtering algorithm for decoding product F/sub 24/ code , 1997, Proceedings of ICC'97 - International Conference on Communications.

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

[3]  Li Ping,et al.  Efficient soft-in-soft-out sub-optimal decoding rule for single parity check codes , 1997 .

[4]  Jung-Fu Cheng,et al.  Some High-Rate Near Capacity Codecs for the Gaussian Channel , 1996 .

[5]  Richard A. Silverman,et al.  Coding for constant-data-rate systems , 1954, Trans. IRE Prof. Group Inf. Theory.

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

[7]  Bernard Sklar,et al.  Digital communications , 1987 .

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

[9]  Sammy Chan,et al.  Iterative decoding of concatenated Hadamard codes , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[10]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[11]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[12]  Peter Adam Hoeher,et al.  Separable MAP "filters" for the decoding of product and concatenated codes , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[13]  Dariush Divsalar,et al.  Multiple turbo codes , 1995, Proceedings of MILCOM '95.

[14]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.