Iterative decoding of multi-dimensional concatenated single parity check codes

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)62_Review of books or of software (or similar publications/items)peer-review

77 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)131-135
Journal / PublicationIEEE International Conference on Communications
Volume1
Publication statusPublished - 1998

Conference

TitleProceedings of the 1998 IEEE International Conference on Communications, ICC. Part 3 (of 3)
CityAtlanta, GA, USA
Period7 - 11 June 1998

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 to approximately 10-5 can be achieved by the MAP and Max-Log-MAP decoders, respectively, with Eb/N0 only 1 and 1.5 dB away from the theoretical limits.