Iterative decoding of multi-dimensional concatenated single parity check codes

Author

Ping, Li ; Chan, Sammy ; Yeung, Kwan L.

Author_Institution

Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong

Volume

1

fYear

1998

fDate

7-11 Jun 1998

Firstpage

131

Abstract

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^-4-10^-5 can be achieved by the MAP and max-log-MAP decoders, respectively, with E_b/N₀ only 1 and 1.5 dB away from the theoretical limits

Keywords

concatenated codes; decoding; iterative methods; 3D concatenated codes; BER performance; MAP decoder; SPC code; iterative decoding; max-log-MAP decoder; multidimensional concatenated single parity check codes; rate 4/5 codes; rate 5/6 codes; simulation results; sub-optimal soft-in-soft-out decoding rule; Block codes; Concatenated codes; Convergence; Convolutional codes; Costing; Costs; Iterative algorithms; Iterative decoding; Multidimensional systems; Parity check codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on

Conference_Location

Atlanta, GA

Print_ISBN

0-7803-4788-9

Type

conf

DOI

10.1109/ICC.1998.682600

Filename

682600