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-di...

Full description

Saved in:
Bibliographic Details
Published in1998 IEEE International Conference on Communications Vol. 1; pp. 131 - 135 vol.1
Main Authors Li Ping, Chan, S., Yeung, K.L.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1998
Subjects
Block codes
Concatenated codes
Convergence
Convolutional codes
Costing
Costs
Iterative algorithms
Iterative decoding
Multidimensional systems
Parity check codes
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:0780347889
9780780347885
DOI:10.1109/ICC.1998.682600